0.00/0.00 c 2016-06-29T23:55: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-4117879-1467237327.opb"]
0.00/0.01 c use --random-gen="68626806 1882761519 1955219225 3098072911 4008041544 2842261899 179476781 1636437941 3939695520 168473075 2920298655 1119853507 3321942221 663653414 1608458620 1671674130 1598054116 1038824435 340595539 95828287 3586523935 449343714 4208509635 2000061512 64964221 2804328105 713337080 3433408240 310509623 218757046 3432511038 59329026 1720411665 1642730897 2738776090 4108073910 3823680141 2098860684 3982825286 2215856772 3679541151 3922124799 755412777 26391844 2065156261 779853820 676225521 759282226 4219373002 1453760706 1029785787 2452775491 2673803337 2762621838 1006594125 1615127881 3521785588 151073180 3645423414 1115636763 4050486546 1332198106 450727547 1733133014 211322343 2061616836 199648127 3748078944 2048798366 59773402 2773142353 1056977671 2569197952 2526197148 3860765026 2096341194 3008102880 3161506919 2427356009 893286395 3304930808 1336753587 302133413 3381326110 1793452991 86789550 1536459903 3755395147 1171919559 3476170359 3701847879 70580911 2280028284 2878233551 3198477262 3871393931 2844810785 3572189145 2022083790 1483209906 440427321 1949882611 2826686719 3809061263 957377668 4230892604 4123521623 2685030237 3793696120 1233645025 4276397340 2974084956 580498226 1739605745 3003595019 3454689092 280355783 3686220486 991953961 2599561585 1189319720 3333545975 2528824133 625324587 784462757 2569601957 4222807777 478551204 3306444514 1799692290 4146170286 843704647 1404504774 2145052427 1086732255 967204760 3690188293 1116724053 278047578 428056780 1701449114 2675527134 3353696114 1861011980 3919831660 3044141311 2430445298 631731776 4130204982 4002612922 3756737189 691886980 1878411426 1021474948 2343051084 1839606949 1368815850 3365908719 2193989910 2204795112 2460399880 1514761382 1433391636 3310805379 4106813921 1211574174 3758120548 3469150192 3119901396 2834223648 4033194158 938566506 1162069248 1918642679 1318322092 780434293 2459886108 3881453171 1733080759 3322994824 1524474227 2738263738 1661388704 418773647 1992907797 4188376894 618558122 2797414432 3017269196 1694344647 173403181 2184547162 2179817435 3817232557 4049104040 491842857 3222261164 3416747612 1969499822 3451384998 1154144412 2183498059 393584096 458697100 1713255016 3287348287 962812423 366908619 357824829 825751019 4132705732 4010598385 250571919 4241460732 2472935563 987164303 3237826799 2435643265 4268562704 2060483767 2853104956 2974861937 3328649863 2188413252 1078725269 736548112 2491394421 1122729230 3831400885 2970748611 3668286874 3109450655 1127942058 2002561320 2440931347 2270724659 1553791789 431112261 618525530 80303059 130168385 4021581673 4006300142 2208951136 398655070 2137600713 115159569 1973195538 3872972727 3273772603 3935664332 3960054256 796141552 1446021699 3595900199 1967767787 255 362436" option to reproduce the execution
0.00/0.01 c #vars 100
0.00/0.01 c #constraints 58
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 | 66 0 | 14 | 0
0.00/0.02 c 0.0s | 0 | 14 | 6 | 66 0 | 14 | 0
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 = 14
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 6
0.00/0.02 c #restart = 0
0.00/0.02 o 45
0.00/0.02 c BCD2: updating upper bound: 100 -> 44
0.00/0.02 c BCD2: 0 <= obj <= 44
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 | 66 0 | 14 | 0
0.00/0.02 c 0.0s | 0 | 0 | 0 | 66 0 | 14 | 0
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 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 <= 44
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 | 66 0 | 14 | 0
0.00/0.02 c 0.0s | 0 | 1 | 0 | 66 0 | 14 | 0
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 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 <= 44
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 | 66 0 | 14 | 0
0.00/0.02 c 0.0s | 0 | 3 | 0 | 66 0 | 14 | 0
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 3
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 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 3
0.00/0.02 c BCD2: 3 <= obj <= 44
0.00/0.02 c BCD2: #cores=3, #unrelaxed=96, #relaxed=4, #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 | 66 0 | 14 | 0
0.00/0.02 c 0.0s | 0 | 4 | 1 | 66 0 | 14 | 0
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 4
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.02 c lower bound updated to 4
0.00/0.02 c BCD2: 4 <= obj <= 44
0.00/0.02 c BCD2: #cores=3, #unrelaxed=95, #relaxed=5, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=5 bias=5/6
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 66 0 | 15 | 0
0.00/0.02 c 0.0s | 0 | 4 | 1 | 66 0 | 15 | 1
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 4
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 4: cost of the new core is >=3
0.00/0.02 c lower bound updated to 5
0.00/0.02 c BCD2: 5 <= obj <= 44
0.00/0.02 c BCD2: #cores=3, #unrelaxed=94, #relaxed=6, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=6 bias=6/7
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 66 0 | 16 | 1
0.00/0.02 c 0.0s | 0 | 4 | 1 | 66 0 | 16 | 2
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 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 1 and merging with 1 cores into a new core of size 5: cost of the new core is >=4
0.00/0.02 c lower bound updated to 6
0.00/0.02 c BCD2: 6 <= obj <= 44
0.00/0.02 c BCD2: #cores=3, #unrelaxed=93, #relaxed=7, #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 | 66 0 | 17 | 3
0.00/0.02 c 0.0s | 0 | 3 | 0 | 66 0 | 17 | 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 = 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 7
0.00/0.02 c BCD2: 7 <= obj <= 44
0.00/0.02 c BCD2: #cores=4, #unrelaxed=92, #relaxed=8, #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 | 66 0 | 17 | 4
0.00/0.02 c 0.0s | 0 | 4 | 0 | 66 0 | 17 | 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 = 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 <= 44
0.00/0.02 c BCD2: #cores=5, #unrelaxed=91, #relaxed=9, #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 | 66 0 | 17 | 4
0.00/0.02 c 0.0s | 0 | 10 | 0 | 66 0 | 17 | 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 = 10
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 6: 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 <= 44
0.00/0.02 c BCD2: #cores=6, #unrelaxed=85, #relaxed=15, #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 | 66 0 | 17 | 4
0.00/0.02 c 0.0s | 0 | 15 | 2 | 66 0 | 17 | 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 = 15
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 2
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 5 and merging with 1 cores into a new core of size 11: cost of the new core is >=2
0.00/0.02 c lower bound updated to 10
0.00/0.02 c BCD2: 10 <= obj <= 44
0.00/0.02 c BCD2: #cores=6, #unrelaxed=80, #relaxed=20, #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 | 66 0 | 18 | 4
0.00/0.02 c 0.0s | 0 | 14 | 1 | 66 0 | 18 | 5
0.00/0.02 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 11
0.00/0.03 c BCD2: 11 <= obj <= 44
0.00/0.03 c BCD2: #cores=7, #unrelaxed=78, #relaxed=22, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=12 bias=12/13
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 66 0 | 18 | 5
0.00/0.03 c 0.0s | 0 | 16 | 1 | 66 0 | 18 | 5
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 16
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 5 and merging with 1 cores into a new core of size 7: cost of the new core is >=2
0.00/0.03 c lower bound updated to 12
0.00/0.03 c BCD2: 12 <= obj <= 44
0.00/0.03 c BCD2: #cores=7, #unrelaxed=73, #relaxed=27, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=13 bias=13/14
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 66 0 | 19 | 5
0.00/0.03 c 0.0s | 0 | 18 | 1 | 66 0 | 19 | 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 = 18
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.03 c lower bound updated to 13
0.00/0.03 c BCD2: 13 <= obj <= 44
0.00/0.03 c BCD2: #cores=8, #unrelaxed=70, #relaxed=30, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=14 bias=14/15
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 66 0 | 19 | 6
0.00/0.03 c 0.0s | 0 | 19 | 1 | 66 0 | 19 | 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 = 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: relaxing 3 and merging with 1 cores into a new core of size 6: cost of the new core is >=2
0.00/0.03 c lower bound updated to 14
0.00/0.03 c BCD2: 14 <= obj <= 44
0.00/0.03 c BCD2: #cores=8, #unrelaxed=67, #relaxed=33, #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 | 66 0 | 20 | 6
0.00/0.03 c 0.0s | 0 | 18 | 1 | 66 0 | 20 | 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 = 18
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 9: cost of the new core is >=1
0.00/0.03 c lower bound updated to 15
0.00/0.03 c BCD2: 15 <= obj <= 44
0.00/0.03 c BCD2: #cores=9, #unrelaxed=58, #relaxed=42, #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 | 66 0 | 20 | 7
0.00/0.03 c 0.0s | 0 | 19 | 1 | 66 0 | 20 | 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 = 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 3: cost of the new core is >=1
0.00/0.03 c lower bound updated to 16
0.00/0.03 c BCD2: 16 <= obj <= 44
0.00/0.03 c BCD2: #cores=10, #unrelaxed=55, #relaxed=45, #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 | 66 0 | 20 | 7
0.00/0.03 c 0.0s | 0 | 17 | 1 | 66 0 | 20 | 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: relaxing 6 and merging with 2 cores into a new core of size 15: cost of the new core is >=4
0.00/0.03 c lower bound updated to 17
0.00/0.03 c BCD2: 17 <= obj <= 44
0.00/0.03 c BCD2: #cores=9, #unrelaxed=49, #relaxed=51, #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 | 66 0 | 22 | 7
0.00/0.03 c 0.0s | 0 | 20 | 0 | 66 0 | 22 | 9
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 = 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 <= 44
0.00/0.03 c BCD2: #cores=10, #unrelaxed=41, #relaxed=59, #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 | 66 0 | 22 | 9
0.00/0.03 c 0.0s | 0 | 25 | 1 | 66 0 | 22 | 9
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 = 25
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 10: 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 <= 44
0.00/0.03 c BCD2: #cores=10, #unrelaxed=39, #relaxed=61, #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 | 66 0 | 23 | 9
0.00/0.03 c 0.0s | 0 | 21 | 0 | 66 0 | 23 | 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 = 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 3: 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 <= 44
0.00/0.03 c BCD2: #cores=11, #unrelaxed=36, #relaxed=64, #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 | 66 0 | 23 | 10
0.00/0.03 c 0.0s | 0 | 22 | 1 | 66 0 | 23 | 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 = 22
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 10 and merging with 2 cores into a new core of size 20: cost of the new core is >=4
0.00/0.03 c lower bound updated to 21
0.00/0.03 c BCD2: 21 <= obj <= 44
0.00/0.03 c BCD2: #cores=10, #unrelaxed=26, #relaxed=74, #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 | 66 0 | 25 | 10
0.00/0.03 c 0.0s | 0 | 23 | 1 | 66 0 | 28 | 14
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 = 23
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 <= 44
0.00/0.03 c BCD2: #cores=11, #unrelaxed=25, #relaxed=75, #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 | 66 0 | 28 | 14
0.00/0.04 c 0.0s | 0 | 16 | 0 | 66 0 | 28 | 14
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 16
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 5: cost of the new core is >=1
0.00/0.04 c lower bound updated to 23
0.00/0.04 c BCD2: 23 <= obj <= 44
0.00/0.04 c BCD2: #cores=12, #unrelaxed=20, #relaxed=80, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=24 bias=24/25
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 66 0 | 28 | 14
0.00/0.04 c 0.0s | 0 | 16 | 0 | 66 0 | 28 | 14
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 16
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 24
0.00/0.04 c BCD2: 24 <= obj <= 44
0.00/0.04 c BCD2: #cores=13, #unrelaxed=19, #relaxed=81, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=25 bias=25/26
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 66 0 | 28 | 14
0.00/0.04 c 0.0s | 0 | 19 | 1 | 66 0 | 28 | 14
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 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: relaxing 4 and merging with 1 cores into a new core of size 9: cost of the new core is >=2
0.00/0.04 c lower bound updated to 25
0.00/0.04 c BCD2: 25 <= obj <= 44
0.00/0.04 c BCD2: #cores=13, #unrelaxed=15, #relaxed=85, #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 | 66 0 | 29 | 14
0.00/0.04 c 0.0s | 0 | 16 | 1 | 66 0 | 29 | 15
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 16
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 11: cost of the new core is >=3
0.00/0.04 c lower bound updated to 26
0.00/0.04 c BCD2: 26 <= obj <= 44
0.00/0.04 c BCD2: #cores=13, #unrelaxed=13, #relaxed=87, #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 | 66 0 | 30 | 15
0.00/0.04 c 0.0s | 0 | 16 | 1 | 66 0 | 30 | 16
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 16
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 13: cost of the new core is >=4
0.00/0.04 c lower bound updated to 27
0.00/0.04 c BCD2: 27 <= obj <= 44
0.00/0.04 c BCD2: #cores=13, #unrelaxed=11, #relaxed=89, #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 | 66 0 | 31 | 16
0.00/0.04 c 0.0s | 0 | 31 | 12 | 66 0 | 31 | 17
0.00/0.04 c #cpu_time = 0.001s
0.00/0.04 c #wall_clock_time = 0.001s
0.00/0.04 c #decision = 31
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 12
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 0 and merging with 4 cores into a new core of size 56: cost of the new core is >=14
0.00/0.04 c lower bound updated to 29
0.00/0.04 c BCD2: 29 <= obj <= 44
0.00/0.04 c BCD2: #cores=10, #unrelaxed=11, #relaxed=89, #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 | 66 0 | 35 | 17
0.00/0.04 c 0.0s | 0 | 36 | 17 | 66 0 | 36 | 21
0.00/0.04 c #cpu_time = 0.002s
0.00/0.04 c #wall_clock_time = 0.002s
0.00/0.04 c #decision = 36
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 17
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 0 and merging with 3 cores into a new core of size 78: cost of the new core is >=22
0.00/0.04 c lower bound updated to 32
0.00/0.04 c BCD2: 32 <= obj <= 44
0.00/0.04 c BCD2: #cores=8, #unrelaxed=11, #relaxed=89, #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 | 66 0 | 39 | 21
0.00/0.05 c 0.0s | 0 | 20 | 10 | 66 0 | 41 | 25
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 = 20
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 10
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: updating lower bound of a core
0.00/0.05 c lower bound updated to 33
0.00/0.05 c BCD2: 33 <= obj <= 44
0.00/0.05 c BCD2: #cores=8, #unrelaxed=11, #relaxed=89, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=31 bias=31/32
0.00/0.05 c Solving starts ...
0.00/0.05 c lower bound updated to 45
0.00/0.05 s OPTIMUM FOUND
0.00/0.05 v -x1 -x2 -x3 x4 x5 x6 x7 x8 -x9 -x10
0.00/0.05 v x11 -x12 x13 x14 -x15 -x16 -x17 -x18 x19 x20
0.00/0.05 v -x21 -x22 -x23 -x24 x25 -x26 -x27 x28 x29 -x30
0.00/0.05 v -x31 x32 x33 -x34 x35 -x36 -x37 -x38 -x39 -x40
0.00/0.05 v -x41 x42 -x43 x44 -x45 -x46 x47 -x48 x49 -x50
0.00/0.05 v -x51 -x52 x53 x54 x55 x56 x57 x58 x59 -x60
0.00/0.05 v x61 x62 -x63 x64 -x65 -x66 -x67 x68 x69 -x70
0.00/0.05 v x71 -x72 -x73 -x74 -x75 x76 -x77 x78 -x79 -x80
0.00/0.05 v -x81 x82 -x83 -x84 -x85 -x86 -x87 x88 -x89 x90
0.00/0.05 v x91 -x92 -x93 x94 x95 x96 x97 -x98 x99 x100
0.00/0.05 c total CPU time = 0.047s
0.00/0.05 c total wall clock time = 0.047s
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-4117879-1467237327/watcher-4117879-1467237327 -o /tmp/evaluation-result-4117879-1467237327/solver-4117879-1467237327 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node117-1467210309-2001 --watchdog 1960 toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4117879-1467237327.opb
pid=4621
running on 4 cores: 1,3,5,7
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.35 2.27 2.26 3/179 4624
/proc/meminfo: memFree=27526632/32872528 swapFree=1553660/1717180
[pid=4624] ppid=4621 vsize=300476 CPUtime=0 cores=1,3,5,7
/proc/4624/stat : 4624 (toysat) R 4621 4624 1984 0 -1 4202496 1044 0 0 0 0 0 0 0 20 0 4 0 2760351 307687424 1405 33554432000 4194304 16246674 140735979818896 140735979818320 13880264 0 2 0 34082818 18446744073709551615 0 0 17 3 0 0 0 0 0
/proc/4624/statm: 75631 1415 441 2943 0 72525 0
[pid=4624/tid=4625] ppid=4621 vsize=315836 CPUtime=0 cores=1,3,5,7
/proc/4624/task/4625/stat : 4625 (toysat) S 4621 4624 1984 0 -1 4202560 9 0 0 0 0 0 0 0 20 0 4 0 2760352 323416064 1468 33554432000 4194304 16246674 140735979818896 140113227001072 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 5 0 0 0 0 0
[pid=4624/tid=4626] ppid=4621 vsize=319932 CPUtime=0 cores=1,3,5,7
/proc/4624/task/4626/stat : 4626 (toysat) S 4621 4624 1984 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 2760352 327610368 1484 33554432000 4194304 16246674 140735979818896 140113216511216 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 1 0 0 0 0 0
[pid=4624/tid=4627] ppid=4621 vsize=324028 CPUtime=0 cores=1,3,5,7
/proc/4624/task/4627/stat : 4627 (toysat) S 4621 4624 1984 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 2760352 331804672 1500 33554432000 4194304 16246674 140735979818896 140113206037680 14069300 0 0 0 34082818 18446744071579510697 0 0 -1 5 0 0 0 0 0
Solver just ended.
??? exit watcher main loop
??? sigkill at end of watcher main loop
??? kill 4624 sig 9
??? kill -4624 sig 9
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.055798
CPU time (s): 0.051992
CPU user time (s): 0.025996
CPU system time (s): 0.025996
CPU usage (%): 93.179
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.025996
system time used= 0.025996
maximum resident set size= 50456
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 12276
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= 2
??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.006998 second user time and 0.001999 second system time
The end