0.00/0.00 c 2016-06-29T17:36:27+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-4117645-1467214587.opb"]
0.00/0.01 c use --random-gen="2855540467 3492261038 311069752 2653296331 3288484271 53271944 425739663 3476955926 4105509831 1849494124 1790543928 4221759488 1306328545 1053819096 2645749079 2600888338 1342551676 3815977568 1872057975 3886088456 197475594 984770550 3689981372 178872665 1692109903 3719443484 2731515573 3912469822 3254345591 3192586889 2256675419 2995436270 674536684 481416498 1246316816 3711732491 403357087 572984946 2408464795 1794174046 269378685 1528125694 665461691 3658221378 3827120150 657318730 4273530945 3708923229 161078947 4250211141 1150679579 227955313 1647723165 3725084978 2289150686 3333292329 2014489549 2726780618 3062638530 361198782 20297047 1160922327 3902457099 2173264175 4233391856 2978548141 866348960 949275633 105464978 3487061997 4245688785 147939361 336394136 2526130736 3659671640 2193685208 1781550956 1172974641 813421139 1025733570 2010321594 1931280340 3230767897 4058075867 3195104934 2222056707 141019238 3199132043 3222007095 2288471844 4155826394 1671160033 1490905923 3048036241 3611562208 3343432582 1309027566 363921374 1879520744 1096960964 54915690 2960950797 7387944 1039982575 3298189643 77671375 1281650909 3094356855 4089152506 230675917 2178396460 2807379909 141694146 2260144345 3883527777 1924353088 2958757759 3932525747 1619238908 2172284058 1989495578 571258572 3556536843 506239091 126230481 2771956687 3651726324 1443815896 1563591899 2753593323 1211544035 2201379695 2705456844 476632301 4225616426 3116674942 3248473150 3883001609 867312692 2690897747 617183825 3715871329 859027099 3728253261 1683735137 2171013435 3828825091 2910480137 4166936011 1145677496 529172349 867258499 2097272804 2757571697 2590186293 3969919642 893500914 1097154251 3768055026 3736817721 476924177 3655648811 3652618569 3104902568 4050880498 1105386110 2281502494 945583010 986288413 4049700053 3492401159 2283752186 3056711328 1514983887 4270881722 3229785377 953566571 2699589481 3508639466 2599780483 3439009644 3355431620 1285105283 1529898679 3438358618 3293232804 3267723326 3041219428 942006295 826986842 1540817968 574107997 1327320781 258101294 355034231 1546751547 358132489 4046178799 1145057066 1925242347 2338112486 1330557302 1817534074 4018225882 66163633 3496084789 1676729000 3744764701 2583109924 814156641 4091521602 932740808 249853118 4071185619 1185489714 4154726135 268142384 4127419770 2222054396 2904278999 2754634502 1077099383 3442487914 2920959536 1087406250 650841880 135026020 120845789 1567646653 1346253425 4193020076 3865664709 4207211832 2508077962 4093646540 3861686173 1992333896 662853643 738027009 1471111211 741527072 2863926187 1989550223 4131742164 1490997341 558568252 2787903567 2055504833 2642637880 2694687450 2591078273 732602273 3489925806 3634761833 3734472078 3378497348 255 362436" option to reproduce the execution
0.00/0.01 c #vars 64
0.00/0.01 c #constraints 46
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 | 47 0 | 12 | 0
0.00/0.01 c 0.0s | 0 | 4 | 2 | 47 0 | 12 | 0
0.00/0.01 c #cpu_time = 0.001s
0.00/0.01 c #wall_clock_time = 0.001s
0.00/0.01 c #decision = 4
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 2
0.00/0.01 c #restart = 0
0.00/0.01 o 26
0.00/0.01 c BCD2: updating upper bound: 64 -> 25
0.00/0.01 c BCD2: 0 <= obj <= 25
0.00/0.01 c BCD2: #cores=0, #unrelaxed=64, #relaxed=0, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=1 bias=1/2
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 47 0 | 12 | 0
0.00/0.01 c 0.0s | 0 | 3 | 1 | 47 0 | 12 | 0
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 3
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 1
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.01 c lower bound updated to 1
0.00/0.01 c BCD2: 1 <= obj <= 25
0.00/0.01 c BCD2: #cores=1, #unrelaxed=61, #relaxed=3, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=2 bias=2/3
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 47 0 | 12 | 0
0.00/0.01 c 0.0s | 0 | 3 | 1 | 47 0 | 12 | 0
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 3
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 1
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.01 c lower bound updated to 2
0.00/0.01 c BCD2: 2 <= obj <= 25
0.00/0.01 c BCD2: #cores=2, #unrelaxed=59, #relaxed=5, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=3 bias=3/4
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 | 47 0 | 12 | 0
0.00/0.01 c 0.0s | 0 | 4 | 1 | 47 0 | 12 | 0
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 4
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 1
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: relaxing 2 and merging with 2 cores into a new core of size 7: cost of the new core is >=3
0.00/0.01 c lower bound updated to 3
0.00/0.01 c BCD2: 3 <= obj <= 25
0.00/0.01 c BCD2: #cores=1, #unrelaxed=57, #relaxed=7, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=4 bias=4/5
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 | 47 0 | 14 | 0
0.00/0.01 c 0.0s | 0 | 4 | 2 | 47 0 | 14 | 2
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 4
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 2
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 9: cost of the new core is >=4
0.00/0.01 c lower bound updated to 4
0.00/0.01 c BCD2: 4 <= obj <= 25
0.00/0.01 c BCD2: #cores=1, #unrelaxed=55, #relaxed=9, #hardened=0
0.00/0.01 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 | 47 0 | 15 | 2
0.00/0.02 c 0.0s | 0 | 4 | 2 | 47 0 | 15 | 3
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 4
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 2
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 11: cost of the new core is >=5
0.00/0.02 c lower bound updated to 5
0.00/0.02 c BCD2: 5 <= obj <= 25
0.00/0.02 c BCD2: #cores=1, #unrelaxed=53, #relaxed=11, #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 | 47 0 | 16 | 3
0.00/0.02 c 0.0s | 0 | 4 | 1 | 47 0 | 16 | 4
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 4
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 3 and merging with 1 cores into a new core of size 14: cost of the new core is >=6
0.00/0.02 c lower bound updated to 6
0.00/0.02 c BCD2: 6 <= obj <= 25
0.00/0.02 c BCD2: #cores=1, #unrelaxed=50, #relaxed=14, #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 | 47 0 | 17 | 4
0.00/0.02 c 0.0s | 0 | 7 | 2 | 47 0 | 17 | 5
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 7
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 2
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 5 and merging with 1 cores into a new core of size 19: cost of the new core is >=7
0.00/0.02 c lower bound updated to 7
0.00/0.02 c BCD2: 7 <= obj <= 25
0.00/0.02 c BCD2: #cores=1, #unrelaxed=45, #relaxed=19, #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 | 47 0 | 18 | 5
0.00/0.02 c 0.0s | 0 | 7 | 1 | 47 0 | 19 | 6
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 7
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 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 <= 25
0.00/0.02 c BCD2: #cores=2, #unrelaxed=44, #relaxed=20, #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 | 47 0 | 19 | 6
0.00/0.02 c 0.0s | 0 | 9 | 1 | 47 0 | 20 | 6
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 9
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 9
0.00/0.02 c BCD2: 9 <= obj <= 25
0.00/0.02 c BCD2: #cores=3, #unrelaxed=43, #relaxed=21, #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 | 47 0 | 20 | 6
0.00/0.02 c 0.0s | 0 | 12 | 2 | 47 0 | 20 | 6
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 12
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 2
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.02 c lower bound updated to 10
0.00/0.02 c BCD2: 10 <= obj <= 25
0.00/0.02 c BCD2: #cores=4, #unrelaxed=39, #relaxed=25, #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 | 47 0 | 20 | 6
0.00/0.02 c 0.0s | 0 | 9 | 1 | 47 0 | 20 | 6
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 9
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 4 and merging with 1 cores into a new core of size 8: 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 <= 25
0.00/0.02 c BCD2: #cores=4, #unrelaxed=35, #relaxed=29, #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 | 47 0 | 21 | 6
0.00/0.02 c 0.0s | 0 | 6 | 0 | 47 0 | 21 | 7
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 2: 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 <= 25
0.00/0.02 c BCD2: #cores=5, #unrelaxed=33, #relaxed=31, #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 | 47 0 | 21 | 7
0.00/0.02 c 0.0s | 0 | 20 | 4 | 47 0 | 22 | 7
0.00/0.02 c #cpu_time = 0.001s
0.00/0.02 c #wall_clock_time = 0.001s
0.00/0.02 c #decision = 20
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 4
0.00/0.02 c #restart = 0
0.00/0.02 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.02 c lower bound updated to 13
0.00/0.02 c BCD2: 13 <= obj <= 25
0.00/0.02 c BCD2: #cores=5, #unrelaxed=29, #relaxed=35, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=14 bias=14/15
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 47 0 | 23 | 7
0.00/0.02 c 0.0s | 0 | 13 | 1 | 47 0 | 24 | 8
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 13
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 14
0.00/0.02 c BCD2: 14 <= obj <= 25
0.00/0.02 c BCD2: #cores=6, #unrelaxed=28, #relaxed=36, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=15 bias=15/16
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 47 0 | 24 | 8
0.00/0.02 c 0.0s | 0 | 9 | 1 | 47 0 | 24 | 8
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 = 9
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 8: cost of the new core is >=3
0.00/0.02 c lower bound updated to 15
0.00/0.02 c BCD2: 15 <= obj <= 25
0.00/0.02 c BCD2: #cores=6, #unrelaxed=26, #relaxed=38, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=16 bias=16/17
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 | 47 0 | 25 | 8
0.00/0.02 c 0.0s | 0 | 12 | 1 | 47 0 | 25 | 9
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 5 and merging with 1 cores into a new core of size 13: cost of the new core is >=4
0.00/0.02 c lower bound updated to 16
0.00/0.02 c BCD2: 16 <= obj <= 25
0.00/0.02 c BCD2: #cores=6, #unrelaxed=21, #relaxed=43, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=17 bias=17/18
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 | 47 0 | 26 | 9
0.00/0.03 c 0.0s | 0 | 11 | 1 | 47 0 | 26 | 10
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 11
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 9: cost of the new core is >=3
0.00/0.03 c lower bound updated to 17
0.00/0.03 c BCD2: 17 <= obj <= 25
0.00/0.03 c BCD2: #cores=6, #unrelaxed=20, #relaxed=44, #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 | 47 0 | 27 | 10
0.00/0.03 c 0.0s | 0 | 8 | 0 | 47 0 | 27 | 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 = 8
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 18
0.00/0.03 c BCD2: 18 <= obj <= 25
0.00/0.03 c BCD2: #cores=7, #unrelaxed=18, #relaxed=46, #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 | 47 0 | 27 | 11
0.00/0.03 c 0.0s | 0 | 10 | 1 | 47 0 | 27 | 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 = 10
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 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.03 c lower bound updated to 19
0.00/0.03 c BCD2: 19 <= obj <= 25
0.00/0.03 c BCD2: #cores=7, #unrelaxed=17, #relaxed=47, #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 | 47 0 | 28 | 11
0.00/0.03 c 0.0s | 0 | 8 | 0 | 47 0 | 28 | 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 = 8
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 <= 25
0.00/0.03 c BCD2: #cores=8, #unrelaxed=16, #relaxed=48, #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 | 47 0 | 28 | 12
0.00/0.03 c 0.0s | 0 | 19 | 1 | 47 0 | 29 | 12
0.00/0.03 c #cpu_time = 0.001s
0.00/0.03 c #wall_clock_time = 0.001s
0.00/0.03 c #decision = 19
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 21
0.00/0.03 c BCD2: 21 <= obj <= 25
0.00/0.03 c BCD2: #cores=9, #unrelaxed=15, #relaxed=49, #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 | 47 0 | 29 | 12
0.00/0.03 c 0.0s | 0 | 21 | 1 | 47 0 | 34 | 18
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 21
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 22
0.00/0.03 c BCD2: 22 <= obj <= 25
0.00/0.03 c BCD2: #cores=10, #unrelaxed=14, #relaxed=50, #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 | 47 0 | 34 | 18
0.00/0.03 c 0.0s | 0 | 21 | 6 | 47 0 | 34 | 18
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 = 21
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 6
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 0 and merging with 2 cores into a new core of size 16: cost of the new core is >=7
0.00/0.03 c lower bound updated to 23
0.00/0.03 c BCD2: 23 <= obj <= 25
0.00/0.03 c BCD2: #cores=9, #unrelaxed=14, #relaxed=50, #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 | 47 0 | 36 | 18
0.00/0.03 c 0.0s | 0 | 32 | 6 | 47 0 | 36 | 20
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 = 32
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 6
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 0 and merging with 2 cores into a new core of size 35: cost of the new core is >=15
0.00/0.03 c lower bound updated to 24
0.00/0.03 c BCD2: 24 <= obj <= 25
0.00/0.03 c BCD2: #cores=8, #unrelaxed=14, #relaxed=50, #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 | 47 0 | 38 | 20
0.00/0.03 c 0.0s | 0 | 22 | 6 | 47 0 | 44 | 27
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 = 22
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 6
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 0 and merging with 2 cores into a new core of size 44: cost of the new core is >=19
0.00/0.03 c lower bound updated to 25
0.00/0.03 c BCD2: hardening fixes 14 literals
0.00/0.03 c BCD2: 25 <= obj <= 25
0.00/0.03 c BCD2: #cores=7, #unrelaxed=0, #relaxed=50, #hardened=14
0.00/0.03 c BCD2: #sat=1 #unsat=26 bias=26/27
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 47 0 | 47 | 27
0.00/0.03 c 0.0s | 0 | 15 | 3 | 47 0 | 50 | 33
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 = 15
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: updating lower bound of a core
0.00/0.03 c lower bound updated to 26
0.00/0.03 s OPTIMUM FOUND
0.00/0.04 v -x1 x2 -x3 x4 -x5 -x6 -x7 x8 -x9 -x10
0.00/0.04 v x11 x12 x13 x14 -x15 -x16 -x17 -x18 -x19 -x20
0.00/0.04 v -x21 x22 x23 -x24 x25 -x26 -x27 x28 -x29 -x30
0.00/0.04 v -x31 x32 x33 -x34 -x35 -x36 x37 -x38 x39 x40
0.00/0.04 v x41 -x42 -x43 -x44 -x45 -x46 -x47 x48 x49 -x50
0.00/0.04 v x51 x52 x53 x54 -x55 -x56 -x57 -x58 x59 -x60
0.00/0.04 v x61 -x62 x63 -x64
0.00/0.04 c total CPU time = 0.038s
0.00/0.04 c total wall clock time = 0.038s
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-4117645-1467214587/watcher-4117645-1467214587 -o /tmp/evaluation-result-4117645-1467214587/solver-4117645-1467214587 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node119-1467209132-3987 --watchdog 1960 toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4117645-1467214587.opb
pid=4513
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.19 2.23 2.21 3/179 4516
/proc/meminfo: memFree=23512940/32872528 swapFree=1253612/1390560
[pid=4516] ppid=4513 vsize=776636 CPUtime=0 cores=0,2,4,6
/proc/4516/stat : 4516 (toysat) R 4513 4516 3971 0 -1 4202496 2907 0 0 0 0 0 0 0 20 0 4 0 2419554 795275264 2757 33554432000 4194304 16246674 140733359994016 140733359993440 13880264 0 2 0 34082818 18446744073709551615 0 0 17 2 0 0 0 0 0
/proc/4516/statm: 194927 2769 441 2943 0 191821 0
[pid=4516/tid=4517] ppid=4513 vsize=794044 CPUtime=0 cores=0,2,4,6
/proc/4516/task/4517/stat : 4517 (toysat) S 4513 4516 3971 0 -1 4202560 10 0 0 0 0 0 0 0 20 0 4 0 2419554 813101056 2828 33554432000 4194304 16246674 140733359994016 140253263277296 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 4 0 0 0 0 0
[pid=4516/tid=4518] ppid=4513 vsize=798140 CPUtime=0 cores=0,2,4,6
/proc/4516/task/4518/stat : 4518 (toysat) S 4513 4516 3971 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 2419554 817295360 2844 33554432000 4194304 16246674 140733359994016 140253252787440 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 0 0 0 0 0 0
[pid=4516/tid=4519] ppid=4513 vsize=803260 CPUtime=0 cores=0,2,4,6
/proc/4516/task/4519/stat : 4519 (toysat) S 4513 4516 3971 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 2419554 822538240 2862 33554432000 4194304 16246674 140733359994016 140253242313904 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 4516 sig 9
??? kill -4516 sig 9
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0433079
CPU time (s): 0.043992
CPU user time (s): 0.022996
CPU system time (s): 0.020996
CPU usage (%): 101.58
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.022996
system time used= 0.020996
maximum resident set size= 40716
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10351
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= 18
involuntary context switches= 1
??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.001999 second user time and 0.008998 second system time
The end