0.00/0.00 c 2016-06-29T17:25:11+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-4117510-1467213911.opb"]
0.00/0.01 c use --random-gen="3327570078 4139265660 1531350004 3241447744 532511200 571022148 1216584766 2530126120 1807408174 2393539057 3945634933 1684631850 1725594292 843653150 4107597668 1209840162 404942574 1796769429 1758682791 4172758450 2239517912 2552224287 1834140900 712702568 3406768243 3748190158 3040139274 1165093665 1622464918 1338146045 1629567251 992232074 1657316764 2367346438 3496863906 669162334 4094920297 2342625136 108570805 3489803374 421279523 3684221832 2399413521 3089406903 2852387512 1294648870 3050773774 3179741353 4118301037 3434654397 1743847260 1343954013 971151104 1058367680 1997305570 1300750807 3161617576 3724817763 1741441847 176525898 1282861944 2971697555 2700805963 2194936984 2009931376 1187634890 4173308057 3739329043 2110186707 4066779282 2164598160 3227917928 261427852 2143672649 1564726018 2602100755 4116714681 4187750818 3989990932 1583299278 3216719062 3168025483 3297172263 2140571184 21807079 2156616586 3609710695 3817409394 4235720974 3706616861 2493402238 2728172419 2576828363 871948628 3292999676 1024951072 631583852 1137324620 2817185207 3150568262 1311693625 1130713664 2709745067 3018743359 4262944356 922622082 1917806119 3319045613 1667914642 3716296046 3279369170 2945746795 3936126454 2016438533 2221641974 4146314682 1863661851 229958094 1960629130 3182150930 3693782998 4281241235 238523329 774417835 3611053079 3354206483 3187311209 1544540621 1125306501 187765593 3291072790 2566038236 580426589 3753323651 3294750186 686282929 2844072482 1749318479 3293055732 3073543556 2076973045 667557141 3587991097 1534047301 3271849715 128673834 62634993 4118459242 3806898698 2690167217 3562040730 1788233113 761330708 3024555089 2852042037 1794923874 4120298958 1052528249 2393994045 2957373454 1949560588 496566526 4209454490 2172385710 754931071 2516922214 3938296681 777154740 2457422042 11119463 3965486867 2888301435 966931313 4160449385 664989297 3397157915 1138554924 815845521 2671941458 756896082 3745807290 1042256937 2000119550 1109065892 757939557 1986415620 65510900 1685075498 70940823 3454244448 2202868891 787751430 2343612239 2343891904 3945448867 1685505321 3920242195 2403940135 2446254472 3115688140 1877315203 2977639958 227459145 1007511893 507331112 4201107070 644797279 1516565876 484316264 4152862034 54384158 2282133362 4255292154 1458368358 1395108655 2718859934 3850859728 2645143094 4050626266 1897246541 2982700300 371826484 507790964 3556078094 521230476 1967647610 994136734 2041711620 3087539983 1440350836 87397563 1585112242 996247125 2556545131 2879837539 3538292205 1110768752 3392309603 3574902981 2853582561 2311890716 3377483007 3839962342 898228073 4171284378 1019867826 408231914 1060945289 3733290329 1977113888 3245374220 4138013888 1612610659 1330777418 3530727436 1740355305 255 362436" option to reproduce the execution
0.00/0.01 c #vars 100
0.00/0.01 c #constraints 58
0.00/0.01 c BCD2: Hardening is enabled.
0.00/0.01 c BCD2: BiasedSearch is enabled.
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 67 0 | 11 | 0
0.00/0.02 c 0.0s | 0 | 46 | 37 | 67 0 | 26 | 10
0.00/0.02 c #cpu_time = 0.004s
0.00/0.02 c #wall_clock_time = 0.004s
0.00/0.02 c #decision = 46
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 37
0.00/0.02 c #restart = 0
0.00/0.02 o 50
0.00/0.02 c BCD2: updating upper bound: 100 -> 49
0.00/0.02 c BCD2: 0 <= obj <= 49
0.00/0.02 c BCD2: #cores=0, #unrelaxed=100, #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 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 26 | 10
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 = 0
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 1
0.00/0.02 c BCD2: 1 <= obj <= 49
0.00/0.02 c BCD2: #cores=1, #unrelaxed=99, #relaxed=1, #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 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 1 | 0 | 67 0 | 26 | 10
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 = 1
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 2
0.00/0.02 c BCD2: 2 <= obj <= 49
0.00/0.02 c BCD2: #cores=2, #unrelaxed=98, #relaxed=2, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=3 bias=3/4
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 2 | 0 | 67 0 | 26 | 10
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 = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 3
0.00/0.02 c BCD2: 3 <= obj <= 49
0.00/0.02 c BCD2: #cores=3, #unrelaxed=97, #relaxed=3, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=4 bias=4/5
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 3 | 0 | 67 0 | 26 | 10
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 = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 4
0.00/0.02 c BCD2: 4 <= obj <= 49
0.00/0.02 c BCD2: #cores=4, #unrelaxed=96, #relaxed=4, #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 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 4 | 0 | 67 0 | 26 | 10
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 4
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 5
0.00/0.02 c BCD2: 5 <= obj <= 49
0.00/0.02 c BCD2: #cores=5, #unrelaxed=95, #relaxed=5, #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 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 5 | 0 | 67 0 | 26 | 10
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 5
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 6
0.00/0.02 c BCD2: 6 <= obj <= 49
0.00/0.02 c BCD2: #cores=6, #unrelaxed=94, #relaxed=6, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=7 bias=7/8
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 6 | 0 | 67 0 | 26 | 10
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 6
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 7
0.00/0.02 c BCD2: 7 <= obj <= 49
0.00/0.02 c BCD2: #cores=7, #unrelaxed=93, #relaxed=7, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=8 bias=8/9
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 7 | 0 | 67 0 | 26 | 10
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 = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 8
0.00/0.02 c BCD2: 8 <= obj <= 49
0.00/0.02 c BCD2: #cores=8, #unrelaxed=92, #relaxed=8, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=9 bias=9/10
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 8 | 0 | 67 0 | 26 | 10
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 = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 9
0.00/0.02 c BCD2: 9 <= obj <= 49
0.00/0.02 c BCD2: #cores=9, #unrelaxed=91, #relaxed=9, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=10 bias=10/11
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 11 | 1 | 67 0 | 26 | 10
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 11
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.02 c lower bound updated to 10
0.00/0.02 c BCD2: 10 <= obj <= 49
0.00/0.02 c BCD2: #cores=10, #unrelaxed=89, #relaxed=11, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=11 bias=11/12
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 26 | 10
0.00/0.02 c 0.0s | 0 | 12 | 1 | 67 0 | 26 | 10
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 12
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: 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 11
0.00/0.02 c BCD2: 11 <= obj <= 49
0.00/0.02 c BCD2: #cores=10, #unrelaxed=87, #relaxed=13, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=12 bias=12/13
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 27 | 10
0.00/0.02 c 0.0s | 0 | 21 | 1 | 67 0 | 28 | 11
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 = 21
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 12
0.00/0.02 c BCD2: 12 <= obj <= 49
0.00/0.02 c BCD2: #cores=11, #unrelaxed=86, #relaxed=14, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=13 bias=13/14
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 67 0 | 28 | 11
0.00/0.02 c 0.0s | 0 | 11 | 0 | 67 0 | 28 | 11
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 11
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 13
0.00/0.02 c BCD2: 13 <= obj <= 49
0.00/0.02 c BCD2: #cores=12, #unrelaxed=85, #relaxed=15, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=14 bias=14/15
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 67 0 | 28 | 11
0.00/0.03 c 0.0s | 0 | 14 | 1 | 67 0 | 28 | 11
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 14
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 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 14
0.00/0.03 c BCD2: 14 <= obj <= 49
0.00/0.03 c BCD2: #cores=13, #unrelaxed=83, #relaxed=17, #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 | 67 0 | 28 | 11
0.00/0.03 c 0.0s | 0 | 15 | 1 | 67 0 | 28 | 11
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 15
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: 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 15
0.00/0.03 c BCD2: 15 <= obj <= 49
0.00/0.03 c BCD2: #cores=13, #unrelaxed=81, #relaxed=19, #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 | 67 0 | 29 | 11
0.00/0.03 c 0.0s | 0 | 15 | 1 | 67 0 | 29 | 12
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 15
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 6: cost of the new core is >=3
0.00/0.03 c lower bound updated to 16
0.00/0.03 c BCD2: 16 <= obj <= 49
0.00/0.03 c BCD2: #cores=13, #unrelaxed=79, #relaxed=21, #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 | 67 0 | 30 | 12
0.00/0.03 c 0.0s | 0 | 27 | 1 | 67 0 | 45 | 19
0.00/0.03 c #cpu_time = 0.001s
0.00/0.03 c #wall_clock_time = 0.001s
0.00/0.03 c #decision = 27
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 17
0.00/0.03 c BCD2: 17 <= obj <= 49
0.00/0.03 c BCD2: #cores=14, #unrelaxed=78, #relaxed=22, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=18 bias=18/19
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 67 0 | 45 | 19
0.00/0.03 c 0.0s | 0 | 21 | 0 | 67 0 | 45 | 19
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 21
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 8: cost of the new core is >=1
0.00/0.03 c lower bound updated to 18
0.00/0.03 c BCD2: 18 <= obj <= 49
0.00/0.03 c BCD2: #cores=15, #unrelaxed=70, #relaxed=30, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=19 bias=19/20
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 67 0 | 45 | 20
0.00/0.03 c 0.0s | 0 | 20 | 1 | 67 0 | 45 | 20
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: found a new core of size 5: cost of the new core is >=1
0.00/0.03 c lower bound updated to 19
0.00/0.03 c BCD2: 19 <= obj <= 49
0.00/0.03 c BCD2: #cores=16, #unrelaxed=65, #relaxed=35, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=20 bias=20/21
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 67 0 | 45 | 20
0.00/0.03 c 0.0s | 0 | 18 | 0 | 67 0 | 45 | 20
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 = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 20
0.00/0.03 c BCD2: 20 <= obj <= 49
0.00/0.03 c BCD2: #cores=17, #unrelaxed=64, #relaxed=36, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=21 bias=21/22
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 67 0 | 45 | 20
0.00/0.03 c 0.0s | 0 | 20 | 1 | 67 0 | 45 | 20
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 3 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 21
0.00/0.03 c BCD2: 21 <= obj <= 49
0.00/0.03 c BCD2: #cores=17, #unrelaxed=61, #relaxed=39, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=22 bias=22/23
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 67 0 | 46 | 20
0.00/0.03 c 0.0s | 0 | 20 | 1 | 67 0 | 46 | 21
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 3 and merging with 1 cores into a new core of size 8: cost of the new core is >=2
0.00/0.03 c lower bound updated to 22
0.00/0.03 c BCD2: 22 <= obj <= 49
0.00/0.03 c BCD2: #cores=17, #unrelaxed=58, #relaxed=42, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=23 bias=23/24
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 67 0 | 47 | 21
0.00/0.03 c 0.0s | 0 | 20 | 1 | 67 0 | 47 | 22
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 3 and merging with 1 cores into a new core of size 11: cost of the new core is >=3
0.00/0.03 c lower bound updated to 23
0.00/0.03 c BCD2: 23 <= obj <= 49
0.00/0.03 c BCD2: #cores=17, #unrelaxed=55, #relaxed=45, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=24 bias=24/25
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 67 0 | 48 | 22
0.00/0.03 c 0.0s | 0 | 20 | 2 | 67 0 | 48 | 23
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 20
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 13: cost of the new core is >=4
0.00/0.03 c lower bound updated to 24
0.00/0.03 c BCD2: 24 <= obj <= 49
0.00/0.03 c BCD2: #cores=17, #unrelaxed=53, #relaxed=47, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=25 bias=25/26
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 67 0 | 49 | 23
0.00/0.03 c 0.0s | 0 | 21 | 1 | 67 0 | 49 | 24
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 21
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.04 c lower bound updated to 25
0.00/0.04 c BCD2: 25 <= obj <= 49
0.00/0.04 c BCD2: #cores=18, #unrelaxed=50, #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 | 67 0 | 49 | 24
0.00/0.04 c 0.0s | 0 | 20 | 1 | 67 0 | 49 | 24
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 = 1
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 26
0.00/0.04 c BCD2: 26 <= obj <= 49
0.00/0.04 c BCD2: #cores=19, #unrelaxed=48, #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 | 67 0 | 49 | 24
0.00/0.04 c 0.0s | 0 | 20 | 0 | 67 0 | 49 | 24
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 = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 27
0.00/0.04 c BCD2: 27 <= obj <= 49
0.00/0.04 c BCD2: #cores=20, #unrelaxed=47, #relaxed=53, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=28 bias=28/29
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 49 | 24
0.00/0.04 c 0.0s | 0 | 22 | 1 | 67 0 | 49 | 24
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 22
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 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 28
0.00/0.04 c BCD2: 28 <= obj <= 49
0.00/0.04 c BCD2: #cores=20, #unrelaxed=45, #relaxed=55, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=29 bias=29/30
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 50 | 24
0.00/0.04 c 0.0s | 0 | 25 | 1 | 67 0 | 50 | 25
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 = 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 29
0.00/0.04 c BCD2: 29 <= obj <= 49
0.00/0.04 c BCD2: #cores=21, #unrelaxed=41, #relaxed=59, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=30 bias=30/31
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 50 | 25
0.00/0.04 c 0.0s | 0 | 22 | 0 | 67 0 | 50 | 25
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 22
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 30
0.00/0.04 c BCD2: 30 <= obj <= 49
0.00/0.04 c BCD2: #cores=22, #unrelaxed=40, #relaxed=60, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=31 bias=31/32
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 50 | 25
0.00/0.04 c 0.0s | 0 | 25 | 0 | 67 0 | 50 | 25
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 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 31
0.00/0.04 c BCD2: 31 <= obj <= 49
0.00/0.04 c BCD2: #cores=23, #unrelaxed=39, #relaxed=61, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=32 bias=32/33
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 50 | 25
0.00/0.04 c 0.0s | 0 | 27 | 1 | 67 0 | 50 | 25
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 = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 3 and merging with 1 cores into a new core of size 7: cost of the new core is >=2
0.00/0.04 c lower bound updated to 32
0.00/0.04 c BCD2: 32 <= obj <= 49
0.00/0.04 c BCD2: #cores=23, #unrelaxed=36, #relaxed=64, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=33 bias=33/34
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 51 | 25
0.00/0.04 c 0.0s | 0 | 25 | 0 | 67 0 | 51 | 26
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 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 33
0.00/0.04 c BCD2: 33 <= obj <= 49
0.00/0.04 c BCD2: #cores=24, #unrelaxed=35, #relaxed=65, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=34 bias=34/35
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 51 | 26
0.00/0.04 c 0.0s | 0 | 53 | 1 | 67 0 | 53 | 28
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 = 53
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 2: cost of the new core is >=1
0.00/0.04 c lower bound updated to 34
0.00/0.04 c BCD2: 34 <= obj <= 49
0.00/0.04 c BCD2: #cores=25, #unrelaxed=33, #relaxed=67, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=35 bias=35/36
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 53 | 28
0.00/0.04 c 0.0s | 0 | 28 | 1 | 67 0 | 53 | 28
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 = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.04 c lower bound updated to 35
0.00/0.04 c BCD2: 35 <= obj <= 49
0.00/0.04 c BCD2: #cores=25, #unrelaxed=32, #relaxed=68, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=36 bias=36/37
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 54 | 28
0.00/0.04 c 0.0s | 0 | 26 | 0 | 67 0 | 54 | 29
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 = 26
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 36
0.00/0.04 c BCD2: 36 <= obj <= 49
0.00/0.04 c BCD2: #cores=26, #unrelaxed=31, #relaxed=69, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=37 bias=37/38
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 67 0 | 54 | 29
0.00/0.04 c 0.0s | 0 | 27 | 0 | 67 0 | 54 | 29
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 = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 37
0.00/0.04 c BCD2: 37 <= obj <= 49
0.00/0.04 c BCD2: #cores=27, #unrelaxed=30, #relaxed=70, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=38 bias=38/39
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 | 67 0 | 54 | 29
0.00/0.05 c 0.0s | 0 | 34 | 1 | 67 0 | 54 | 29
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 = 34
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 1 and merging with 1 cores into a new core of size 8: cost of the new core is >=3
0.00/0.05 c lower bound updated to 38
0.00/0.05 c BCD2: 38 <= obj <= 49
0.00/0.05 c BCD2: #cores=27, #unrelaxed=29, #relaxed=71, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=39 bias=39/40
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 | 67 0 | 55 | 29
0.00/0.05 c 0.0s | 0 | 28 | 0 | 67 0 | 55 | 30
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 = 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 39
0.00/0.05 c BCD2: 39 <= obj <= 49
0.00/0.05 c BCD2: #cores=28, #unrelaxed=28, #relaxed=72, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=40 bias=40/41
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 67 0 | 55 | 30
0.00/0.05 c 0.0s | 0 | 30 | 0 | 67 0 | 55 | 30
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 = 30
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 40
0.00/0.05 c BCD2: 40 <= obj <= 49
0.00/0.05 c BCD2: #cores=29, #unrelaxed=26, #relaxed=74, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=41 bias=41/42
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 67 0 | 55 | 30
0.00/0.05 c 0.0s | 0 | 31 | 1 | 67 0 | 55 | 30
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 = 31
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 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.05 c lower bound updated to 41
0.00/0.05 c BCD2: 41 <= obj <= 49
0.00/0.05 c BCD2: #cores=29, #unrelaxed=25, #relaxed=75, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=42 bias=42/43
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 67 0 | 56 | 30
0.00/0.05 c 0.0s | 0 | 30 | 0 | 67 0 | 56 | 31
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 = 30
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 0
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.05 c lower bound updated to 42
0.00/0.05 c BCD2: 42 <= obj <= 49
0.00/0.05 c BCD2: #cores=30, #unrelaxed=24, #relaxed=76, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=43 bias=43/44
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 67 0 | 56 | 31
0.00/0.05 c 0.0s | 0 | 31 | 0 | 67 0 | 56 | 31
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 = 31
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 0
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.05 c lower bound updated to 43
0.00/0.05 c BCD2: 43 <= obj <= 49
0.00/0.05 c BCD2: #cores=31, #unrelaxed=23, #relaxed=77, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=44 bias=44/45
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 67 0 | 56 | 31
0.00/0.05 c 0.0s | 0 | 60 | 4 | 67 0 | 57 | 31
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 = 60
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 4
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: relaxing 0 and merging with 4 cores into a new core of size 18: cost of the new core is >=9
0.00/0.05 c lower bound updated to 44
0.00/0.05 c BCD2: 44 <= obj <= 49
0.00/0.05 c BCD2: #cores=28, #unrelaxed=23, #relaxed=77, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=45 bias=45/46
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 67 0 | 61 | 31
0.00/0.05 c 0.0s | 0 | 38 | 8 | 67 0 | 61 | 35
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 = 38
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 8
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: relaxing 0 and merging with 5 cores into a new core of size 51: cost of the new core is >=21
0.00/0.05 c lower bound updated to 45
0.00/0.05 c BCD2: 45 <= obj <= 49
0.00/0.05 c BCD2: #cores=24, #unrelaxed=23, #relaxed=77, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=46 bias=46/47
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 67 0 | 66 | 35
0.00/0.05 c 0.0s | 0 | 55 | 8 | 67 0 | 121 | 60
0.00/0.05 c #cpu_time = 0.002s
0.00/0.05 c #wall_clock_time = 0.002s
0.00/0.05 c #decision = 55
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 8
0.00/0.05 c #restart = 0
0.00/0.05 c lower bound updated to 50
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 v -x1 x2 x3 x4 x5 -x6 x7 x8 x9 x10
0.00/0.06 v -x11 -x12 -x13 x14 x15 x16 -x17 -x18 x19 x20
0.00/0.06 v -x21 -x22 -x23 -x24 x25 x26 x27 -x28 -x29 -x30
0.00/0.06 v -x31 x32 -x33 x34 x35 x36 x37 -x38 -x39 -x40
0.00/0.06 v -x41 x42 -x43 x44 -x45 x46 x47 x48 -x49 x50
0.00/0.06 v x51 x52 -x53 -x54 x55 x56 -x57 -x58 -x59 -x60
0.00/0.06 v -x61 -x62 -x63 -x64 -x65 x66 -x67 -x68 -x69 -x70
0.00/0.06 v -x71 -x72 x73 x74 x75 -x76 -x77 x78 x79 x80
0.00/0.06 v -x81 -x82 -x83 x84 x85 -x86 x87 -x88 x89 x90
0.00/0.06 v -x91 x92 -x93 x94 x95 x96 x97 -x98 x99 x100
0.00/0.06 c total CPU time = 0.058s
0.00/0.06 c total wall clock time = 0.058s
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-4117510-1467213911/watcher-4117510-1467213911 -o /tmp/evaluation-result-4117510-1467213911/solver-4117510-1467213911 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node117-1467210309-2000 --watchdog 1960 toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4117510-1467213911.opb
pid=2316
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.28 2.20 3/170 2319
/proc/meminfo: memFree=28684416/32872528 swapFree=1553660/1717180
[pid=2319] ppid=2316 vsize=767420 CPUtime=0 cores=0,2,4,6
/proc/2319/stat : 2319 (toysat) R 2316 2319 1984 0 -1 4202496 2873 0 0 0 0 0 0 0 20 0 4 0 418726 785838080 2722 33554432000 4194304 16246674 140733631011168 140733631010592 13880264 0 2 0 34082818 18446744073709551615 0 0 17 4 0 0 0 0 0
/proc/2319/statm: 192623 2734 441 2943 0 189517 0
[pid=2319/tid=2320] ppid=2316 vsize=786876 CPUtime=0 cores=0,2,4,6
/proc/2319/task/2320/stat : 2320 (toysat) S 2316 2319 1984 0 -1 4202560 10 0 0 0 0 0 0 0 20 0 4 0 418726 805761024 2798 33554432000 4194304 16246674 140733631011168 139962491055344 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 2 0 0 0 0 0
[pid=2319/tid=2321] ppid=2316 vsize=790972 CPUtime=0 cores=0,2,4,6
/proc/2319/task/2321/stat : 2321 (toysat) S 2316 2319 1984 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 418726 809955328 2814 33554432000 4194304 16246674 140733631011168 139962480565488 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 4 0 0 0 0 0
[pid=2319/tid=2322] ppid=2316 vsize=795068 CPUtime=0 cores=0,2,4,6
/proc/2319/task/2322/stat : 2322 (toysat) S 2316 2319 1984 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 418726 814149632 2830 33554432000 4194304 16246674 140733631011168 139962470091952 14069300 0 0 0 34082818 18446744071579510697 0 0 -1 2 0 0 0 0 0
Solver just ended.
??? exit watcher main loop
??? sigkill at end of watcher main loop
??? kill 2319 sig 9
??? kill -2319 sig 9
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.064018
CPU time (s): 0.06299
CPU user time (s): 0.037994
CPU system time (s): 0.024996
CPU usage (%): 98.3941
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.037994
system time used= 0.024996
maximum resident set size= 57132
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 14455
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= 19
involuntary context switches= 4
??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.003999 second user time and 0.005999 second system time
The end