0.00/0.00 c 2016-06-18T08:06:28+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-4102433-1466229988.opb"]
0.00/0.01 c use --random-gen="2907772815 619064575 657248191 1036496517 1312221440 3103905629 1056456470 917482095 3988439721 3511099047 496786278 265674188 2862172186 1931086361 1336955707 1740535328 2493387863 2257681115 603554696 1080904480 4134297365 1584688268 1436517906 111196762 2337897808 4149086088 1095209388 3688767950 2070732212 3058283841 1673285399 2556524066 1550766478 1093640394 2697892585 2752703790 4204895884 2765216054 1193919859 2583948064 2122008056 2422735336 2758156933 2951938949 2865563818 1150339587 4002770570 3995345380 1931852443 4111594746 4003345080 542537043 49339973 382472751 4197821183 2847213764 4177204967 1786009602 4086862564 3875799910 3738121397 690461113 363876004 1301381984 936196037 3123613476 1253265343 492627506 1881854027 3946417865 3484791342 1261853200 4012868232 1449298849 3409897635 3042784326 1464596087 1288704759 1571064493 457632314 3091129828 2233992229 16330816 2502261466 4103741395 1938191751 9261941 2889642320 2032235820 58650205 483862325 1437646709 869530411 727231260 1075818753 631412141 3112043657 30685917 1041746671 1582138240 3236893055 3652205225 76019317 498104459 1727365764 3035824616 1421496302 162723844 2918406673 2715140105 125878587 1006910405 843943543 3779670038 714711311 2787044645 3719396887 1860241073 479822893 3768073415 4056531557 3067283709 2390254482 3030607866 2528673493 378258315 3474415505 2836976755 3596037426 3874293279 1889289468 2076793389 772592650 4107758870 2505758390 453535599 336794938 3566499768 1167691983 2223891693 2082849996 1807406970 1388843264 2194400394 3676356976 813151870 3038432254 332862584 2646762961 2991620732 24392836 1998969577 4132642797 4222451479 3197040729 396262545 973108688 1176149942 423096766 3764058148 3722061724 1694330236 3820959889 2074702229 2590654570 1397259047 1093866726 61512751 1309496612 1851234371 102860482 3407233321 4202956712 1550487673 4037425403 3677129156 3132601467 1102464074 3735218890 4183181012 3679580323 855776086 3415123118 2965897824 296623417 1647454140 4135506001 1638173488 2709422888 2765025547 869340689 1567786049 2053807148 2217205718 2590684909 3497901010 2033476339 4245725709 3333752075 2260030747 850764184 1611976061 1145894441 3364275047 4065659319 447469881 2224423077 2749889207 1229770858 3693172160 1264199491 2694984171 1042839893 4224553745 2995662363 1223400868 44189080 153246555 1701916262 2037354319 2888387533 791760090 658034889 1506403507 3411102503 1700489725 1323371022 434011957 1552835685 1022797194 4128272196 1331629640 1670443613 3741027775 2694958461 2430390798 3917574004 3360389897 3887346029 1270436688 1711997788 883179367 73561235 1618837047 3283227134 2527762783 1295488740 3791954074 1323508770 709706328 4172951344 1918216210 4272118605 1121380589 3766606638 1038904793 255 362436" option to reproduce the execution
0.00/0.01 c #vars 200
0.00/0.01 c #constraints 440
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 | 213 0 | 0 | 0
0.00/0.03 c 0.0s | 0 | 124 | 72 | 213 0 | 2 | 6
0.00/0.03 c #cpu_time = 0.008s
0.00/0.03 c #wall_clock_time = 0.008s
0.00/0.03 c #decision = 124
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 72
0.00/0.03 c #restart = 0
0.00/0.03 o 100
0.00/0.03 c BCD2: updating upper bound: 200 -> 99
0.00/0.03 c BCD2: 0 <= obj <= 99
0.00/0.03 c BCD2: #cores=0, #unrelaxed=200, #relaxed=0, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=1 bias=1/2
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 | 213 0 | 2 | 6
0.00/0.03 c 0.0s | 0 | 12 | 0 | 213 0 | 2 | 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 = 12
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 3: cost of the new core is >=1
0.00/0.03 c lower bound updated to 1
0.00/0.03 c BCD2: 1 <= obj <= 99
0.00/0.03 c BCD2: #cores=1, #unrelaxed=197, #relaxed=3, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=2 bias=2/3
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 | 213 0 | 2 | 7
0.00/0.03 c 0.0s | 0 | 16 | 0 | 213 0 | 2 | 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 = 16
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 3: cost of the new core is >=1
0.00/0.03 c lower bound updated to 2
0.00/0.03 c BCD2: 2 <= obj <= 99
0.00/0.03 c BCD2: #cores=2, #unrelaxed=194, #relaxed=6, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=3 bias=3/4
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 | 213 0 | 2 | 7
0.00/0.03 c 0.0s | 0 | 17 | 1 | 213 0 | 2 | 7
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 = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 6: cost of the new core is >=1
0.00/0.03 c lower bound updated to 3
0.00/0.03 c BCD2: 3 <= obj <= 99
0.00/0.03 c BCD2: #cores=3, #unrelaxed=188, #relaxed=12, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=4 bias=4/5
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 | 213 0 | 2 | 7
0.00/0.03 c 0.0s | 0 | 17 | 1 | 213 0 | 2 | 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 = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 5: cost of the new core is >=1
0.00/0.03 c lower bound updated to 4
0.00/0.03 c BCD2: 4 <= obj <= 99
0.00/0.03 c BCD2: #cores=4, #unrelaxed=183, #relaxed=17, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=5 bias=5/6
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 | 213 0 | 2 | 7
0.00/0.03 c 0.0s | 0 | 17 | 2 | 213 0 | 2 | 7
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 = 2
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 11: cost of the new core is >=2
0.00/0.03 c lower bound updated to 5
0.00/0.03 c BCD2: 5 <= obj <= 99
0.00/0.03 c BCD2: #cores=4, #unrelaxed=178, #relaxed=22, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=6 bias=6/7
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 | 213 0 | 3 | 7
0.00/0.03 c 0.0s | 0 | 14 | 3 | 213 0 | 3 | 8
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 = 14
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: found a new core of size 3: 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 <= 99
0.00/0.03 c BCD2: #cores=5, #unrelaxed=175, #relaxed=25, #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 | 213 0 | 3 | 8
0.00/0.03 c 0.0s | 0 | 14 | 0 | 213 0 | 3 | 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 = 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 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 <= 99
0.00/0.03 c BCD2: #cores=6, #unrelaxed=173, #relaxed=27, #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 | 213 0 | 3 | 11
0.00/0.04 c 0.0s | 0 | 19 | 1 | 213 0 | 3 | 11
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 = 19
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 6: cost of the new core is >=1
0.00/0.04 c lower bound updated to 8
0.00/0.04 c BCD2: 8 <= obj <= 99
0.00/0.04 c BCD2: #cores=7, #unrelaxed=167, #relaxed=33, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=9 bias=9/10
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 | 213 0 | 3 | 11
0.00/0.04 c 0.0s | 0 | 18 | 3 | 213 0 | 3 | 11
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 = 18
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 3
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 4 and merging with 2 cores into a new core of size 13: cost of the new core is >=3
0.00/0.04 c lower bound updated to 9
0.00/0.04 c BCD2: 9 <= obj <= 99
0.00/0.04 c BCD2: #cores=6, #unrelaxed=163, #relaxed=37, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=10 bias=10/11
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 | 213 0 | 5 | 11
0.00/0.04 c 0.0s | 0 | 13 | 2 | 213 0 | 5 | 13
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 = 13
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 3 and merging with 2 cores into a new core of size 9: cost of the new core is >=3
0.00/0.04 c lower bound updated to 10
0.00/0.04 c BCD2: 10 <= obj <= 99
0.00/0.04 c BCD2: #cores=5, #unrelaxed=160, #relaxed=40, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=11 bias=11/12
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 | 213 0 | 7 | 13
0.00/0.04 c 0.0s | 0 | 23 | 1 | 213 0 | 19 | 52
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 = 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: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 11
0.00/0.04 c BCD2: 11 <= obj <= 99
0.00/0.04 c BCD2: #cores=6, #unrelaxed=159, #relaxed=41, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=12 bias=12/13
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 | 213 0 | 19 | 52
0.00/0.04 c 0.0s | 0 | 13 | 1 | 213 0 | 19 | 52
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 = 13
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 4: cost of the new core is >=1
0.00/0.04 c lower bound updated to 12
0.00/0.04 c BCD2: 12 <= obj <= 99
0.00/0.04 c BCD2: #cores=7, #unrelaxed=155, #relaxed=45, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=13 bias=13/14
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 | 213 0 | 19 | 52
0.00/0.04 c 0.0s | 0 | 15 | 2 | 213 0 | 19 | 52
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 = 15
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 13
0.00/0.04 c BCD2: 13 <= obj <= 99
0.00/0.04 c BCD2: #cores=8, #unrelaxed=153, #relaxed=47, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=14 bias=14/15
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 | 213 0 | 19 | 52
0.00/0.04 c 0.0s | 0 | 20 | 2 | 213 0 | 19 | 52
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 = 20
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 14
0.00/0.04 c BCD2: 14 <= obj <= 99
0.00/0.04 c BCD2: #cores=9, #unrelaxed=151, #relaxed=49, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=15 bias=15/16
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 | 213 0 | 19 | 52
0.00/0.04 c 0.0s | 0 | 40 | 5 | 213 0 | 21 | 58
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 = 40
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 5
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.04 c lower bound updated to 15
0.00/0.04 c BCD2: 15 <= obj <= 99
0.00/0.04 c BCD2: #cores=10, #unrelaxed=147, #relaxed=53, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=16 bias=16/17
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 | 213 0 | 21 | 58
0.00/0.04 c 0.0s | 0 | 16 | 0 | 213 0 | 21 | 58
0.00/0.04 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 16
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 2: cost of the new core is >=1
0.00/0.05 c lower bound updated to 16
0.00/0.05 c BCD2: 16 <= obj <= 99
0.00/0.05 c BCD2: #cores=11, #unrelaxed=145, #relaxed=55, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=17 bias=17/18
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 | 213 0 | 21 | 58
0.00/0.05 c 0.0s | 0 | 18 | 2 | 213 0 | 21 | 58
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 = 18
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 4 and merging with 3 cores into a new core of size 21: cost of the new core is >=5
0.00/0.05 c lower bound updated to 17
0.00/0.05 c BCD2: 17 <= obj <= 99
0.00/0.05 c BCD2: #cores=9, #unrelaxed=141, #relaxed=59, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=18 bias=18/19
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 | 213 0 | 24 | 58
0.00/0.05 c 0.0s | 0 | 12 | 3 | 235 0 | 24 | 61
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 = 12
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 1 and merging with 2 cores into a new core of size 24: cost of the new core is >=7
0.00/0.05 c lower bound updated to 18
0.00/0.05 c BCD2: 18 <= obj <= 99
0.00/0.05 c BCD2: #cores=8, #unrelaxed=140, #relaxed=60, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=19 bias=19/20
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 | 235 0 | 26 | 61
0.00/0.05 c 0.0s | 0 | 12 | 1 | 235 0 | 26 | 63
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 = 12
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 1 cores into a new core of size 6: cost of the new core is >=2
0.00/0.05 c lower bound updated to 19
0.00/0.05 c BCD2: 19 <= obj <= 99
0.00/0.05 c BCD2: #cores=8, #unrelaxed=136, #relaxed=64, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=20 bias=20/21
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 | 235 0 | 27 | 63
0.00/0.05 c 0.0s | 0 | 11 | 0 | 235 0 | 27 | 64
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 = 11
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 3: cost of the new core is >=1
0.00/0.05 c lower bound updated to 20
0.00/0.05 c BCD2: 20 <= obj <= 99
0.00/0.05 c BCD2: #cores=9, #unrelaxed=133, #relaxed=67, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=21 bias=21/22
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 | 235 0 | 27 | 64
0.00/0.05 c 0.0s | 0 | 15 | 0 | 235 0 | 27 | 64
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 = 15
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 21
0.00/0.05 c BCD2: 21 <= obj <= 99
0.00/0.05 c BCD2: #cores=10, #unrelaxed=132, #relaxed=68, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=22 bias=22/23
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 | 235 0 | 27 | 64
0.00/0.05 c 0.0s | 0 | 32 | 1 | 235 0 | 31 | 78
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 = 32
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 5: cost of the new core is >=2
0.00/0.05 c lower bound updated to 22
0.00/0.05 c BCD2: 22 <= obj <= 99
0.00/0.05 c BCD2: #cores=10, #unrelaxed=130, #relaxed=70, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=23 bias=23/24
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 | 235 0 | 32 | 78
0.00/0.05 c 0.0s | 0 | 28 | 5 | 235 0 | 38 | 97
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 = 28
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: found a new core of size 1: cost of the new core is >=1
0.00/0.05 c lower bound updated to 23
0.00/0.05 c BCD2: 23 <= obj <= 99
0.00/0.05 c BCD2: #cores=11, #unrelaxed=129, #relaxed=71, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=24 bias=24/25
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 | 235 0 | 38 | 97
0.00/0.05 c 0.0s | 0 | 15 | 1 | 235 0 | 38 | 97
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 = 15
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 24
0.00/0.06 c BCD2: 24 <= obj <= 99
0.00/0.06 c BCD2: #cores=12, #unrelaxed=127, #relaxed=73, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=25 bias=25/26
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 | 235 0 | 38 | 97
0.00/0.06 c 0.0s | 0 | 28 | 2 | 235 0 | 38 | 97
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 = 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 6: cost of the new core is >=2
0.00/0.06 c lower bound updated to 25
0.00/0.06 c BCD2: 25 <= obj <= 99
0.00/0.06 c BCD2: #cores=12, #unrelaxed=125, #relaxed=75, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=26 bias=26/27
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 | 235 0 | 39 | 97
0.00/0.06 c 0.0s | 0 | 17 | 0 | 235 0 | 39 | 98
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 = 17
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 3: cost of the new core is >=1
0.00/0.06 c lower bound updated to 26
0.00/0.06 c BCD2: 26 <= obj <= 99
0.00/0.06 c BCD2: #cores=13, #unrelaxed=122, #relaxed=78, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=27 bias=27/28
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 | 235 0 | 39 | 98
0.00/0.06 c 0.0s | 0 | 21 | 1 | 235 0 | 39 | 98
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 = 21
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 1
0.00/0.06 c #restart = 0
0.00/0.06 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.06 c lower bound updated to 27
0.00/0.06 c BCD2: 27 <= obj <= 99
0.00/0.06 c BCD2: #cores=14, #unrelaxed=118, #relaxed=82, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=28 bias=28/29
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 | 235 0 | 39 | 98
0.00/0.06 c 0.0s | 0 | 19 | 0 | 235 0 | 39 | 98
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 = 19
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 5: cost of the new core is >=2
0.00/0.06 c lower bound updated to 28
0.00/0.06 c BCD2: 28 <= obj <= 99
0.00/0.06 c BCD2: #cores=14, #unrelaxed=116, #relaxed=84, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=29 bias=29/30
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 | 235 0 | 40 | 98
0.00/0.06 c 0.0s | 0 | 20 | 1 | 235 0 | 40 | 99
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 = 20
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 1
0.00/0.06 c #restart = 0
0.00/0.06 c BCD2: found a new core of size 5: cost of the new core is >=1
0.00/0.06 c lower bound updated to 29
0.00/0.06 c BCD2: 29 <= obj <= 99
0.00/0.06 c BCD2: #cores=15, #unrelaxed=111, #relaxed=89, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=30 bias=30/31
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 | 235 0 | 40 | 99
0.00/0.06 c 0.0s | 0 | 18 | 0 | 235 0 | 40 | 99
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 = 18
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 30
0.00/0.06 c BCD2: 30 <= obj <= 99
0.00/0.06 c BCD2: #cores=16, #unrelaxed=109, #relaxed=91, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=31 bias=31/32
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 | 235 0 | 40 | 99
0.00/0.06 c 0.0s | 0 | 19 | 0 | 235 0 | 40 | 99
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 = 19
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 31
0.00/0.06 c BCD2: 31 <= obj <= 99
0.00/0.06 c BCD2: #cores=16, #unrelaxed=107, #relaxed=93, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=32 bias=32/33
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 | 235 0 | 41 | 99
0.00/0.06 c 0.0s | 0 | 23 | 3 | 235 0 | 41 | 100
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 = 23
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 BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06 c lower bound updated to 32
0.00/0.06 c BCD2: 32 <= obj <= 99
0.00/0.06 c BCD2: #cores=17, #unrelaxed=105, #relaxed=95, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=33 bias=33/34
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 | 235 0 | 41 | 100
0.00/0.06 c 0.0s | 0 | 22 | 2 | 235 0 | 41 | 100
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 = 22
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 8: cost of the new core is >=3
0.00/0.06 c lower bound updated to 33
0.00/0.06 c BCD2: 33 <= obj <= 99
0.00/0.06 c BCD2: #cores=17, #unrelaxed=103, #relaxed=97, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=34 bias=34/35
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 | 235 0 | 42 | 100
0.00/0.07 c 0.0s | 0 | 26 | 1 | 235 0 | 42 | 101
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 = 26
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 1
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: relaxing 1 and merging with 3 cores into a new core of size 16: cost of the new core is >=5
0.00/0.07 c lower bound updated to 34
0.00/0.07 c BCD2: 34 <= obj <= 99
0.00/0.07 c BCD2: #cores=15, #unrelaxed=102, #relaxed=98, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=35 bias=35/36
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 | 235 0 | 45 | 101
0.00/0.07 c 0.0s | 0 | 20 | 3 | 235 0 | 45 | 104
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 = 20
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 3
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: relaxing 1 and merging with 5 cores into a new core of size 36: cost of the new core is >=12
0.00/0.07 c lower bound updated to 35
0.00/0.07 c BCD2: 35 <= obj <= 99
0.00/0.07 c BCD2: #cores=11, #unrelaxed=101, #relaxed=99, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=36 bias=36/37
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 | 235 0 | 50 | 104
0.00/0.07 c 0.0s | 0 | 15 | 0 | 235 0 | 50 | 109
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 = 15
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 1: cost of the new core is >=1
0.00/0.07 c lower bound updated to 36
0.00/0.07 c BCD2: 36 <= obj <= 99
0.00/0.07 c BCD2: #cores=12, #unrelaxed=100, #relaxed=100, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=37 bias=37/38
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 | 235 0 | 50 | 109
0.00/0.07 c 0.0s | 0 | 25 | 1 | 235 0 | 50 | 109
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 = 25
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 1
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.07 c lower bound updated to 37
0.00/0.07 c BCD2: 37 <= obj <= 99
0.00/0.07 c BCD2: #cores=13, #unrelaxed=97, #relaxed=103, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=38 bias=38/39
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 | 235 0 | 50 | 109
0.00/0.07 c 0.0s | 0 | 24 | 1 | 235 0 | 50 | 109
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 = 24
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 1
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: relaxing 4 and merging with 1 cores into a new core of size 9: cost of the new core is >=3
0.00/0.07 c lower bound updated to 38
0.00/0.07 c BCD2: 38 <= obj <= 99
0.00/0.07 c BCD2: #cores=13, #unrelaxed=93, #relaxed=107, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=39 bias=39/40
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 | 235 0 | 51 | 109
0.00/0.07 c 0.0s | 0 | 40 | 3 | 235 0 | 53 | 116
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 = 40
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 3
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 39
0.00/0.07 c BCD2: 39 <= obj <= 99
0.00/0.07 c BCD2: #cores=14, #unrelaxed=91, #relaxed=109, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=40 bias=40/41
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 | 235 0 | 53 | 116
0.00/0.07 c 0.0s | 0 | 37 | 6 | 235 0 | 67 | 160
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 = 37
0.00/0.07 c #random_decision = 0
0.00/0.07 c #conflict = 6
0.00/0.07 c #restart = 0
0.00/0.07 c BCD2: relaxing 1 and merging with 2 cores into a new core of size 39: cost of the new core is >=14
0.00/0.07 c lower bound updated to 40
0.00/0.07 c BCD2: 40 <= obj <= 99
0.00/0.07 c BCD2: #cores=13, #unrelaxed=90, #relaxed=110, #hardened=0
0.00/0.07 c BCD2: #sat=1 #unsat=41 bias=41/42
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 | 235 0 | 69 | 160
0.00/0.08 c 0.0s | 0 | 29 | 1 | 235 0 | 71 | 167
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 = 29
0.00/0.08 c #random_decision = 0
0.00/0.08 c #conflict = 1
0.00/0.08 c #restart = 0
0.00/0.08 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.08 c lower bound updated to 41
0.00/0.08 c BCD2: 41 <= obj <= 99
0.00/0.08 c BCD2: #cores=14, #unrelaxed=89, #relaxed=111, #hardened=0
0.00/0.08 c BCD2: #sat=1 #unsat=42 bias=42/43
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 | 235 0 | 71 | 167
0.00/0.08 c 0.0s | 0 | 34 | 5 | 235 0 | 234 | 185
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 = 5
0.00/0.08 c #restart = 0
0.00/0.08 c lower bound updated to 100
0.00/0.08 s OPTIMUM FOUND
0.00/0.08 v -x1 x2 x3 -x4 x5 -x6 -x7 x8 x9 -x10
0.00/0.08 v x11 -x12 x13 -x14 x15 -x16 x17 -x18 -x19 x20
0.00/0.08 v x21 -x22 -x23 x24 -x25 x26 x27 -x28 x29 -x30
0.00/0.08 v x31 -x32 -x33 x34 -x35 x36 -x37 x38 x39 -x40
0.00/0.08 v -x41 x42 x43 -x44 -x45 x46 x47 -x48 x49 -x50
0.00/0.08 v -x51 x52 x53 -x54 x55 -x56 x57 -x58 x59 -x60
0.00/0.08 v x61 -x62 x63 -x64 -x65 x66 x67 -x68 -x69 x70
0.00/0.08 v -x71 x72 x73 -x74 x75 -x76 -x77 x78 x79 -x80
0.00/0.08 v -x81 x82 x83 -x84 -x85 x86 -x87 x88 x89 -x90
0.00/0.08 v -x91 x92 x93 -x94 x95 -x96 x97 -x98 -x99 x100
0.00/0.08 v x101 -x102 x103 -x104 -x105 x106 x107 -x108 x109 -x110
0.00/0.08 v -x111 x112 -x113 x114 x115 -x116 x117 -x118 x119 -x120
0.00/0.08 v x121 -x122 -x123 x124 -x125 x126 -x127 x128 x129 -x130
0.00/0.08 v x131 -x132 -x133 x134 -x135 x136 x137 -x138 -x139 x140
0.00/0.08 v x141 -x142 x143 -x144 x145 -x146 -x147 x148 -x149 x150
0.00/0.08 v x151 -x152 -x153 x154 -x155 x156 -x157 x158 x159 -x160
0.00/0.08 v -x161 x162 x163 -x164 x165 -x166 -x167 x168 x169 -x170
0.00/0.08 v -x171 x172 x173 -x174 -x175 x176 x177 -x178 -x179 x180
0.00/0.08 v x181 -x182 x183 -x184 x185 -x186 -x187 x188 -x189 x190
0.00/0.08 v x191 -x192 x193 -x194 x195 -x196 x197 -x198 -x199 x200
0.00/0.08 c total CPU time = 0.081s
0.00/0.08 c total wall clock time = 0.081s
runsolver Copyright (C) 2010-2013 Olivier ROUSSEL
This is runsolver version 3.3.7 (svn: 2553)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4102433-1466229988/watcher-4102433-1466229988 -o /tmp/evaluation-result-4102433-1466229988/solver-4102433-1466229988 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node123-1466206081-595 --watchdog 1960 toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4102433-1466229988.opb
pid=4620
running on 4 cores: 0,2,4,6
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.21 2.26 2.26 3/179 4623
/proc/meminfo: memFree=28927076/32872528 swapFree=17888/1798212
[pid=4623] ppid=4620 vsize=765372 CPUtime=0 cores=0,2,4,6
/proc/4623/stat : 4623 (toysat) R 4620 4623 579 0 -1 4202496 2861 0 0 0 0 0 0 0 20 0 4 0 25045951 783740928 3221 33554432000 4194304 16246674 140737044859312 140737044858736 13880264 0 2 0 34082818 18446744073709551615 0 0 17 2 0 0 0 0 0
/proc/4623/statm: 191855 3229 441 2943 0 188749 0
[pid=4623/tid=4624] ppid=4620 vsize=783804 CPUtime=0 cores=0,2,4,6
/proc/4623/task/4624/stat : 4624 (toysat) S 4620 4623 579 0 -1 4202560 9 0 0 0 0 0 0 0 20 0 4 0 25045951 802615296 3294 33554432000 4194304 16246674 140737044859312 140408696843504 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 4 0 0 0 0 0
[pid=4623/tid=4625] ppid=4620 vsize=787900 CPUtime=0 cores=0,2,4,6
/proc/4623/task/4625/stat : 4625 (toysat) S 4620 4623 579 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 25045951 806809600 3310 33554432000 4194304 16246674 140737044859312 140408686353648 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 0 0 0 0 0 0
[pid=4623/tid=4626] ppid=4620 vsize=791996 CPUtime=0 cores=0,2,4,6
/proc/4623/task/4626/stat : 4626 (toysat) S 4620 4623 579 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 25045951 811003904 3327 33554432000 4194304 16246674 140737044859312 140408675880112 14069300 0 0 0 34082818 18446744071579510697 0 0 -1 4 0 0 0 0 0
Solver just ended.
??? exit watcher main loop
??? sigkill at end of watcher main loop
??? kill 4623 sig 9
??? kill -4623 sig 9
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.088595
CPU time (s): 0.087986
CPU user time (s): 0.049992
CPU system time (s): 0.037994
CPU usage (%): 99.3126
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.049992
system time used= 0.037994
maximum resident set size= 81492
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 20035
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 21
involuntary context switches= 4
??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.001999 second user time and 0.006998 second system time
The end