-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathexpected_log_GCC_07_Newlands_K25.txt
1069 lines (1049 loc) · 37.1 KB
/
expected_log_GCC_07_Newlands_K25.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.999951839447
Row 'c14' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.01 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.02 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.02 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.977803945541
Row 'c17' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.02 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.03 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.03 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.975798845291
Tried aggregator 2 times.
MIP Presolve eliminated 30 rows and 24 columns.
MIP Presolve modified 1 coefficients.
Aggregator did 4 substitutions.
Reduced MIP has 4 rows, 8 columns, and 18 nonzeros.
Reduced MIP has 0 binaries, 8 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.06 ticks)
Found incumbent of value 88.000000 after 0.00 sec. (0.08 ticks)
Tried aggregator 1 time.
Reduced MIP has 4 rows, 8 columns, and 18 nonzeros.
Reduced MIP has 0 binaries, 8 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.01 ticks)
MIP emphasis: integer feasibility.
MIP search method: dynamic search.
Parallel mode: none, using 1 thread.
Root relaxation solution time = 0.00 sec. (0.01 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
* 0+ 0 88.0000 0.0000 100.00%
0 0 19.5000 2 88.0000 19.5000 2 77.84%
* 0+ 0 20.0000 19.5000 2.50%
0 0 cutoff 20.0000 19.5000 2 2.50%
Elapsed time = 0.00 sec. (0.12 ticks, tree = 0.01 MB, solutions = 2)
Root node processing (before b&c):
Real time = 0.00 sec. (0.12 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.12 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.97211098671
Row 'c21' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.02 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.03 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.03 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.970094919205
Tried aggregator 2 times.
MIP Presolve eliminated 30 rows and 24 columns.
MIP Presolve modified 1 coefficients.
Aggregator did 4 substitutions.
Reduced MIP has 4 rows, 8 columns, and 18 nonzeros.
Reduced MIP has 0 binaries, 8 generals, 0 SOSs, and 0 indicators.
Presolve time = 0.00 sec. (0.06 ticks)
Found incumbent of value 0.000000 after 0.00 sec. (0.07 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.07 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.07 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.967513799667
Row 'c25' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.02 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.03 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.03 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.96560883522
Row 'c20' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.01 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.02 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.02 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.963818788528
Row 'c29' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.02 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.03 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.03 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.961931943893
Row 'c31' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.01 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.02 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.02 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.959929943085
Found incumbent of value 63.000000 after 0.00 sec. (0.01 ticks)
Tried aggregator 2 times.
MIP Presolve eliminated 56 rows and 78 columns.
MIP Presolve modified 83 coefficients.
Aggregator did 1 substitutions.
All rows and columns eliminated.
Presolve time = 0.00 sec. (0.14 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.16 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.16 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.957735776901
Row 'c24' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.01 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.02 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.02 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.955924987793
Row 'c37' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.02 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.03 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.03 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.954045772552
Row 'c31' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.01 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.02 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.02 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.952231884003
Row 'c41' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.02 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.03 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.03 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.950358867645
Row 'c28' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.01 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.02 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.02 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.948561906815
Row 'c45' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.02 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.03 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.03 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.946680784225
Row 'c30' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.01 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.02 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.02 ticks)
CPXPARAM_Threads 1
CPXPARAM_Emphasis_MIP 1
CPXPARAM_TimeLimit 86399.944894790649
Row 'c49' infeasible, all entries at implied bounds.
Presolve time = 0.00 sec. (0.02 ticks)
Root node processing (before b&c):
Real time = 0.00 sec. (0.03 ticks)
Sequential b&c:
Real time = 0.00 sec. (0.00 ticks)
------------
Total (root+branch&cut) = 0.00 sec. (0.03 ticks)
--------------------------------
Current state of priority queue:
Node 2--e with distance 0
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 88
BEST LOWER BOUND = 0
TOTAL TIME USED SO FAR: 0.0569942
DistanceTo's solved: 18
Adding node to fringe: 2--e 1--e with distance 0
Adding node to fringe: 2--e 4--q with distance 31
Adding node to fringe: 2--e 7--e with distance 86
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 1--e with distance 0
....
Node 2--e 7--e with distance 86
--------------------------------
CURRENT UPPER BOUND = 88
BEST LOWER BOUND = 0
TOTAL TIME USED SO FAR: 0.102484
DistanceTo's solved: 34
Adding node to fringe: 2--e 1--e 4--q with distance 0
Adding node to fringe: 2--e 1--e 7--e with distance 15
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q with distance 0
....
Node 2--e 7--e with distance 86
--------------------------------
CURRENT UPPER BOUND = 88
BEST LOWER BOUND = 0
TOTAL TIME USED SO FAR: 0.149829
DistanceTo's solved: 48
Adding node to fringe: 2--e 1--e 4--q 7--e with distance 0
Adding node to fringe: 2--e 1--e 4--q 8--e with distance 82
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q 7--e with distance 0
....
Node 2--e 7--e with distance 86
--------------------------------
CURRENT UPPER BOUND = 88
BEST LOWER BOUND = 0
TOTAL TIME USED SO FAR: 0.446002
DistanceTo's solved: 60
Adding node to fringe: 2--e 1--e 4--q 7--e 0--e with distance 43
Adding node to fringe: 2--e 1--e 4--q 7--e 8--e with distance 0
Size of fringe: 8
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q 7--e 8--e with distance 0
....
Node 2--e 7--e with distance 86
--------------------------------
CURRENT UPPER BOUND = 88
BEST LOWER BOUND = 0
TOTAL TIME USED SO FAR: 1.18983
DistanceTo's solved: 70
Adding node to fringe: 2--e 1--e 4--q 7--e 8--e 0--e with distance 0
Size of fringe: 8
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q 7--e 8--e 0--e with distance 0
....
Node 2--e 7--e with distance 86
--------------------------------
CURRENT UPPER BOUND = 88
BEST LOWER BOUND = 0
TOTAL TIME USED SO FAR: 2.24846
DistanceTo's solved: 78
Adding node to fringe: 2--e 1--e 4--q 7--e 8--e 0--e 3--q with distance 0
Adding node to fringe: 2--e 1--e 4--q 7--e 8--e 0--e 5--e with distance 0
Adding node to fringe: 2--e 1--e 4--q 7--e 8--e 0--e 6--e with distance 81
Size of fringe: 10
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q 7--e 8--e 0--e 3--q with distance 0
....
Node 2--e 7--e with distance 86
--------------------------------
CURRENT UPPER BOUND = 88
BEST LOWER BOUND = 0
TOTAL TIME USED SO FAR: 3.71667
DistanceTo's solved: 84
Pruning node 2--e 1--e 4--q 7--e 8--e 0--e 6--e with distance 81
Pruning node 2--e 1--e 4--q 8--e with distance 82
Pruning node 2--e 7--e with distance 86
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q 7--e 8--e 0--e 5--e with distance 0
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 0
TOTAL TIME USED SO FAR: 15.7478
DistanceTo's solved: 86
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e with distance 15
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 15
TOTAL TIME USED SO FAR: 15.748
DistanceTo's solved: 86
Adding node to fringe: 2--e 1--e 7--e 4--q with distance 15
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e 4--q with distance 15
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 15
TOTAL TIME USED SO FAR: 15.8353
DistanceTo's solved: 98
Adding node to fringe: 2--e 1--e 7--e 4--q 0--e with distance 43
Adding node to fringe: 2--e 1--e 7--e 4--q 8--e with distance 15
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e 4--q 8--e with distance 15
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 15
TOTAL TIME USED SO FAR: 17.1299
DistanceTo's solved: 108
Adding node to fringe: 2--e 1--e 7--e 4--q 8--e 0--e with distance 15
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e 4--q 8--e 0--e with distance 15
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 15
TOTAL TIME USED SO FAR: 19.5581
DistanceTo's solved: 116
Adding node to fringe: 2--e 1--e 7--e 4--q 8--e 0--e 3--q with distance 15
Adding node to fringe: 2--e 1--e 7--e 4--q 8--e 0--e 5--e with distance 15
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e 4--q 8--e 0--e 3--q with distance 15
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 15
TOTAL TIME USED SO FAR: 22.7964
DistanceTo's solved: 122
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e 4--q 8--e 0--e 5--e with distance 15
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 15
TOTAL TIME USED SO FAR: 64.6121
DistanceTo's solved: 124
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 1--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 64.6123
DistanceTo's solved: 124
Adding node to fringe: 1--e 2--e with distance 20
Adding node to fringe: 1--e 4--q with distance 32
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 1--e 2--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 64.6558
DistanceTo's solved: 140
Adding node to fringe: 1--e 2--e 4--q with distance 20
Adding node to fringe: 1--e 2--e 7--e with distance 20
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 1--e 2--e 4--q with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 64.7004
DistanceTo's solved: 154
Adding node to fringe: 1--e 2--e 4--q 7--e with distance 20
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 1--e 2--e 7--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 64.9524
DistanceTo's solved: 166
Adding node to fringe: 1--e 2--e 7--e 4--q with distance 20
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 1--e 2--e 4--q 7--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 65.0384
DistanceTo's solved: 178
Node subsumed: 1--e 2--e 4--q 7--e 0--e with distance 43
Adding node to fringe: 1--e 2--e 4--q 7--e 8--e with distance 20
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 1--e 2--e 7--e 4--q with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 65.6991
DistanceTo's solved: 188
Node subsumed: 1--e 2--e 7--e 4--q 0--e with distance 43
Adding node to fringe: 1--e 2--e 7--e 4--q 8--e with distance 20
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 1--e 2--e 4--q 7--e 8--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 67.1101
DistanceTo's solved: 198
Adding node to fringe: 1--e 2--e 4--q 7--e 8--e 0--e with distance 20
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 1--e 2--e 7--e 4--q 8--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 68.5805
DistanceTo's solved: 206
Adding node to fringe: 1--e 2--e 7--e 4--q 8--e 0--e with distance 20
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 1--e 2--e 4--q 7--e 8--e 0--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 71.0251
DistanceTo's solved: 214
Adding node to fringe: 1--e 2--e 4--q 7--e 8--e 0--e 3--q with distance 20
Adding node to fringe: 1--e 2--e 4--q 7--e 8--e 0--e 5--e with distance 20
Size of fringe: 8
--------------------------------
Current state of priority queue:
Node 1--e 2--e 7--e 4--q 8--e 0--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 72.56
DistanceTo's solved: 220
Adding node to fringe: 1--e 2--e 7--e 4--q 8--e 0--e 3--q with distance 20
Adding node to fringe: 1--e 2--e 7--e 4--q 8--e 0--e 5--e with distance 20
Size of fringe: 9
--------------------------------
Current state of priority queue:
Node 1--e 2--e 4--q 7--e 8--e 0--e 3--q with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 76.0845
DistanceTo's solved: 226
Size of fringe: 8
--------------------------------
Current state of priority queue:
Node 1--e 2--e 4--q 7--e 8--e 0--e 5--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 89.5416
DistanceTo's solved: 228
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 1--e 2--e 7--e 4--q 8--e 0--e 3--q with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 89.5418
DistanceTo's solved: 228
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 1--e 2--e 7--e 4--q 8--e 0--e 5--e with distance 20
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 20
TOTAL TIME USED SO FAR: 117.512
DistanceTo's solved: 230
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 4--q with distance 31
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 31
TOTAL TIME USED SO FAR: 117.512
DistanceTo's solved: 230
Adding node to fringe: 2--e 4--q 1--e with distance 31
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e with distance 31
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 31
TOTAL TIME USED SO FAR: 117.655
DistanceTo's solved: 244
Adding node to fringe: 2--e 4--q 1--e 7--e with distance 31
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e 7--e with distance 31
....
Node 4--q with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 31
TOTAL TIME USED SO FAR: 117.924
DistanceTo's solved: 256
Adding node to fringe: 2--e 4--q 1--e 7--e 0--e with distance 63
Adding node to fringe: 2--e 4--q 1--e 7--e 8--e with distance 31
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e 7--e 8--e with distance 31
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 31
TOTAL TIME USED SO FAR: 118.63
DistanceTo's solved: 266
Adding node to fringe: 2--e 4--q 1--e 7--e 8--e 0--e with distance 31
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e 7--e 8--e 0--e with distance 31
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 31
TOTAL TIME USED SO FAR: 119.939
DistanceTo's solved: 274
Adding node to fringe: 2--e 4--q 1--e 7--e 8--e 0--e 3--q with distance 31
Adding node to fringe: 2--e 4--q 1--e 7--e 8--e 0--e 5--e with distance 31
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e 7--e 8--e 0--e 3--q with distance 31
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 31
TOTAL TIME USED SO FAR: 120.908
DistanceTo's solved: 280
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e 7--e 8--e 0--e 5--e with distance 31
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 31
TOTAL TIME USED SO FAR: 127.829
DistanceTo's solved: 282
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 1--e 4--q with distance 32
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 32
TOTAL TIME USED SO FAR: 127.829
DistanceTo's solved: 282
Adding node to fringe: 1--e 4--q 2--e with distance 32
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e with distance 32
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 32
TOTAL TIME USED SO FAR: 127.965
DistanceTo's solved: 296
Adding node to fringe: 1--e 4--q 2--e 7--e with distance 32
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e 7--e with distance 32
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 32
TOTAL TIME USED SO FAR: 128.224
DistanceTo's solved: 308
Adding node to fringe: 1--e 4--q 2--e 7--e 0--e with distance 59
Adding node to fringe: 1--e 4--q 2--e 7--e 8--e with distance 32
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e 7--e 8--e with distance 32
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 32
TOTAL TIME USED SO FAR: 128.902
DistanceTo's solved: 318
Adding node to fringe: 1--e 4--q 2--e 7--e 8--e 0--e with distance 32
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e 7--e 8--e 0--e with distance 32
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 32
TOTAL TIME USED SO FAR: 130.362
DistanceTo's solved: 326
Adding node to fringe: 1--e 4--q 2--e 7--e 8--e 0--e 3--q with distance 32
Adding node to fringe: 1--e 4--q 2--e 7--e 8--e 0--e 5--e with distance 32
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e 7--e 8--e 0--e 3--q with distance 32
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 32
TOTAL TIME USED SO FAR: 131.319
DistanceTo's solved: 332
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e 7--e 8--e 0--e 5--e with distance 32
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 32
TOTAL TIME USED SO FAR: 135.359
DistanceTo's solved: 334
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q 7--e 0--e with distance 43
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 43
TOTAL TIME USED SO FAR: 135.36
DistanceTo's solved: 334
Adding node to fringe: 2--e 1--e 4--q 7--e 0--e 8--e with distance 43
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e 4--q 0--e with distance 43
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 43
TOTAL TIME USED SO FAR: 137.197
DistanceTo's solved: 342
Adding node to fringe: 2--e 1--e 7--e 4--q 0--e 8--e with distance 43
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q 7--e 0--e 8--e with distance 43
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 43
TOTAL TIME USED SO FAR: 141.163
DistanceTo's solved: 350
Adding node to fringe: 2--e 1--e 4--q 7--e 0--e 8--e 3--q with distance 43
Adding node to fringe: 2--e 1--e 4--q 7--e 0--e 8--e 5--e with distance 43
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e 4--q 0--e 8--e with distance 43
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 43
TOTAL TIME USED SO FAR: 142.837
DistanceTo's solved: 356
Adding node to fringe: 2--e 1--e 7--e 4--q 0--e 8--e 3--q with distance 43
Adding node to fringe: 2--e 1--e 7--e 4--q 0--e 8--e 5--e with distance 43
Size of fringe: 7
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q 7--e 0--e 8--e 3--q with distance 43
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 43
TOTAL TIME USED SO FAR: 151.892
DistanceTo's solved: 362
Size of fringe: 6
--------------------------------
Current state of priority queue:
Node 2--e 1--e 4--q 7--e 0--e 8--e 5--e with distance 43
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 43
TOTAL TIME USED SO FAR: 199.028
DistanceTo's solved: 364
Size of fringe: 5
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e 4--q 0--e 8--e 3--q with distance 43
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 43
TOTAL TIME USED SO FAR: 199.029
DistanceTo's solved: 364
Size of fringe: 4
--------------------------------
Current state of priority queue:
Node 2--e 1--e 7--e 4--q 0--e 8--e 5--e with distance 43
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 43
TOTAL TIME USED SO FAR: 236.976
DistanceTo's solved: 366
Size of fringe: 3
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e 7--e 0--e with distance 59
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 59
TOTAL TIME USED SO FAR: 236.976
DistanceTo's solved: 366
Adding node to fringe: 1--e 4--q 2--e 7--e 0--e 8--e with distance 59
Size of fringe: 3
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e 7--e 0--e 8--e with distance 59
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 59
TOTAL TIME USED SO FAR: 239.081
DistanceTo's solved: 374
Adding node to fringe: 1--e 4--q 2--e 7--e 0--e 8--e 3--q with distance 59
Adding node to fringe: 1--e 4--q 2--e 7--e 0--e 8--e 5--e with distance 59
Size of fringe: 4
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e 7--e 0--e 8--e 3--q with distance 59
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 59
TOTAL TIME USED SO FAR: 240.443
DistanceTo's solved: 380
Size of fringe: 3
--------------------------------
Current state of priority queue:
Node 1--e 4--q 2--e 7--e 0--e 8--e 5--e with distance 59
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 59
TOTAL TIME USED SO FAR: 249.602
DistanceTo's solved: 382
Size of fringe: 2
--------------------------------
Current state of priority queue:
Node 4--q with distance 63
....
Node 2--e 4--q 1--e 7--e 0--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 63
TOTAL TIME USED SO FAR: 249.603
DistanceTo's solved: 382
Adding node to fringe: 4--q 1--e with distance 63
Adding node to fringe: 4--q 2--e with distance 63
Size of fringe: 3
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e 7--e 0--e with distance 63
....
Node 4--q 2--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 63
TOTAL TIME USED SO FAR: 249.686
DistanceTo's solved: 398
Adding node to fringe: 2--e 4--q 1--e 7--e 0--e 8--e with distance 63
Size of fringe: 3
--------------------------------
Current state of priority queue:
Node 4--q 1--e with distance 63
....
Node 2--e 4--q 1--e 7--e 0--e 8--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 63
TOTAL TIME USED SO FAR: 251.176
DistanceTo's solved: 406
Adding node to fringe: 4--q 1--e 2--e with distance 63
Size of fringe: 3
--------------------------------
Current state of priority queue:
Node 4--q 2--e with distance 63
....
Node 4--q 1--e 2--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 63
TOTAL TIME USED SO FAR: 251.312
DistanceTo's solved: 420
Node subsumed: 4--q 2--e 1--e with distance 63
Size of fringe: 2
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e 7--e 0--e 8--e with distance 63
....
Node 4--q 1--e 2--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 63
TOTAL TIME USED SO FAR: 251.441
DistanceTo's solved: 434
Adding node to fringe: 2--e 4--q 1--e 7--e 0--e 8--e 3--q with distance 63
Adding node to fringe: 2--e 4--q 1--e 7--e 0--e 8--e 5--e with distance 63
Size of fringe: 3
--------------------------------
Current state of priority queue:
Node 4--q 1--e 2--e with distance 63
....
Node 2--e 4--q 1--e 7--e 0--e 8--e 5--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 63
TOTAL TIME USED SO FAR: 252.527
DistanceTo's solved: 440
Adding node to fringe: 4--q 1--e 2--e 7--e with distance 63
Size of fringe: 3
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e 7--e 0--e 8--e 3--q with distance 63
....
Node 4--q 1--e 2--e 7--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 63
TOTAL TIME USED SO FAR: 252.808
DistanceTo's solved: 452
Size of fringe: 2
--------------------------------
Current state of priority queue:
Node 2--e 4--q 1--e 7--e 0--e 8--e 5--e with distance 63
....
Node 4--q 1--e 2--e 7--e with distance 63
--------------------------------
CURRENT UPPER BOUND = 74
BEST LOWER BOUND = 63
TOTAL TIME USED SO FAR: 258.677
DistanceTo's solved: 454