0.00/0.00 c 2016-06-18T08:07:18+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-4102529-1466230038.opb"]
0.00/0.01 c use --random-gen="2187143172 3749038919 4020093537 2803633859 1365859806 3876730237 3369369561 3665522160 419304965 854124636 2826925421 2734604458 1891893948 2292256602 1686350103 1436900792 2041815995 2426103359 767132113 1796191927 1348894507 2171198147 3809864335 2079821759 3276206363 361888577 3456672856 2942837960 1302329193 1501412784 239345312 1998420669 2043283037 1876652622 3147532223 1057728603 431254471 2880774706 2309893513 4030489590 2637958186 1170269359 2140109454 2050532865 4198002497 147102409 3315900573 4171301971 294157649 969522230 2874493653 3266121699 3664335676 3960160614 2400734916 3175463326 2571257922 390208768 2496478442 2053321955 407347116 1361606202 2266260618 3368394608 422959217 2709778447 1302783662 2419979805 2978386121 3795517005 3281156697 3840203486 474422226 1129654106 3080138816 3613022683 985528477 1090890762 4254973079 1169671820 1361042113 63607268 3162841029 3602575576 3313842994 3761525831 2579182365 2407727284 3341602583 1549067609 3767888868 1756378764 4049216978 936978432 3924409884 1482524583 3340095549 817065343 2240693835 2516764454 3435994448 1945048860 3786939369 1739887022 468933277 3170361628 2378703343 3271694934 2129169081 575305201 2863382816 478137320 474059089 2790702346 2291637745 2815958888 2618928788 4240674859 2418360339 138703508 351798913 1757353744 2006351049 3649664623 2915029995 1422039659 2293576826 3479738614 2976643975 3911632142 4232858810 345521069 1215774395 2451748300 840959171 889565118 434273833 2242691982 3899284903 510779732 1176999117 2585339231 1101869054 1854549641 3151377995 1501154780 3073299630 2204308341 3884869989 519092341 2108430595 1784560695 1131315331 3969881748 3814552456 3118636808 772751356 1636903712 3682784257 2650238311 1959921824 2170917898 2284461166 1650609496 204207627 1811286038 3162867852 250283245 424442653 125612451 33648009 1119832977 1757364859 1341102819 1948976171 1138160359 2128269188 4172583110 1942808755 3801968376 2507985211 518194464 3857909413 1939211375 970752721 3343473080 3989213712 482581358 3289025663 2665758421 2324287289 312209136 487180424 1829876431 3368547136 3192557068 3370415502 579815204 3878152950 3973138558 2342282583 525344005 2350061683 3139800863 583012910 715819678 2710637642 531230085 2278827580 447395167 1484730190 3727935114 2080961905 2451174952 1227685275 2189962718 3847498625 3551461333 672594694 641010000 2587071032 3840748096 77956301 3378330261 2206076607 1516908029 1617381517 2839779054 807959946 4230542327 1743052568 3303255206 2218561598 917305502 2372927590 1215123195 3677898961 4267331098 3794606051 3231479224 3460710593 1994391218 4117441499 2143910270 2391432516 2259521254 3128102426 2560904592 2176392506 3140261494 1271805398 1832485844 3719442334 441200423 2900645712 1210243762 255 362436" option to reproduce the execution
0.00/0.01 c #vars 136
0.00/0.01 c #constraints 338
0.00/0.02 c BCD2: Hardening is enabled.
0.00/0.02 c BCD2: BiasedSearch is enabled.
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 | 158 0 | 0 | 0
0.00/0.02 c 0.0s | 0 | 17 | 13 | 158 0 | 0 | 0
0.00/0.02 c #cpu_time = 0.003s
0.00/0.02 c #wall_clock_time = 0.003s
0.00/0.02 c #decision = 17
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 13
0.00/0.02 c #restart = 0
0.00/0.02 o 68
0.00/0.02 c BCD2: updating upper bound: 136 -> 67
0.00/0.02 c BCD2: 0 <= obj <= 67
0.00/0.02 c BCD2: #cores=0, #unrelaxed=136, #relaxed=0, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=1 bias=1/2
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 | 158 0 | 0 | 0
0.00/0.02 c 0.0s | 0 | 2 | 1 | 158 0 | 0 | 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 = 2
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 1
0.00/0.02 c BCD2: 1 <= obj <= 67
0.00/0.02 c BCD2: #cores=1, #unrelaxed=134, #relaxed=2, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=2 bias=2/3
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 | 158 0 | 0 | 0
0.00/0.02 c 0.0s | 0 | 3 | 1 | 158 0 | 0 | 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: relaxing 2 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.02 c lower bound updated to 2
0.00/0.02 c BCD2: 2 <= obj <= 67
0.00/0.02 c BCD2: #cores=1, #unrelaxed=132, #relaxed=4, #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 | 158 0 | 1 | 0
0.00/0.02 c 0.0s | 0 | 4 | 2 | 158 0 | 1 | 1
0.00/0.02 c #cpu_time = 0.001s
0.00/0.02 c #wall_clock_time = 0.001s
0.00/0.02 c #decision = 4
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: found a new core of size 2: 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 <= 67
0.00/0.02 c BCD2: #cores=2, #unrelaxed=130, #relaxed=6, #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 | 158 0 | 1 | 1
0.00/0.02 c 0.0s | 0 | 7 | 2 | 158 0 | 1 | 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 = 2
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 <= 67
0.00/0.02 c BCD2: #cores=3, #unrelaxed=128, #relaxed=8, #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 | 158 0 | 1 | 1
0.00/0.02 c 0.0s | 0 | 8 | 2 | 158 0 | 1 | 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: found a new core of size 2: 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 <= 67
0.00/0.02 c BCD2: #cores=4, #unrelaxed=126, #relaxed=10, #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 | 158 0 | 1 | 1
0.00/0.03 c 0.0s | 0 | 9 | 2 | 158 0 | 1 | 1
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 = 9
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: found a new core of size 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 6
0.00/0.03 c BCD2: 6 <= obj <= 67
0.00/0.03 c BCD2: #cores=5, #unrelaxed=124, #relaxed=12, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=7 bias=7/8
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 | 158 0 | 1 | 1
0.00/0.03 c 0.0s | 0 | 14 | 2 | 158 0 | 1 | 1
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: found a new core of size 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 7
0.00/0.03 c BCD2: 7 <= obj <= 67
0.00/0.03 c BCD2: #cores=6, #unrelaxed=122, #relaxed=14, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=8 bias=8/9
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 | 158 0 | 1 | 1
0.00/0.03 c 0.0s | 0 | 15 | 2 | 158 0 | 1 | 1
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 = 2
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 8
0.00/0.03 c BCD2: 8 <= obj <= 67
0.00/0.03 c BCD2: #cores=7, #unrelaxed=120, #relaxed=16, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=9 bias=9/10
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 | 158 0 | 1 | 1
0.00/0.03 c 0.0s | 0 | 18 | 2 | 158 0 | 1 | 1
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 = 18
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: found a new core of size 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 9
0.00/0.03 c BCD2: 9 <= obj <= 67
0.00/0.03 c BCD2: #cores=8, #unrelaxed=118, #relaxed=18, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=10 bias=10/11
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 | 158 0 | 1 | 1
0.00/0.03 c 0.0s | 0 | 23 | 2 | 158 0 | 1 | 1
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 = 23
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: found a new core of size 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 10
0.00/0.03 c BCD2: 10 <= obj <= 67
0.00/0.03 c BCD2: #cores=9, #unrelaxed=116, #relaxed=20, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=11 bias=11/12
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 | 158 0 | 1 | 1
0.00/0.03 c 0.0s | 0 | 24 | 4 | 158 0 | 1 | 1
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 = 24
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 4
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 11
0.00/0.03 c BCD2: 11 <= obj <= 67
0.00/0.03 c BCD2: #cores=10, #unrelaxed=114, #relaxed=22, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=12 bias=12/13
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 | 158 0 | 1 | 1
0.00/0.03 c 0.0s | 0 | 18 | 1 | 158 0 | 1 | 1
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 = 18
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: relaxing 2 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.03 c lower bound updated to 12
0.00/0.03 c BCD2: 12 <= obj <= 67
0.00/0.03 c BCD2: #cores=10, #unrelaxed=112, #relaxed=24, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=13 bias=13/14
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 | 158 0 | 2 | 1
0.00/0.03 c 0.0s | 0 | 20 | 1 | 158 0 | 2 | 2
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 = 1
0.00/0.03 c #restart = 0
0.00/0.03 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.03 c lower bound updated to 13
0.00/0.03 c BCD2: 13 <= obj <= 67
0.00/0.03 c BCD2: #cores=10, #unrelaxed=110, #relaxed=26, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=14 bias=14/15
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 | 158 0 | 3 | 2
0.00/0.03 c 0.0s | 0 | 19 | 3 | 158 0 | 3 | 3
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 = 3
0.00/0.03 c #restart = 0
0.00/0.03 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.03 c lower bound updated to 14
0.00/0.03 c BCD2: 14 <= obj <= 67
0.00/0.03 c BCD2: #cores=10, #unrelaxed=108, #relaxed=28, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=15 bias=15/16
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 | 158 0 | 4 | 3
0.00/0.03 c 0.0s | 0 | 16 | 1 | 158 0 | 4 | 4
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 = 16
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 15
0.00/0.03 c BCD2: 15 <= obj <= 67
0.00/0.03 c BCD2: #cores=11, #unrelaxed=106, #relaxed=30, #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 | 158 0 | 4 | 4
0.00/0.03 c 0.0s | 0 | 20 | 2 | 158 0 | 4 | 4
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: found a new core of size 2: 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 <= 67
0.00/0.03 c BCD2: #cores=12, #unrelaxed=104, #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 | 158 0 | 4 | 4
0.00/0.04 c 0.0s | 0 | 23 | 2 | 158 0 | 4 | 4
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 17
0.00/0.04 c BCD2: 17 <= obj <= 67
0.00/0.04 c BCD2: #cores=13, #unrelaxed=102, #relaxed=34, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=18 bias=18/19
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 | 158 0 | 4 | 4
0.00/0.04 c 0.0s | 0 | 24 | 2 | 158 0 | 4 | 4
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 = 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 18
0.00/0.04 c BCD2: 18 <= obj <= 67
0.00/0.04 c BCD2: #cores=14, #unrelaxed=100, #relaxed=36, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=19 bias=19/20
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 | 158 0 | 4 | 4
0.00/0.04 c 0.0s | 0 | 27 | 2 | 158 0 | 4 | 4
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 = 27
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 19
0.00/0.04 c BCD2: 19 <= obj <= 67
0.00/0.04 c BCD2: #cores=15, #unrelaxed=98, #relaxed=38, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=20 bias=20/21
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 | 158 0 | 4 | 4
0.00/0.04 c 0.0s | 0 | 28 | 2 | 158 0 | 4 | 4
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 = 28
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 20
0.00/0.04 c BCD2: 20 <= obj <= 67
0.00/0.04 c BCD2: #cores=16, #unrelaxed=96, #relaxed=40, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=21 bias=21/22
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 | 158 0 | 4 | 4
0.00/0.04 c 0.0s | 0 | 27 | 2 | 158 0 | 4 | 4
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 = 27
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: relaxing 2 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.04 c lower bound updated to 21
0.00/0.04 c BCD2: 21 <= obj <= 67
0.00/0.04 c BCD2: #cores=16, #unrelaxed=94, #relaxed=42, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=22 bias=22/23
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 | 158 0 | 5 | 4
0.00/0.04 c 0.0s | 0 | 25 | 0 | 158 0 | 5 | 5
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 = 25
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 22
0.00/0.04 c BCD2: 22 <= obj <= 67
0.00/0.04 c BCD2: #cores=17, #unrelaxed=92, #relaxed=44, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=23 bias=23/24
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 | 158 0 | 5 | 5
0.00/0.04 c 0.0s | 0 | 28 | 2 | 158 0 | 5 | 5
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 = 28
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 23
0.00/0.04 c BCD2: 23 <= obj <= 67
0.00/0.04 c BCD2: #cores=18, #unrelaxed=90, #relaxed=46, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=24 bias=24/25
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 | 158 0 | 5 | 5
0.00/0.04 c 0.0s | 0 | 29 | 2 | 158 0 | 5 | 5
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 = 29
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 24
0.00/0.04 c BCD2: 24 <= obj <= 67
0.00/0.04 c BCD2: #cores=19, #unrelaxed=88, #relaxed=48, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=25 bias=25/26
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 | 158 0 | 5 | 5
0.00/0.04 c 0.0s | 0 | 30 | 2 | 158 0 | 5 | 5
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 = 30
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: relaxing 2 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.04 c lower bound updated to 25
0.00/0.04 c BCD2: 25 <= obj <= 67
0.00/0.04 c BCD2: #cores=19, #unrelaxed=86, #relaxed=50, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=26 bias=26/27
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 | 158 0 | 6 | 5
0.00/0.04 c 0.0s | 0 | 29 | 2 | 158 0 | 6 | 6
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 = 29
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: relaxing 2 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.04 c lower bound updated to 26
0.00/0.04 c BCD2: 26 <= obj <= 67
0.00/0.04 c BCD2: #cores=19, #unrelaxed=84, #relaxed=52, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=27 bias=27/28
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 | 158 0 | 7 | 6
0.00/0.05 c 0.0s | 0 | 28 | 2 | 158 0 | 7 | 7
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 = 2
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 27
0.00/0.05 c BCD2: 27 <= obj <= 67
0.00/0.05 c BCD2: #cores=20, #unrelaxed=82, #relaxed=54, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=28 bias=28/29
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 | 158 0 | 7 | 7
0.00/0.05 c 0.0s | 0 | 27 | 2 | 158 0 | 7 | 7
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 = 2
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 28
0.00/0.05 c BCD2: 28 <= obj <= 67
0.00/0.05 c BCD2: #cores=20, #unrelaxed=80, #relaxed=56, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=29 bias=29/30
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 | 158 0 | 8 | 7
0.00/0.05 c 0.0s | 0 | 29 | 2 | 158 0 | 8 | 8
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 = 29
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 2
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 29
0.00/0.05 c BCD2: 29 <= obj <= 67
0.00/0.05 c BCD2: #cores=21, #unrelaxed=78, #relaxed=58, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=30 bias=30/31
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 | 158 0 | 8 | 8
0.00/0.05 c 0.0s | 0 | 28 | 2 | 158 0 | 8 | 8
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 = 2
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 30
0.00/0.05 c BCD2: 30 <= obj <= 67
0.00/0.05 c BCD2: #cores=21, #unrelaxed=76, #relaxed=60, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=31 bias=31/32
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 | 158 0 | 9 | 8
0.00/0.05 c 0.0s | 0 | 28 | 2 | 158 0 | 9 | 9
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 = 2
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 31
0.00/0.05 c BCD2: 31 <= obj <= 67
0.00/0.05 c BCD2: #cores=21, #unrelaxed=74, #relaxed=62, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=32 bias=32/33
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 | 158 0 | 10 | 9
0.00/0.05 c 0.0s | 0 | 26 | 2 | 158 0 | 10 | 10
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 = 2
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 32
0.00/0.05 c BCD2: 32 <= obj <= 67
0.00/0.05 c BCD2: #cores=21, #unrelaxed=72, #relaxed=64, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=33 bias=33/34
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 | 158 0 | 11 | 10
0.00/0.05 c 0.0s | 0 | 26 | 2 | 158 0 | 11 | 11
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 = 2
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 33
0.00/0.05 c BCD2: 33 <= obj <= 67
0.00/0.05 c BCD2: #cores=21, #unrelaxed=70, #relaxed=66, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=34 bias=34/35
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 | 158 0 | 12 | 11
0.00/0.05 c 0.0s | 0 | 24 | 2 | 158 0 | 12 | 12
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 = 24
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 2
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 34
0.00/0.05 c BCD2: 34 <= obj <= 67
0.00/0.05 c BCD2: #cores=22, #unrelaxed=68, #relaxed=68, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=35 bias=35/36
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 | 158 0 | 12 | 12
0.00/0.05 c 0.0s | 0 | 27 | 3 | 158 0 | 12 | 12
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 = 27
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 3
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 35
0.00/0.05 c BCD2: 35 <= obj <= 67
0.00/0.05 c BCD2: #cores=22, #unrelaxed=66, #relaxed=70, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=36 bias=36/37
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 | 158 0 | 13 | 12
0.00/0.05 c 0.0s | 0 | 24 | 1 | 158 0 | 13 | 13
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 = 24
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 36
0.00/0.05 c BCD2: 36 <= obj <= 67
0.00/0.05 c BCD2: #cores=23, #unrelaxed=64, #relaxed=72, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=37 bias=37/38
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 | 158 0 | 13 | 13
0.00/0.06 c 0.0s | 0 | 26 | 2 | 158 0 | 13 | 13
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 = 26
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 2
0.00/0.06 c #restart = 0
0.00/0.06 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.06 c lower bound updated to 37
0.00/0.06 c BCD2: 37 <= obj <= 67
0.00/0.06 c BCD2: #cores=23, #unrelaxed=62, #relaxed=74, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=38 bias=38/39
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 158 0 | 14 | 13
0.00/0.06 c 0.0s | 0 | 24 | 0 | 158 0 | 14 | 14
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 = 24
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 0
0.00/0.06 c #restart = 0
0.00/0.06 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06 c lower bound updated to 38
0.00/0.06 c BCD2: 38 <= obj <= 67
0.00/0.06 c BCD2: #cores=24, #unrelaxed=60, #relaxed=76, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=39 bias=39/40
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 158 0 | 14 | 14
0.00/0.06 c 0.0s | 0 | 25 | 0 | 158 0 | 14 | 14
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 = 25
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 0
0.00/0.06 c #restart = 0
0.00/0.06 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.06 c lower bound updated to 39
0.00/0.06 c BCD2: 39 <= obj <= 67
0.00/0.06 c BCD2: #cores=24, #unrelaxed=58, #relaxed=78, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=40 bias=40/41
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 158 0 | 15 | 14
0.00/0.06 c 0.0s | 0 | 25 | 0 | 158 0 | 15 | 15
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 = 25
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 0
0.00/0.06 c #restart = 0
0.00/0.06 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06 c lower bound updated to 40
0.00/0.06 c BCD2: 40 <= obj <= 67
0.00/0.06 c BCD2: #cores=25, #unrelaxed=56, #relaxed=80, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=41 bias=41/42
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 158 0 | 15 | 15
0.00/0.06 c 0.0s | 0 | 26 | 0 | 158 0 | 15 | 15
0.00/0.06 c #cpu_time = 0.000s
0.00/0.06 c #wall_clock_time = 0.001s
0.00/0.06 c #decision = 26
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 0
0.00/0.06 c #restart = 0
0.00/0.06 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.06 c lower bound updated to 41
0.00/0.06 c BCD2: 41 <= obj <= 67
0.00/0.06 c BCD2: #cores=25, #unrelaxed=54, #relaxed=82, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=42 bias=42/43
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 158 0 | 16 | 15
0.00/0.06 c 0.0s | 0 | 26 | 0 | 158 0 | 16 | 16
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 = 26
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 0
0.00/0.06 c #restart = 0
0.00/0.06 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06 c lower bound updated to 42
0.00/0.06 c BCD2: 42 <= obj <= 67
0.00/0.06 c BCD2: #cores=26, #unrelaxed=52, #relaxed=84, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=43 bias=43/44
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 158 0 | 16 | 16
0.00/0.06 c 0.0s | 0 | 27 | 0 | 158 0 | 16 | 16
0.00/0.06 c #cpu_time = 0.000s
0.00/0.06 c #wall_clock_time = 0.000s
0.00/0.06 c #decision = 27
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 0
0.00/0.06 c #restart = 0
0.00/0.06 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.06 c lower bound updated to 43
0.00/0.06 c BCD2: 43 <= obj <= 67
0.00/0.06 c BCD2: #cores=26, #unrelaxed=50, #relaxed=86, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=44 bias=44/45
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 158 0 | 17 | 16
0.00/0.06 c 0.0s | 0 | 27 | 0 | 158 0 | 17 | 17
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 = 27
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 0
0.00/0.06 c #restart = 0
0.00/0.06 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06 c lower bound updated to 44
0.00/0.06 c BCD2: 44 <= obj <= 67
0.00/0.06 c BCD2: #cores=27, #unrelaxed=48, #relaxed=88, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=45 bias=45/46
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 158 0 | 17 | 17
0.00/0.06 c 0.0s | 0 | 28 | 0 | 158 0 | 17 | 17
0.00/0.06 c #cpu_time = 0.000s
0.00/0.06 c #wall_clock_time = 0.000s
0.00/0.06 c #decision = 28
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 0
0.00/0.06 c #restart = 0
0.00/0.06 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.06 c lower bound updated to 45
0.00/0.06 c BCD2: 45 <= obj <= 67
0.00/0.06 c BCD2: #cores=27, #unrelaxed=46, #relaxed=90, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=46 bias=46/47
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 158 0 | 18 | 17
0.00/0.06 c 0.0s | 0 | 28 | 0 | 158 0 | 18 | 18
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 = 28
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07 c lower bound updated to 46
0.00/0.07 c BCD2: 46 <= obj <= 67
0.00/0.07 c BCD2: #cores=28, #unrelaxed=44, #relaxed=92, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=47 bias=47/48
0.00/0.07 c Solving starts ...
0.00/0.07 c ============================[ Search Statistics ]============================
0.00/0.07 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.07 c | | | | Limit GC | Var | Constra
0.00/0.07 c =============================================================================
0.00/0.07 c 0.0s | 0 | 0 | 0 | 158 0 | 18 | 18
0.00/0.07 c 0.0s | 0 | 29 | 0 | 158 0 | 18 | 18
0.00/0.07 c #cpu_time = 0.000s
0.00/0.07 c #wall_clock_time = 0.000s
0.00/0.07 c #decision = 29
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 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.07 c lower bound updated to 47
0.00/0.07 c BCD2: 47 <= obj <= 67
0.00/0.07 c BCD2: #cores=28, #unrelaxed=42, #relaxed=94, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=48 bias=48/49
0.00/0.07 c Solving starts ...
0.00/0.07 c ============================[ Search Statistics ]============================
0.00/0.07 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.07 c | | | | Limit GC | Var | Constra
0.00/0.07 c =============================================================================
0.00/0.07 c 0.0s | 0 | 0 | 0 | 158 0 | 19 | 18
0.00/0.07 c 0.0s | 0 | 29 | 0 | 158 0 | 19 | 19
0.00/0.07 c #cpu_time = 0.001s
0.00/0.07 c #wall_clock_time = 0.001s
0.00/0.07 c #decision = 29
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07 c lower bound updated to 48
0.00/0.07 c BCD2: 48 <= obj <= 67
0.00/0.07 c BCD2: #cores=29, #unrelaxed=40, #relaxed=96, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=49 bias=49/50
0.00/0.07 c Solving starts ...
0.00/0.07 c ============================[ Search Statistics ]============================
0.00/0.07 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.07 c | | | | Limit GC | Var | Constra
0.00/0.07 c =============================================================================
0.00/0.07 c 0.0s | 0 | 0 | 0 | 158 0 | 19 | 19
0.00/0.07 c 0.0s | 0 | 30 | 0 | 158 0 | 19 | 19
0.00/0.07 c #cpu_time = 0.000s
0.00/0.07 c #wall_clock_time = 0.000s
0.00/0.07 c #decision = 30
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 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.07 c lower bound updated to 49
0.00/0.07 c BCD2: 49 <= obj <= 67
0.00/0.07 c BCD2: #cores=29, #unrelaxed=38, #relaxed=98, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=50 bias=50/51
0.00/0.07 c Solving starts ...
0.00/0.07 c ============================[ Search Statistics ]============================
0.00/0.07 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.07 c | | | | Limit GC | Var | Constra
0.00/0.07 c =============================================================================
0.00/0.07 c 0.0s | 0 | 0 | 0 | 158 0 | 20 | 19
0.00/0.07 c 0.0s | 0 | 30 | 0 | 158 0 | 20 | 20
0.00/0.07 c #cpu_time = 0.001s
0.00/0.07 c #wall_clock_time = 0.001s
0.00/0.07 c #decision = 30
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07 c lower bound updated to 50
0.00/0.07 c BCD2: 50 <= obj <= 67
0.00/0.07 c BCD2: #cores=30, #unrelaxed=36, #relaxed=100, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=51 bias=51/52
0.00/0.07 c Solving starts ...
0.00/0.07 c ============================[ Search Statistics ]============================
0.00/0.07 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.07 c | | | | Limit GC | Var | Constra
0.00/0.07 c =============================================================================
0.00/0.07 c 0.0s | 0 | 0 | 0 | 158 0 | 20 | 20
0.00/0.07 c 0.0s | 0 | 31 | 0 | 158 0 | 20 | 20
0.00/0.07 c #cpu_time = 0.000s
0.00/0.07 c #wall_clock_time = 0.000s
0.00/0.07 c #decision = 31
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 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.07 c lower bound updated to 51
0.00/0.07 c BCD2: 51 <= obj <= 67
0.00/0.07 c BCD2: #cores=30, #unrelaxed=34, #relaxed=102, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=52 bias=52/53
0.00/0.07 c Solving starts ...
0.00/0.07 c ============================[ Search Statistics ]============================
0.00/0.07 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.07 c | | | | Limit GC | Var | Constra
0.00/0.07 c =============================================================================
0.00/0.07 c 0.0s | 0 | 0 | 0 | 158 0 | 21 | 20
0.00/0.07 c 0.0s | 0 | 31 | 0 | 158 0 | 21 | 21
0.00/0.07 c #cpu_time = 0.001s
0.00/0.07 c #wall_clock_time = 0.001s
0.00/0.07 c #decision = 31
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07 c lower bound updated to 52
0.00/0.07 c BCD2: 52 <= obj <= 67
0.00/0.07 c BCD2: #cores=31, #unrelaxed=32, #relaxed=104, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=53 bias=53/54
0.00/0.07 c Solving starts ...
0.00/0.07 c ============================[ Search Statistics ]============================
0.00/0.07 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.07 c | | | | Limit GC | Var | Constra
0.00/0.07 c =============================================================================
0.00/0.07 c 0.0s | 0 | 0 | 0 | 158 0 | 21 | 21
0.00/0.07 c 0.0s | 0 | 32 | 0 | 158 0 | 21 | 21
0.00/0.07 c #cpu_time = 0.000s
0.00/0.07 c #wall_clock_time = 0.001s
0.00/0.07 c #decision = 32
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 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.07 c lower bound updated to 53
0.00/0.07 c BCD2: 53 <= obj <= 67
0.00/0.07 c BCD2: #cores=31, #unrelaxed=30, #relaxed=106, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=54 bias=54/55
0.00/0.07 c Solving starts ...
0.00/0.07 c ============================[ Search Statistics ]============================
0.00/0.07 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.07 c | | | | Limit GC | Var | Constra
0.00/0.07 c =============================================================================
0.00/0.07 c 0.0s | 0 | 0 | 0 | 158 0 | 22 | 21
0.00/0.07 c 0.0s | 0 | 32 | 0 | 158 0 | 22 | 22
0.00/0.07 c #cpu_time = 0.001s
0.00/0.07 c #wall_clock_time = 0.001s
0.00/0.07 c #decision = 32
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07 c lower bound updated to 54
0.00/0.07 c BCD2: 54 <= obj <= 67
0.00/0.07 c BCD2: #cores=32, #unrelaxed=28, #relaxed=108, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=55 bias=55/56
0.00/0.07 c Solving starts ...
0.00/0.07 c ============================[ Search Statistics ]============================
0.00/0.07 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.07 c | | | | Limit GC | Var | Constra
0.00/0.07 c =============================================================================
0.00/0.07 c 0.0s | 0 | 0 | 0 | 158 0 | 22 | 22
0.00/0.07 c 0.0s | 0 | 33 | 0 | 158 0 | 22 | 22
0.00/0.07 c #cpu_time = 0.000s
0.00/0.07 c #wall_clock_time = 0.001s
0.00/0.07 c #decision = 33
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 0
0.00/0.07 c #restart = 0
0.00/0.07 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.07 c lower bound updated to 55
0.00/0.07 c BCD2: 55 <= obj <= 67
0.00/0.07 c BCD2: #cores=32, #unrelaxed=26, #relaxed=110, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=56 bias=56/57
0.00/0.08 c Solving starts ...
0.00/0.08 c ============================[ Search Statistics ]============================
0.00/0.08 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.08 c | | | | Limit GC | Var | Constra
0.00/0.08 c =============================================================================
0.00/0.08 c 0.0s | 0 | 0 | 0 | 158 0 | 23 | 22
0.00/0.08 c 0.0s | 0 | 33 | 0 | 158 0 | 23 | 23
0.00/0.08 c #cpu_time = 0.001s
0.00/0.08 c #wall_clock_time = 0.001s
0.00/0.08 c #decision = 33
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 0
0.00/0.08 c #restart = 0
0.00/0.08 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.08 c lower bound updated to 56
0.00/0.08 c BCD2: 56 <= obj <= 67
0.00/0.08 c BCD2: #cores=33, #unrelaxed=24, #relaxed=112, #hardened=0
0.00/0.08 c BCD2: #sat=1 #unsat=57 bias=57/58
0.00/0.08 c Solving starts ...
0.00/0.08 c ============================[ Search Statistics ]============================
0.00/0.08 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.08 c | | | | Limit GC | Var | Constra
0.00/0.08 c =============================================================================
0.00/0.08 c 0.0s | 0 | 0 | 0 | 158 0 | 23 | 23
0.00/0.08 c 0.0s | 0 | 34 | 0 | 158 0 | 23 | 23
0.00/0.08 c #cpu_time = 0.001s
0.00/0.08 c #wall_clock_time = 0.001s
0.00/0.08 c #decision = 34
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 0
0.00/0.08 c #restart = 0
0.00/0.08 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.08 c lower bound updated to 57
0.00/0.08 c BCD2: 57 <= obj <= 67
0.00/0.08 c BCD2: #cores=33, #unrelaxed=22, #relaxed=114, #hardened=0
0.00/0.08 c BCD2: #sat=1 #unsat=58 bias=58/59
0.00/0.08 c Solving starts ...
0.00/0.08 c ============================[ Search Statistics ]============================
0.00/0.08 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.08 c | | | | Limit GC | Var | Constra
0.00/0.08 c =============================================================================
0.00/0.08 c 0.0s | 0 | 0 | 0 | 158 0 | 24 | 23
0.00/0.08 c 0.0s | 0 | 34 | 0 | 158 0 | 24 | 24
0.00/0.08 c #cpu_time = 0.001s
0.00/0.08 c #wall_clock_time = 0.001s
0.00/0.08 c #decision = 34
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 0
0.00/0.08 c #restart = 0
0.00/0.08 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.08 c lower bound updated to 58
0.00/0.08 c BCD2: 58 <= obj <= 67
0.00/0.08 c BCD2: #cores=34, #unrelaxed=20, #relaxed=116, #hardened=0
0.00/0.08 c BCD2: #sat=1 #unsat=59 bias=59/60
0.00/0.08 c Solving starts ...
0.00/0.08 c ============================[ Search Statistics ]============================
0.00/0.08 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.08 c | | | | Limit GC | Var | Constra
0.00/0.08 c =============================================================================
0.00/0.08 c 0.0s | 0 | 0 | 0 | 158 0 | 24 | 24
0.00/0.08 c 0.0s | 0 | 35 | 0 | 158 0 | 24 | 24
0.00/0.08 c #cpu_time = 0.000s
0.00/0.08 c #wall_clock_time = 0.000s
0.00/0.08 c #decision = 35
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 0
0.00/0.08 c #restart = 0
0.00/0.08 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.08 c lower bound updated to 59
0.00/0.08 c BCD2: 59 <= obj <= 67
0.00/0.08 c BCD2: #cores=34, #unrelaxed=18, #relaxed=118, #hardened=0
0.00/0.08 c BCD2: #sat=1 #unsat=60 bias=60/61
0.00/0.08 c Solving starts ...
0.00/0.08 c ============================[ Search Statistics ]============================
0.00/0.08 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.08 c | | | | Limit GC | Var | Constra
0.00/0.08 c =============================================================================
0.00/0.08 c 0.0s | 0 | 0 | 0 | 158 0 | 25 | 24
0.00/0.08 c 0.0s | 0 | 35 | 0 | 158 0 | 25 | 25
0.00/0.08 c #cpu_time = 0.001s
0.00/0.08 c #wall_clock_time = 0.001s
0.00/0.08 c #decision = 35
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 0
0.00/0.08 c #restart = 0
0.00/0.08 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.08 c lower bound updated to 60
0.00/0.08 c BCD2: 60 <= obj <= 67
0.00/0.08 c BCD2: #cores=35, #unrelaxed=16, #relaxed=120, #hardened=0
0.00/0.08 c BCD2: #sat=1 #unsat=61 bias=61/62
0.00/0.08 c Solving starts ...
0.00/0.08 c ============================[ Search Statistics ]============================
0.00/0.08 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.08 c | | | | Limit GC | Var | Constra
0.00/0.08 c =============================================================================
0.00/0.08 c 0.0s | 0 | 0 | 0 | 158 0 | 25 | 25
0.00/0.08 c 0.0s | 0 | 36 | 0 | 158 0 | 25 | 25
0.00/0.08 c #cpu_time = 0.000s
0.00/0.08 c #wall_clock_time = 0.000s
0.00/0.08 c #decision = 36
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 0
0.00/0.08 c #restart = 0
0.00/0.08 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.08 c lower bound updated to 61
0.00/0.08 c BCD2: 61 <= obj <= 67
0.00/0.08 c BCD2: #cores=35, #unrelaxed=14, #relaxed=122, #hardened=0
0.00/0.08 c BCD2: #sat=1 #unsat=62 bias=62/63
0.00/0.08 c Solving starts ...
0.00/0.08 c ============================[ Search Statistics ]============================
0.00/0.08 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.08 c | | | | Limit GC | Var | Constra
0.00/0.08 c =============================================================================
0.00/0.08 c 0.0s | 0 | 0 | 0 | 158 0 | 26 | 25
0.00/0.08 c 0.0s | 0 | 36 | 0 | 158 0 | 26 | 26
0.00/0.08 c #cpu_time = 0.001s
0.00/0.08 c #wall_clock_time = 0.001s
0.00/0.08 c #decision = 36
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 0
0.00/0.08 c #restart = 0
0.00/0.08 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.08 c lower bound updated to 62
0.00/0.08 c BCD2: 62 <= obj <= 67
0.00/0.08 c BCD2: #cores=36, #unrelaxed=12, #relaxed=124, #hardened=0
0.00/0.08 c BCD2: #sat=1 #unsat=63 bias=63/64
0.00/0.08 c Solving starts ...
0.00/0.08 c ============================[ Search Statistics ]============================
0.00/0.08 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.08 c | | | | Limit GC | Var | Constra
0.00/0.08 c =============================================================================
0.00/0.08 c 0.0s | 0 | 0 | 0 | 158 0 | 26 | 26
0.00/0.08 c 0.0s | 0 | 37 | 0 | 158 0 | 26 | 26
0.00/0.08 c #cpu_time = 0.001s
0.00/0.08 c #wall_clock_time = 0.001s
0.00/0.08 c #decision = 37
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 0
0.00/0.08 c #restart = 0
0.00/0.08 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.08 c lower bound updated to 63
0.00/0.08 c BCD2: 63 <= obj <= 67
0.00/0.08 c BCD2: #cores=36, #unrelaxed=10, #relaxed=126, #hardened=0
0.00/0.08 c BCD2: #sat=1 #unsat=64 bias=64/65
0.00/0.08 c Solving starts ...
0.00/0.08 c ============================[ Search Statistics ]============================
0.00/0.08 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.08 c | | | | Limit GC | Var | Constra
0.00/0.08 c =============================================================================
0.00/0.08 c 0.0s | 0 | 0 | 0 | 158 0 | 27 | 26
0.00/0.08 c 0.0s | 0 | 37 | 0 | 158 0 | 27 | 27
0.00/0.08 c #cpu_time = 0.001s
0.00/0.08 c #wall_clock_time = 0.001s
0.00/0.08 c #decision = 37
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 0
0.00/0.08 c #restart = 0
0.00/0.08 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.08 c lower bound updated to 64
0.00/0.09 c BCD2: 64 <= obj <= 67
0.00/0.09 c BCD2: #cores=37, #unrelaxed=8, #relaxed=128, #hardened=0
0.00/0.09 c BCD2: #sat=1 #unsat=65 bias=65/66
0.00/0.09 c Solving starts ...
0.00/0.09 c ============================[ Search Statistics ]============================
0.00/0.09 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.09 c | | | | Limit GC | Var | Constra
0.00/0.09 c =============================================================================
0.00/0.09 c 0.0s | 0 | 0 | 0 | 158 0 | 27 | 27
0.00/0.09 c 0.0s | 0 | 38 | 0 | 158 0 | 27 | 27
0.00/0.09 c #cpu_time = 0.000s
0.00/0.09 c #wall_clock_time = 0.001s
0.00/0.09 c #decision = 38
0.00/0.09 c #random_decision = 0
0.00/0.09 c #conflict = 0
0.00/0.09 c #restart = 0
0.00/0.09 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.09 c lower bound updated to 65
0.00/0.09 c BCD2: 65 <= obj <= 67
0.00/0.09 c BCD2: #cores=37, #unrelaxed=6, #relaxed=130, #hardened=0
0.00/0.09 c BCD2: #sat=1 #unsat=66 bias=66/67
0.00/0.09 c Solving starts ...
0.00/0.09 c ============================[ Search Statistics ]============================
0.00/0.09 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.09 c | | | | Limit GC | Var | Constra
0.00/0.09 c =============================================================================
0.00/0.09 c 0.0s | 0 | 0 | 0 | 158 0 | 28 | 27
0.00/0.09 c 0.0s | 0 | 38 | 0 | 158 0 | 28 | 28
0.00/0.09 c #cpu_time = 0.001s
0.00/0.09 c #wall_clock_time = 0.001s
0.00/0.09 c #decision = 38
0.00/0.09 c #random_decision = 0
0.00/0.09 c #conflict = 0
0.00/0.09 c #restart = 0
0.00/0.09 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.09 c lower bound updated to 66
0.00/0.09 c BCD2: 66 <= obj <= 67
0.00/0.09 c BCD2: #cores=38, #unrelaxed=4, #relaxed=132, #hardened=0
0.00/0.09 c BCD2: #sat=1 #unsat=67 bias=67/68
0.00/0.09 c Solving starts ...
0.00/0.09 c ============================[ Search Statistics ]============================
0.00/0.09 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.09 c | | | | Limit GC | Var | Constra
0.00/0.09 c =============================================================================
0.00/0.09 c 0.0s | 0 | 0 | 0 | 158 0 | 28 | 28
0.00/0.09 c 0.0s | 0 | 39 | 0 | 158 0 | 28 | 28
0.00/0.09 c #cpu_time = 0.000s
0.00/0.09 c #wall_clock_time = 0.000s
0.00/0.09 c #decision = 39
0.00/0.09 c #random_decision = 0
0.00/0.09 c #conflict = 0
0.00/0.09 c #restart = 0
0.00/0.09 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.09 c lower bound updated to 67
0.00/0.09 c BCD2: hardening fixes 2 literals
0.00/0.09 c BCD2: 67 <= obj <= 67
0.00/0.09 c BCD2: #cores=38, #unrelaxed=0, #relaxed=134, #hardened=2
0.00/0.09 c BCD2: #sat=1 #unsat=68 bias=68/69
0.00/0.09 c Solving starts ...
0.00/0.09 c lower bound updated to 68
0.00/0.09 s OPTIMUM FOUND
0.00/0.09 v x1 -x2 -x3 x4 x5 -x6 -x7 x8 -x9 x10
0.00/0.09 v -x11 x12 -x13 x14 -x15 x16 -x17 x18 -x19 x20
0.00/0.09 v -x21 x22 -x23 x24 -x25 x26 -x27 x28 -x29 x30
0.00/0.09 v -x31 x32 -x33 x34 -x35 x36 -x37 x38 -x39 x40
0.00/0.09 v -x41 x42 -x43 x44 -x45 x46 -x47 x48 -x49 x50
0.00/0.09 v -x51 x52 -x53 x54 -x55 x56 -x57 x58 -x59 x60
0.00/0.09 v -x61 x62 x63 -x64 -x65 x66 -x67 x68 x69 -x70
0.00/0.09 v x71 -x72 x73 -x74 -x75 x76 x77 -x78 -x79 x80
0.00/0.09 v -x81 x82 x83 -x84 -x85 x86 -x87 x88 x89 -x90
0.00/0.09 v -x91 x92 x93 -x94 -x95 x96 x97 -x98 -x99 x100
0.00/0.09 v x101 -x102 x103 -x104 -x105 x106 x107 -x108 -x109 x110
0.00/0.09 v x111 -x112 x113 -x114 -x115 x116 -x117 x118 x119 -x120
0.00/0.09 v -x121 x122 x123 -x124 -x125 x126 -x127 x128 -x129 x130
0.00/0.09 v x131 -x132 x133 -x134 -x135 x136
0.00/0.09 c total CPU time = 0.091s
0.00/0.09 c total wall clock time = 0.091s