0.00/0.00 c 2016-06-29T17:33:43+0200
0.00/0.00 c version = 0.5.0
0.00/0.00 c githash = 1a49202
0.00/0.00 c compilationtime = 2016-05-02 00:19:28.990761 UTC
0.00/0.00 c arch = x86_64
0.00/0.00 c os = linux
0.00/0.00 c compiler = ghc 7.10
0.00/0.00 c packages:
0.00/0.00 c OptDir-0.0.3
0.00/0.00 c array-0.5.1.0
0.00/0.00 c base-4.8.2.0
0.00/0.00 c bytestring-0.10.6.0
0.00/0.00 c bytestring-builder-0.10.6.0.0
0.00/0.00 c clock-0.7.2
0.00/0.00 c containers-0.5.6.2
0.00/0.00 c data-default-0.5.3
0.00/0.00 c data-default-class-0.0.1
0.00/0.00 c data-interval-1.2.0
0.00/0.00 c deepseq-1.4.1.1
0.00/0.00 c directory-1.2.2.0
0.00/0.00 c exceptions-0.8.2.1
0.00/0.00 c extended-reals-0.2.1.0
0.00/0.00 c filepath-1.4.0.0
0.00/0.00 c finite-field-0.8.0
0.00/0.00 c hashable-1.2.4.0
0.00/0.00 c heaps-0.3.3
0.00/0.00 c intern-0.9.1.4
0.00/0.00 c loop-0.3.0
0.00/0.00 c mtl-2.2.1
0.00/0.00 c multiset-0.3.2
0.00/0.00 c mwc-random-0.13.3.2
0.00/0.00 c parse_dimacs-1.3
0.00/0.00 c parsec-3.1.9
0.00/0.00 c prettyclass-1.0.0.0
0.00/0.00 c primes-0.2.1.0
0.00/0.00 c primitive-0.6.1.0
0.00/0.00 c process-1.2.3.0
0.00/0.00 c pseudo-boolean-0.1.3.0
0.00/0.01 c queue-0.1.2
0.00/0.01 c semigroups-0.18.1
0.00/0.01 c sign-0.4.3
0.00/0.01 c stm-2.4.4.1
0.00/0.01 c template-haskell-2.10.0.0
0.00/0.01 c temporary-1.2.0.4
0.00/0.01 c time-1.5.0.1
0.00/0.01 c transformers-0.4.2.0
0.00/0.01 c transformers-compat-0.5.1.4
0.00/0.01 c type-level-numbers-0.1.1.1
0.00/0.01 c unbounded-delays-0.1.0.9
0.00/0.01 c unordered-containers-0.2.6.0
0.00/0.01 c vector-0.11.0.0
0.00/0.01 c vector-space-0.10.3
0.00/0.01 c command line = ["+RTS","-H1G","-M15500m","-K1G","-RTS","--pb","--search=bcd2","HOME/instance-4117600-1467214423.opb"]
0.00/0.01 c use --random-gen="2033995380 2817758418 381115997 2486850123 1453440547 912289094 3448061614 1689780835 1918971109 3464545012 2392409236 3133565722 1272529070 2075756735 3739800653 3785673639 1720615677 2643826694 2222055812 2826490225 2764997250 4100733858 229321144 1168662213 468230201 3724978338 3938360811 2053197082 388080298 86601738 3031414055 199159228 2420716239 3560752118 1669996499 4137541817 2342099134 1304232254 3533489379 328749507 1622127904 2334445573 1121783830 1750224542 591098553 1013025382 550575258 3574086800 1417516478 3211943189 522984728 2223198472 1828471696 1814248222 2972615393 144783684 4060853537 4233444736 1921489360 3648099054 3564426023 1558509935 1199319917 2417726705 4259217358 1361995649 3437333406 1539675112 713908318 470479297 3699336675 2103584949 870636162 4235797801 526341510 3272028756 207585444 1162136424 489648731 1590680602 4051850386 3049060464 3508050133 701410730 291417973 3208629611 2121479039 232913996 3176739854 2151422414 1391378173 2872210340 2238544778 1777698385 4043334130 3485770858 3476224360 1987317986 4261941154 3800172855 3657484382 404321538 3666774027 1050276890 4101651603 2256750368 2365547990 1743255367 1829244803 547787791 215590184 1049213988 3579423871 888710894 1667131430 2753775521 38579396 621586848 3250536589 2257789859 2543524273 779928569 2943449640 4057948581 3724070460 3333873578 1420312750 2290794488 2648797972 2712180944 46474724 1375038659 1447597650 1377524703 3180412991 3365508753 3310833906 2731172891 191622844 310833816 3482949695 2125057664 3495439796 4065981659 1864409475 2119805752 2133126801 2197753058 3174178872 4211029360 1604447738 3609850542 229257786 519028955 1968522915 336589317 3764120481 158853068 260024201 936917943 4026102052 893909489 706845091 3550317287 3175944378 4146823302 1781880960 2810425528 1406887997 220841888 1147400109 972994677 3179912562 971960325 1466330656 3456021634 3497859282 1638579169 408430292 141280894 2560558154 168428946 677384426 2682785254 3775506131 3879460997 1739543441 3098356667 682002236 592307232 891247283 2097355360 2053737892 2819998772 87097824 1858418089 661135246 1835625407 3624218005 1985087899 1970557586 1679606936 2335338637 3929316346 2386842556 1023659648 1969153756 37315654 2654017466 792890106 794715263 497873868 3056907917 2970807723 2827427749 769735638 3350883472 1454291004 3173502420 97403669 3924789178 3979307473 1643961795 557639343 2392843260 1210945678 4212559684 1849999106 1991040940 998600798 497520539 249441539 1525632581 4154656407 2319609982 3131292891 3836170932 3893978714 542221166 2002634613 239622177 2457301612 1743461919 1107728109 591510330 3266507612 3548709337 616099529 1957081084 3816316793 1257392777 3451638530 270420267 2699655727 2182576989 842089823 255 362436" option to reproduce the execution
0.00/0.01 c #vars 100
0.00/0.01 c #constraints 58
0.00/0.01 c BCD2: Hardening is enabled.
0.00/0.01 c BCD2: BiasedSearch is enabled.
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 64 0 | 26 | 0
0.00/0.01 c 0.0s | 0 | 6 | 3 | 64 0 | 27 | 0
0.00/0.01 c #cpu_time = 0.001s
0.00/0.01 c #wall_clock_time = 0.001s
0.00/0.01 c #decision = 6
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 3
0.00/0.01 c #restart = 0
0.00/0.01 o 53
0.00/0.01 c BCD2: updating upper bound: 100 -> 52
0.00/0.01 c BCD2: 0 <= obj <= 52
0.00/0.01 c BCD2: #cores=0, #unrelaxed=100, #relaxed=0, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=1 bias=1/2
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 64 0 | 27 | 0
0.00/0.01 c 0.0s | 0 | 0 | 0 | 64 0 | 27 | 0
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 0
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 0
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.01 c lower bound updated to 1
0.00/0.01 c BCD2: 1 <= obj <= 52
0.00/0.01 c BCD2: #cores=1, #unrelaxed=99, #relaxed=1, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=2 bias=2/3
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 64 0 | 27 | 0
0.00/0.02 c 0.0s | 0 | 3 | 1 | 64 0 | 28 | 0
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 3
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 2
0.00/0.02 c BCD2: 2 <= obj <= 52
0.00/0.02 c BCD2: #cores=2, #unrelaxed=98, #relaxed=2, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=3 bias=3/4
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 28 | 0
0.00/0.02 c 0.0s | 0 | 5 | 1 | 64 0 | 29 | 0
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 5
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 3
0.00/0.02 c BCD2: 3 <= obj <= 52
0.00/0.02 c BCD2: #cores=3, #unrelaxed=97, #relaxed=3, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=4 bias=4/5
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 29 | 0
0.00/0.02 c 0.0s | 0 | 4 | 0 | 64 0 | 29 | 0
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 4
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.02 c lower bound updated to 4
0.00/0.02 c BCD2: 4 <= obj <= 52
0.00/0.02 c BCD2: #cores=4, #unrelaxed=95, #relaxed=5, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=5 bias=5/6
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 29 | 1
0.00/0.02 c 0.0s | 0 | 4 | 0 | 64 0 | 29 | 1
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 4
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 5
0.00/0.02 c BCD2: 5 <= obj <= 52
0.00/0.02 c BCD2: #cores=5, #unrelaxed=94, #relaxed=6, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=6 bias=6/7
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 29 | 1
0.00/0.02 c 0.0s | 0 | 7 | 1 | 64 0 | 29 | 1
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 7
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.02 c lower bound updated to 6
0.00/0.02 c BCD2: 6 <= obj <= 52
0.00/0.02 c BCD2: #cores=6, #unrelaxed=92, #relaxed=8, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=7 bias=7/8
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 29 | 1
0.00/0.02 c 0.0s | 0 | 8 | 2 | 64 0 | 29 | 1
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 8
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 2
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.02 c lower bound updated to 7
0.00/0.02 c BCD2: 7 <= obj <= 52
0.00/0.02 c BCD2: #cores=6, #unrelaxed=91, #relaxed=9, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=8 bias=8/9
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 30 | 1
0.00/0.02 c 0.0s | 0 | 8 | 1 | 64 0 | 30 | 2
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 8
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 5: cost of the new core is >=3
0.00/0.02 c lower bound updated to 8
0.00/0.02 c BCD2: 8 <= obj <= 52
0.00/0.02 c BCD2: #cores=6, #unrelaxed=89, #relaxed=11, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=9 bias=9/10
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 31 | 2
0.00/0.02 c 0.0s | 0 | 8 | 1 | 64 0 | 31 | 3
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 8
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 7: cost of the new core is >=4
0.00/0.02 c lower bound updated to 9
0.00/0.02 c BCD2: 9 <= obj <= 52
0.00/0.02 c BCD2: #cores=6, #unrelaxed=87, #relaxed=13, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=10 bias=10/11
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 32 | 3
0.00/0.02 c 0.0s | 0 | 6 | 0 | 64 0 | 32 | 4
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 6
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 10
0.00/0.02 c BCD2: 10 <= obj <= 52
0.00/0.02 c BCD2: #cores=7, #unrelaxed=86, #relaxed=14, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=11 bias=11/12
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 32 | 4
0.00/0.02 c 0.0s | 0 | 11 | 1 | 64 0 | 32 | 4
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 11
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 3 and merging with 1 cores into a new core of size 10: cost of the new core is >=5
0.00/0.02 c lower bound updated to 11
0.00/0.02 c BCD2: 11 <= obj <= 52
0.00/0.02 c BCD2: #cores=7, #unrelaxed=83, #relaxed=17, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=12 bias=12/13
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 33 | 4
0.00/0.02 c 0.0s | 0 | 15 | 2 | 64 0 | 33 | 5
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 15
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 2
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 5 and merging with 1 cores into a new core of size 15: cost of the new core is >=6
0.00/0.02 c lower bound updated to 12
0.00/0.02 c BCD2: 12 <= obj <= 52
0.00/0.02 c BCD2: #cores=7, #unrelaxed=78, #relaxed=22, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=13 bias=13/14
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 34 | 5
0.00/0.02 c 0.0s | 0 | 13 | 1 | 64 0 | 34 | 6
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 13
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.02 c lower bound updated to 13
0.00/0.02 c BCD2: 13 <= obj <= 52
0.00/0.02 c BCD2: #cores=8, #unrelaxed=74, #relaxed=26, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=14 bias=14/15
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 34 | 6
0.00/0.02 c 0.0s | 0 | 12 | 1 | 64 0 | 34 | 6
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 12
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.02 c lower bound updated to 14
0.00/0.02 c BCD2: 14 <= obj <= 52
0.00/0.02 c BCD2: #cores=9, #unrelaxed=72, #relaxed=28, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=15 bias=15/16
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 64 0 | 34 | 6
0.00/0.03 c 0.0s | 0 | 14 | 2 | 64 0 | 34 | 6
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 14
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 3 and merging with 1 cores into a new core of size 7: cost of the new core is >=2
0.00/0.03 c lower bound updated to 15
0.00/0.03 c BCD2: 15 <= obj <= 52
0.00/0.03 c BCD2: #cores=9, #unrelaxed=69, #relaxed=31, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=16 bias=16/17
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 35 | 6
0.00/0.03 c 0.0s | 0 | 11 | 0 | 64 0 | 35 | 7
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 11
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 16
0.00/0.03 c BCD2: 16 <= obj <= 52
0.00/0.03 c BCD2: #cores=10, #unrelaxed=68, #relaxed=32, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=17 bias=17/18
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 35 | 7
0.00/0.03 c 0.0s | 0 | 17 | 2 | 64 0 | 35 | 7
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 17
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 16: cost of the new core is >=7
0.00/0.03 c lower bound updated to 17
0.00/0.03 c BCD2: 17 <= obj <= 52
0.00/0.03 c BCD2: #cores=10, #unrelaxed=67, #relaxed=33, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=18 bias=18/19
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 36 | 7
0.00/0.03 c 0.0s | 0 | 21 | 1 | 64 0 | 36 | 8
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 21
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 18
0.00/0.03 c BCD2: 18 <= obj <= 52
0.00/0.03 c BCD2: #cores=11, #unrelaxed=65, #relaxed=35, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=19 bias=19/20
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 36 | 8
0.00/0.03 c 0.0s | 0 | 20 | 2 | 64 0 | 36 | 8
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 20
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 2 and merging with 3 cores into a new core of size 13: cost of the new core is >=5
0.00/0.03 c lower bound updated to 19
0.00/0.03 c BCD2: 19 <= obj <= 52
0.00/0.03 c BCD2: #cores=9, #unrelaxed=63, #relaxed=37, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=20 bias=20/21
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 39 | 8
0.00/0.03 c 0.0s | 0 | 14 | 0 | 64 0 | 39 | 11
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 14
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 20
0.00/0.03 c BCD2: 20 <= obj <= 52
0.00/0.03 c BCD2: #cores=10, #unrelaxed=62, #relaxed=38, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=21 bias=21/22
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 39 | 11
0.00/0.03 c 0.0s | 0 | 17 | 3 | 64 0 | 39 | 11
0.00/0.03 c #cpu_time = 0.001s
0.00/0.03 c #wall_clock_time = 0.001s
0.00/0.03 c #decision = 17
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 3
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 5 and merging with 1 cores into a new core of size 21: cost of the new core is >=8
0.00/0.03 c lower bound updated to 21
0.00/0.03 c BCD2: 21 <= obj <= 52
0.00/0.03 c BCD2: #cores=10, #unrelaxed=57, #relaxed=43, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=22 bias=22/23
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 40 | 11
0.00/0.03 c 0.0s | 0 | 15 | 1 | 64 0 | 40 | 12
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 15
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.03 c lower bound updated to 22
0.00/0.03 c BCD2: 22 <= obj <= 52
0.00/0.03 c BCD2: #cores=11, #unrelaxed=53, #relaxed=47, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=23 bias=23/24
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 40 | 12
0.00/0.03 c 0.0s | 0 | 27 | 1 | 64 0 | 41 | 12
0.00/0.03 c #cpu_time = 0.001s
0.00/0.03 c #wall_clock_time = 0.001s
0.00/0.03 c #decision = 27
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 23
0.00/0.03 c BCD2: 23 <= obj <= 52
0.00/0.03 c BCD2: #cores=12, #unrelaxed=52, #relaxed=48, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=24 bias=24/25
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 41 | 12
0.00/0.03 c 0.0s | 0 | 33 | 1 | 64 0 | 42 | 12
0.00/0.03 c #cpu_time = 0.001s
0.00/0.03 c #wall_clock_time = 0.001s
0.00/0.03 c #decision = 33
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 24
0.00/0.03 c BCD2: 24 <= obj <= 52
0.00/0.03 c BCD2: #cores=13, #unrelaxed=51, #relaxed=49, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=25 bias=25/26
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 42 | 12
0.00/0.03 c 0.0s | 0 | 17 | 0 | 64 0 | 42 | 12
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 17
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 25
0.00/0.03 c BCD2: 25 <= obj <= 52
0.00/0.03 c BCD2: #cores=14, #unrelaxed=50, #relaxed=50, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=26 bias=26/27
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 64 0 | 42 | 12
0.00/0.03 c 0.0s | 0 | 19 | 0 | 64 0 | 42 | 12
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 19
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 26
0.00/0.03 c BCD2: 26 <= obj <= 52
0.00/0.03 c BCD2: #cores=15, #unrelaxed=48, #relaxed=52, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=27 bias=27/28
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 42 | 12
0.00/0.04 c 0.0s | 0 | 24 | 1 | 64 0 | 42 | 12
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 24
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.04 c lower bound updated to 27
0.00/0.04 c BCD2: 27 <= obj <= 52
0.00/0.04 c BCD2: #cores=15, #unrelaxed=47, #relaxed=53, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=28 bias=28/29
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 43 | 12
0.00/0.04 c 0.0s | 0 | 24 | 1 | 64 0 | 43 | 13
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 24
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 4: cost of the new core is >=3
0.00/0.04 c lower bound updated to 28
0.00/0.04 c BCD2: 28 <= obj <= 52
0.00/0.04 c BCD2: #cores=15, #unrelaxed=46, #relaxed=54, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=29 bias=29/30
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 44 | 13
0.00/0.04 c 0.0s | 0 | 22 | 1 | 64 0 | 44 | 14
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 22
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 5: cost of the new core is >=4
0.00/0.04 c lower bound updated to 29
0.00/0.04 c BCD2: 29 <= obj <= 52
0.00/0.04 c BCD2: #cores=15, #unrelaxed=45, #relaxed=55, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=30 bias=30/31
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 45 | 14
0.00/0.04 c 0.0s | 0 | 19 | 0 | 64 0 | 45 | 15
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 19
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.04 c lower bound updated to 30
0.00/0.04 c BCD2: 30 <= obj <= 52
0.00/0.04 c BCD2: #cores=16, #unrelaxed=43, #relaxed=57, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=31 bias=31/32
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 45 | 15
0.00/0.04 c 0.0s | 0 | 24 | 1 | 64 0 | 45 | 15
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 24
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 6: cost of the new core is >=5
0.00/0.04 c lower bound updated to 31
0.00/0.04 c BCD2: 31 <= obj <= 52
0.00/0.04 c BCD2: #cores=16, #unrelaxed=42, #relaxed=58, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=32 bias=32/33
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 46 | 15
0.00/0.04 c 0.0s | 0 | 21 | 0 | 64 0 | 46 | 16
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 21
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 32
0.00/0.04 c BCD2: 32 <= obj <= 52
0.00/0.04 c BCD2: #cores=17, #unrelaxed=41, #relaxed=59, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=33 bias=33/34
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 46 | 16
0.00/0.04 c 0.0s | 0 | 23 | 1 | 64 0 | 46 | 16
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 23
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 5 and merging with 1 cores into a new core of size 7: cost of the new core is >=2
0.00/0.04 c lower bound updated to 33
0.00/0.04 c BCD2: 33 <= obj <= 52
0.00/0.04 c BCD2: #cores=17, #unrelaxed=36, #relaxed=64, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=34 bias=34/35
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 47 | 16
0.00/0.04 c 0.0s | 0 | 37 | 1 | 64 0 | 48 | 17
0.00/0.04 c #cpu_time = 0.001s
0.00/0.04 c #wall_clock_time = 0.001s
0.00/0.04 c #decision = 37
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 34
0.00/0.04 c BCD2: 34 <= obj <= 52
0.00/0.04 c BCD2: #cores=18, #unrelaxed=35, #relaxed=65, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=35 bias=35/36
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 48 | 17
0.00/0.04 c 0.0s | 0 | 21 | 1 | 64 0 | 48 | 17
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 21
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 9: cost of the new core is >=3
0.00/0.04 c lower bound updated to 35
0.00/0.04 c BCD2: 35 <= obj <= 52
0.00/0.04 c BCD2: #cores=18, #unrelaxed=33, #relaxed=67, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=36 bias=36/37
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 49 | 17
0.00/0.04 c 0.0s | 0 | 21 | 0 | 64 0 | 49 | 18
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 21
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 36
0.00/0.04 c BCD2: 36 <= obj <= 52
0.00/0.04 c BCD2: #cores=19, #unrelaxed=32, #relaxed=68, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=37 bias=37/38
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 49 | 18
0.00/0.04 c 0.0s | 0 | 23 | 2 | 64 0 | 49 | 18
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 23
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 2
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.04 c lower bound updated to 37
0.00/0.04 c BCD2: 37 <= obj <= 52
0.00/0.04 c BCD2: #cores=20, #unrelaxed=30, #relaxed=70, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=38 bias=38/39
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 64 0 | 49 | 18
0.00/0.04 c 0.0s | 0 | 23 | 0 | 64 0 | 49 | 18
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 23
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 38
0.00/0.04 c BCD2: 38 <= obj <= 52
0.00/0.04 c BCD2: #cores=21, #unrelaxed=29, #relaxed=71, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=39 bias=39/40
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 49 | 18
0.00/0.05 c 0.0s | 0 | 27 | 1 | 64 0 | 49 | 18
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 27
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 1
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 11: cost of the new core is >=4
0.00/0.05 c lower bound updated to 39
0.00/0.05 c BCD2: 39 <= obj <= 52
0.00/0.05 c BCD2: #cores=21, #unrelaxed=27, #relaxed=73, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=40 bias=40/41
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 50 | 18
0.00/0.05 c 0.0s | 0 | 26 | 1 | 64 0 | 50 | 19
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 26
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 1
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: relaxing 4 and merging with 2 cores into a new core of size 17: cost of the new core is >=6
0.00/0.05 c lower bound updated to 40
0.00/0.05 c BCD2: 40 <= obj <= 52
0.00/0.05 c BCD2: #cores=20, #unrelaxed=23, #relaxed=77, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=41 bias=41/42
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 52 | 19
0.00/0.05 c 0.0s | 0 | 21 | 0 | 64 0 | 52 | 21
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 21
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 0
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.05 c lower bound updated to 41
0.00/0.05 c BCD2: 41 <= obj <= 52
0.00/0.05 c BCD2: #cores=21, #unrelaxed=22, #relaxed=78, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=42 bias=42/43
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 52 | 21
0.00/0.05 c 0.0s | 0 | 22 | 0 | 64 0 | 52 | 21
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 22
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 0
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.05 c lower bound updated to 42
0.00/0.05 c BCD2: 42 <= obj <= 52
0.00/0.05 c BCD2: #cores=22, #unrelaxed=21, #relaxed=79, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=43 bias=43/44
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 52 | 21
0.00/0.05 c 0.0s | 0 | 23 | 0 | 64 0 | 52 | 21
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 23
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 0
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.05 c lower bound updated to 43
0.00/0.05 c BCD2: 43 <= obj <= 52
0.00/0.05 c BCD2: #cores=23, #unrelaxed=20, #relaxed=80, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=44 bias=44/45
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 52 | 21
0.00/0.05 c 0.0s | 0 | 26 | 1 | 64 0 | 52 | 21
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 26
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 1
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.05 c lower bound updated to 44
0.00/0.05 c BCD2: 44 <= obj <= 52
0.00/0.05 c BCD2: #cores=24, #unrelaxed=18, #relaxed=82, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=45 bias=45/46
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 52 | 21
0.00/0.05 c 0.0s | 0 | 25 | 0 | 64 0 | 52 | 21
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 25
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 0
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.05 c lower bound updated to 45
0.00/0.05 c BCD2: 45 <= obj <= 52
0.00/0.05 c BCD2: #cores=25, #unrelaxed=17, #relaxed=83, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=46 bias=46/47
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 52 | 21
0.00/0.05 c 0.0s | 0 | 28 | 1 | 64 0 | 52 | 21
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 28
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 1
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.05 c lower bound updated to 46
0.00/0.05 c BCD2: 46 <= obj <= 52
0.00/0.05 c BCD2: #cores=25, #unrelaxed=15, #relaxed=85, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=47 bias=47/48
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 53 | 22
0.00/0.05 c 0.0s | 0 | 26 | 0 | 64 0 | 53 | 23
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 26
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 0
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.05 c lower bound updated to 47
0.00/0.05 c BCD2: 47 <= obj <= 52
0.00/0.05 c BCD2: #cores=26, #unrelaxed=14, #relaxed=86, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=48 bias=48/49
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 53 | 23
0.00/0.05 c 0.0s | 0 | 27 | 0 | 64 0 | 53 | 23
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 27
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 0
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.05 c lower bound updated to 48
0.00/0.05 c BCD2: 48 <= obj <= 52
0.00/0.05 c BCD2: #cores=27, #unrelaxed=13, #relaxed=87, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=49 bias=49/50
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 53 | 23
0.00/0.05 c 0.0s | 0 | 39 | 5 | 64 0 | 57 | 27
0.00/0.05 c #cpu_time = 0.001s
0.00/0.05 c #wall_clock_time = 0.001s
0.00/0.05 c #decision = 39
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 5
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: updating lower bound of a core
0.00/0.05 c lower bound updated to 50
0.00/0.05 c BCD2: 50 <= obj <= 52
0.00/0.05 c BCD2: #cores=27, #unrelaxed=13, #relaxed=87, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=50 bias=50/51
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 64 0 | 57 | 28
0.00/0.06 c 0.0s | 0 | 31 | 3 | 64 0 | 124 | 28
0.00/0.06 c #cpu_time = 0.001s
0.00/0.06 c #wall_clock_time = 0.001s
0.00/0.06 c #decision = 31
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 3
0.00/0.06 c #restart = 0
0.00/0.06 c lower bound updated to 53
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 v x1 x2 x3 -x4 x5 -x6 x7 -x8 x9 x10
0.00/0.06 v x11 -x12 -x13 x14 -x15 x16 -x17 -x18 x19 x20
0.00/0.06 v x21 x22 x23 -x24 x25 -x26 x27 -x28 x29 -x30
0.00/0.06 v x31 x32 x33 x34 x35 x36 -x37 x38 -x39 x40
0.00/0.06 v -x41 -x42 x43 -x44 x45 x46 -x47 x48 x49 -x50
0.00/0.06 v -x51 -x52 -x53 x54 -x55 -x56 -x57 -x58 x59 x60
0.00/0.06 v x61 x62 -x63 x64 x65 -x66 -x67 x68 -x69 x70
0.00/0.06 v -x71 -x72 x73 -x74 x75 -x76 -x77 -x78 -x79 -x80
0.00/0.06 v x81 x82 -x83 -x84 x85 x86 x87 x88 -x89 -x90
0.00/0.06 v -x91 x92 x93 -x94 x95 -x96 x97 -x98 -x99 x100
0.00/0.06 c total CPU time = 0.058s
0.00/0.06 c total wall clock time = 0.058s