0.00/0.00 c 2016-06-18T08:01:04+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-4102169-1466229664.opb"]
0.00/0.01 c use --random-gen="4281835754 1866271639 2054371498 3298631507 2763775118 1924848581 2968238994 700872822 4021600519 2507793595 1536791530 2921177189 4064862837 1307483634 1428991934 4275837926 4281371131 3176771157 3549800512 3929187679 3426454824 921240641 1650533932 3443861911 3571501710 3670345545 106911650 61551956 107948690 4156303955 2527512285 107689424 3250517747 3801697226 661797546 3273062062 812447684 1360300861 2546450018 1345902194 3669440647 2426995754 1745588230 2953250121 3575037615 3777614513 3180221665 3188858913 1431904264 4141279062 1214831688 2867016854 1675653416 4265994803 1143611536 4287969082 692886301 3873108672 1683274413 673100830 4233221225 1214214530 248470627 1842769525 2530476721 1530200437 2286240569 1515675232 805284658 2846898499 2554136322 3958963323 3884377140 1382571636 3793209558 1846479171 2593589027 1602753502 1119003144 3538015034 563423327 2751376238 895316698 347706925 3866246250 1820287466 3295289731 3632283077 635079597 4079606346 4190605615 542888238 3555934194 261086847 3591837529 2167479617 1618052985 2427668469 3230228879 1509319697 1264937903 427422911 927576840 1992040005 2396771646 1823385102 3620990136 1029921767 797813893 3049779649 1689763324 1662297239 1050973446 3465284182 39262712 3336850029 3382684766 708201436 1148901921 1036174100 335367232 2591565936 774448106 3530493468 3462027312 2263558019 1252997039 1977202380 94843872 4263267667 2574292591 137372502 1744263766 2697935014 552334821 9553058 421849525 1954425321 3215189100 1005265887 2616638581 1886171061 909634477 2290244747 523555798 3019959552 1959889416 1129172407 533324350 898485266 2740994219 86758889 1084148475 3291234673 2518621378 2143577771 3078649960 1802250463 3613082163 1299815084 2137527809 3155334119 2102586116 1021475006 2935556219 1514726459 3208612256 3747781253 1507204995 938397331 3633562947 3905245754 3325744520 3782427848 3146563119 3519594295 3666036165 2648290624 1845766653 4038946369 3911679342 2909893782 999693515 3736131755 1036240533 70279783 1368606023 1527848609 1958675220 3012345450 2731132957 320207548 2567232363 2414909240 1076399819 2220411460 3620410576 1163202074 558556641 4273301726 971424420 1023517423 135233478 3526886595 568333342 2988769621 1040352964 2084734569 3395966479 3700820082 3087403244 1947281210 217947631 2033578236 2144008920 1094047052 3179374493 3618254218 2118973825 4061916120 1089839094 38639913 867478129 380392946 1955141330 813708219 2223181188 2649903234 3484962296 1401010938 229729256 2631743309 580732810 14278296 304829071 3073935630 3723112408 62966018 745639594 3077360377 4152023708 197266481 719517643 3235604516 2027012428 1722088176 2096391844 1778149388 2186255076 3138760236 717353882 542012741 1542161251 367091821 1348063723 326728106 255 362436" option to reproduce the execution
0.00/0.01 c #vars 100
0.00/0.01 c #constraints 350
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 | 150 0 | 0 | 0
0.00/0.02 c 0.0s | 0 | 13 | 10 | 150 0 | 0 | 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 = 13
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 10
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 | 150 0 | 0 | 0
0.00/0.02 c 0.0s | 0 | 4 | 3 | 150 0 | 0 | 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 = 4
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 3
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.02 c lower bound updated to 1
0.00/0.02 c BCD2: 1 <= obj <= 49
0.00/0.02 c BCD2: #cores=1, #unrelaxed=98, #relaxed=2, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=2 bias=2/3
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 150 0 | 0 | 0
0.00/0.02 c 0.0s | 0 | 4 | 1 | 150 0 | 0 | 0
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 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 5: cost of the new core is >=2
0.00/0.02 c lower bound updated to 2
0.00/0.02 c BCD2: 2 <= obj <= 49
0.00/0.02 c BCD2: #cores=1, #unrelaxed=95, #relaxed=5, #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 | 150 0 | 1 | 0
0.00/0.02 c 0.0s | 0 | 4 | 1 | 150 0 | 1 | 1
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 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 8: cost of the new core is >=3
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=1, #unrelaxed=92, #relaxed=8, #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 | 150 0 | 2 | 1
0.00/0.02 c 0.0s | 0 | 12 | 3 | 150 0 | 2 | 2
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 = 12
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 3
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 5: 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=2, #unrelaxed=87, #relaxed=13, #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 | 150 0 | 2 | 2
0.00/0.03 c 0.0s | 0 | 8 | 2 | 150 0 | 2 | 2
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 8
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 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 5
0.00/0.03 c BCD2: 5 <= obj <= 49
0.00/0.03 c BCD2: #cores=2, #unrelaxed=84, #relaxed=16, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=6 bias=6/7
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 150 0 | 3 | 2
0.00/0.03 c 0.0s | 0 | 9 | 2 | 150 0 | 3 | 3
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 9
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.03 c lower bound updated to 6
0.00/0.03 c BCD2: 6 <= obj <= 49
0.00/0.03 c BCD2: #cores=3, #unrelaxed=81, #relaxed=19, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=7 bias=7/8
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 150 0 | 3 | 3
0.00/0.03 c 0.0s | 0 | 7 | 0 | 150 0 | 3 | 3
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 7
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: relaxing 2 and merging with 1 cores into a new core of size 5: cost of the new core is >=2
0.00/0.03 c lower bound updated to 7
0.00/0.03 c BCD2: 7 <= obj <= 49
0.00/0.03 c BCD2: #cores=3, #unrelaxed=79, #relaxed=21, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=8 bias=8/9
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 150 0 | 4 | 3
0.00/0.03 c 0.0s | 0 | 8 | 3 | 150 0 | 4 | 4
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 = 8
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 3
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 10: cost of the new core is >=4
0.00/0.03 c lower bound updated to 8
0.00/0.03 c BCD2: 8 <= obj <= 49
0.00/0.03 c BCD2: #cores=3, #unrelaxed=77, #relaxed=23, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=9 bias=9/10
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 150 0 | 5 | 4
0.00/0.03 c 0.0s | 0 | 7 | 2 | 150 0 | 5 | 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 = 7
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 9
0.00/0.03 c BCD2: 9 <= obj <= 49
0.00/0.03 c BCD2: #cores=4, #unrelaxed=75, #relaxed=25, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=10 bias=10/11
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 150 0 | 5 | 5
0.00/0.03 c 0.0s | 0 | 8 | 1 | 150 0 | 5 | 5
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 = 8
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 4 and merging with 1 cores into a new core of size 14: cost of the new core is >=5
0.00/0.03 c lower bound updated to 10
0.00/0.03 c BCD2: 10 <= obj <= 49
0.00/0.03 c BCD2: #cores=4, #unrelaxed=71, #relaxed=29, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=11 bias=11/12
0.00/0.03 c Solving starts ...
0.00/0.03 c ============================[ Search Statistics ]============================
0.00/0.03 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.03 c | | | | Limit GC | Var | Constra
0.00/0.03 c =============================================================================
0.00/0.03 c 0.0s | 0 | 0 | 0 | 150 0 | 6 | 5
0.00/0.03 c 0.0s | 0 | 12 | 2 | 150 0 | 6 | 6
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 = 12
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 6: 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 <= 49
0.00/0.03 c BCD2: #cores=5, #unrelaxed=65, #relaxed=35, #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 | 150 0 | 6 | 6
0.00/0.03 c 0.0s | 0 | 14 | 3 | 150 0 | 6 | 6
0.00/0.03 c #cpu_time = 0.001s
0.00/0.03 c #wall_clock_time = 0.001s
0.00/0.03 c #decision = 14
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 3
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.03 c lower bound updated to 12
0.00/0.03 c BCD2: 12 <= obj <= 49
0.00/0.03 c BCD2: #cores=5, #unrelaxed=63, #relaxed=37, #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 | 150 0 | 7 | 6
0.00/0.03 c 0.0s | 0 | 15 | 1 | 150 0 | 7 | 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 = 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 3 and merging with 1 cores into a new core of size 8: cost of the new core is >=3
0.00/0.03 c lower bound updated to 13
0.00/0.03 c BCD2: 13 <= obj <= 49
0.00/0.03 c BCD2: #cores=5, #unrelaxed=60, #relaxed=40, #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 | 150 0 | 8 | 7
0.00/0.03 c 0.0s | 0 | 11 | 3 | 150 0 | 8 | 8
0.00/0.03 c #cpu_time = 0.001s
0.00/0.03 c #wall_clock_time = 0.001s
0.00/0.03 c #decision = 11
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 3
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 4 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 14
0.00/0.03 c BCD2: 14 <= obj <= 49
0.00/0.03 c BCD2: #cores=5, #unrelaxed=56, #relaxed=44, #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 | 150 0 | 9 | 8
0.00/0.03 c 0.0s | 0 | 14 | 2 | 150 0 | 9 | 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 = 14
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 15
0.00/0.04 c BCD2: 15 <= obj <= 49
0.00/0.04 c BCD2: #cores=6, #unrelaxed=54, #relaxed=46, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=16 bias=16/17
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 150 0 | 9 | 9
0.00/0.04 c 0.0s | 0 | 14 | 2 | 150 0 | 9 | 9
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 = 14
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 2
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.04 c lower bound updated to 16
0.00/0.04 c BCD2: 16 <= obj <= 49
0.00/0.04 c BCD2: #cores=7, #unrelaxed=51, #relaxed=49, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=17 bias=17/18
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 | 150 0 | 9 | 9
0.00/0.04 c 0.0s | 0 | 11 | 3 | 150 0 | 9 | 9
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 = 11
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 3
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 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 17
0.00/0.04 c BCD2: 17 <= obj <= 49
0.00/0.04 c BCD2: #cores=7, #unrelaxed=49, #relaxed=51, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=18 bias=18/19
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 150 0 | 10 | 9
0.00/0.04 c 0.0s | 0 | 13 | 1 | 150 0 | 10 | 10
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 13
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.04 c lower bound updated to 18
0.00/0.04 c BCD2: 18 <= obj <= 49
0.00/0.04 c BCD2: #cores=8, #unrelaxed=47, #relaxed=53, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=19 bias=19/20
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 150 0 | 10 | 11
0.00/0.04 c 0.0s | 0 | 17 | 3 | 150 0 | 10 | 11
0.00/0.04 c #cpu_time = 0.001s
0.00/0.04 c #wall_clock_time = 0.001s
0.00/0.04 c #decision = 17
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 3
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.04 c lower bound updated to 19
0.00/0.04 c BCD2: 19 <= obj <= 49
0.00/0.04 c BCD2: #cores=9, #unrelaxed=44, #relaxed=56, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=20 bias=20/21
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 150 0 | 10 | 11
0.00/0.04 c 0.0s | 0 | 17 | 4 | 150 0 | 10 | 11
0.00/0.04 c #cpu_time = 0.001s
0.00/0.04 c #wall_clock_time = 0.001s
0.00/0.04 c #decision = 17
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 4
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 4 and merging with 2 cores into a new core of size 15: cost of the new core is >=4
0.00/0.04 c lower bound updated to 20
0.00/0.04 c BCD2: 20 <= obj <= 49
0.00/0.04 c BCD2: #cores=8, #unrelaxed=40, #relaxed=60, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=21 bias=21/22
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 150 0 | 12 | 11
0.00/0.04 c 0.0s | 0 | 16 | 2 | 150 0 | 12 | 13
0.00/0.04 c #cpu_time = 0.001s
0.00/0.04 c #wall_clock_time = 0.001s
0.00/0.04 c #decision = 16
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 2
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.04 c lower bound updated to 21
0.00/0.04 c BCD2: 21 <= obj <= 49
0.00/0.04 c BCD2: #cores=9, #unrelaxed=36, #relaxed=64, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=22 bias=22/23
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 150 0 | 12 | 13
0.00/0.04 c 0.0s | 0 | 18 | 3 | 150 0 | 12 | 13
0.00/0.04 c #cpu_time = 0.001s
0.00/0.04 c #wall_clock_time = 0.001s
0.00/0.04 c #decision = 18
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 3
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 5 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 22
0.00/0.04 c BCD2: 22 <= obj <= 49
0.00/0.04 c BCD2: #cores=9, #unrelaxed=31, #relaxed=69, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=23 bias=23/24
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 150 0 | 13 | 13
0.00/0.04 c 0.0s | 0 | 13 | 1 | 150 0 | 13 | 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 = 13
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.04 c lower bound updated to 23
0.00/0.04 c BCD2: 23 <= obj <= 49
0.00/0.04 c BCD2: #cores=10, #unrelaxed=27, #relaxed=73, #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 | 150 0 | 13 | 14
0.00/0.04 c 0.0s | 0 | 19 | 3 | 150 0 | 13 | 14
0.00/0.04 c #cpu_time = 0.001s
0.00/0.04 c #wall_clock_time = 0.001s
0.00/0.04 c #decision = 19
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 3
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.04 c lower bound updated to 24
0.00/0.04 c BCD2: 24 <= obj <= 49
0.00/0.04 c BCD2: #cores=11, #unrelaxed=25, #relaxed=75, #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 | 150 0 | 13 | 14
0.00/0.05 c 0.0s | 0 | 16 | 1 | 150 0 | 13 | 14
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 = 16
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 5 and merging with 1 cores into a new core of size 7: cost of the new core is >=2
0.00/0.05 c lower bound updated to 25
0.00/0.05 c BCD2: 25 <= obj <= 49
0.00/0.05 c BCD2: #cores=11, #unrelaxed=20, #relaxed=80, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=26 bias=26/27
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 | 150 0 | 14 | 14
0.00/0.05 c 0.0s | 0 | 16 | 1 | 150 0 | 14 | 15
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 = 16
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 1
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.05 c lower bound updated to 26
0.00/0.05 c BCD2: 26 <= obj <= 49
0.00/0.05 c BCD2: #cores=12, #unrelaxed=17, #relaxed=83, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=27 bias=27/28
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 | 150 0 | 14 | 15
0.00/0.05 c 0.0s | 0 | 16 | 3 | 150 0 | 14 | 15
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 = 16
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 3
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: relaxing 1 and merging with 4 cores into a new core of size 25: cost of the new core is >=8
0.00/0.05 c lower bound updated to 27
0.00/0.05 c BCD2: 27 <= obj <= 49
0.00/0.05 c BCD2: #cores=9, #unrelaxed=16, #relaxed=84, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=28 bias=28/29
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 150 0 | 18 | 15
0.00/0.05 c 0.0s | 0 | 14 | 1 | 150 0 | 18 | 19
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 = 14
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 1
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.05 c lower bound updated to 28
0.00/0.05 c BCD2: 28 <= obj <= 49
0.00/0.05 c BCD2: #cores=10, #unrelaxed=12, #relaxed=88, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=29 bias=29/30
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 150 0 | 18 | 19
0.00/0.05 c 0.0s | 0 | 14 | 1 | 150 0 | 18 | 19
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 = 14
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 1
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.05 c lower bound updated to 29
0.00/0.05 c BCD2: 29 <= obj <= 49
0.00/0.05 c BCD2: #cores=11, #unrelaxed=10, #relaxed=90, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=30 bias=30/31
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 150 0 | 18 | 20
0.00/0.05 c 0.0s | 0 | 16 | 2 | 150 0 | 18 | 20
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 = 16
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 2
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: relaxing 3 and merging with 1 cores into a new core of size 7: cost of the new core is >=2
0.00/0.05 c lower bound updated to 30
0.00/0.05 c BCD2: 30 <= obj <= 49
0.00/0.05 c BCD2: #cores=11, #unrelaxed=7, #relaxed=93, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=31 bias=31/32
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 150 0 | 19 | 20
0.00/0.05 c 0.0s | 0 | 26 | 2 | 150 0 | 21 | 32
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 = 26
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 2
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.05 c lower bound updated to 31
0.00/0.05 c BCD2: 31 <= obj <= 49
0.00/0.05 c BCD2: #cores=12, #unrelaxed=5, #relaxed=95, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=32 bias=32/33
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 150 0 | 21 | 33
0.00/0.05 c 0.0s | 0 | 15 | 2 | 150 0 | 21 | 33
0.00/0.05 c #cpu_time = 0.000s
0.00/0.05 c #wall_clock_time = 0.000s
0.00/0.05 c #decision = 15
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 2
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.05 c lower bound updated to 32
0.00/0.05 c BCD2: 32 <= obj <= 49
0.00/0.05 c BCD2: #cores=13, #unrelaxed=3, #relaxed=97, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=33 bias=33/34
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 150 0 | 21 | 34
0.00/0.05 c 0.0s | 0 | 18 | 3 | 150 0 | 21 | 34
0.00/0.05 c #cpu_time = 0.001s
0.00/0.05 c #wall_clock_time = 0.001s
0.00/0.05 c #decision = 18
0.00/0.05 c #random_decision = 0
0.00/0.05 c #conflict = 3
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: relaxing 3 and merging with 1 cores into a new core of size 12: cost of the new core is >=3
0.00/0.05 c lower bound updated to 33
0.00/0.05 c BCD2: 33 <= obj <= 49
0.00/0.05 c BCD2: #cores=13, #unrelaxed=0, #relaxed=100, #hardened=0
0.00/0.05 c BCD2: #sat=1 #unsat=34 bias=34/35
0.00/0.05 c Solving starts ...
0.00/0.05 c ============================[ Search Statistics ]============================
0.00/0.05 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.05 c | | | | Limit GC | Var | Constra
0.00/0.05 c =============================================================================
0.00/0.05 c 0.0s | 0 | 0 | 0 | 150 0 | 22 | 34
0.00/0.06 c 0.0s | 0 | 25 | 6 | 150 0 | 28 | 68
0.00/0.06 c #cpu_time = 0.001s
0.00/0.06 c #wall_clock_time = 0.001s
0.00/0.06 c #decision = 25
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 6
0.00/0.06 c #restart = 0
0.00/0.06 c BCD2: relaxing 0 and merging with 2 cores into a new core of size 7: cost of the new core is >=3
0.00/0.06 c lower bound updated to 34
0.00/0.06 c BCD2: 34 <= obj <= 49
0.00/0.06 c BCD2: #cores=12, #unrelaxed=0, #relaxed=100, #hardened=0
0.00/0.06 c BCD2: #sat=1 #unsat=35 bias=35/36
0.00/0.06 c Solving starts ...
0.00/0.06 c ============================[ Search Statistics ]============================
0.00/0.06 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.06 c | | | | Limit GC | Var | Constra
0.00/0.06 c =============================================================================
0.00/0.06 c 0.0s | 0 | 0 | 0 | 150 0 | 30 | 68
0.00/0.06 c 0.0s | 0 | 13 | 3 | 150 0 | 127 | 70
0.00/0.06 c #cpu_time = 0.001s
0.00/0.06 c #wall_clock_time = 0.001s
0.00/0.06 c #decision = 13
0.00/0.06 c #random_decision = 0
0.00/0.06 c #conflict = 3
0.00/0.06 c #restart = 0
0.00/0.06 c 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-4102169-1466229664/watcher-4102169-1466229664 -o /tmp/evaluation-result-4102169-1466229664/solver-4102169-1466229664 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node136-1466206055-16206 --watchdog 1960 toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4102169-1466229664.opb
pid=20315
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.33 2.26 2.20 3/180 20318
/proc/meminfo: memFree=25982420/32872528 swapFree=1459628/1655852
[pid=20318] ppid=20315 vsize=447932 CPUtime=0 cores=1,3,5,7
/proc/20318/stat : 20318 (toysat) R 20315 20318 16189 0 -1 4202496 1622 0 0 0 0 0 0 0 20 0 4 0 25011960 458682368 2494 33554432000 4194304 16246674 140733797918160 140733797917584 13880264 0 2 0 34082818 18446744073709551615 0 0 17 3 0 0 0 0 0
/proc/20318/statm: 112495 2502 441 2943 0 109389 0
[pid=20318/tid=20319] ppid=20315 vsize=465340 CPUtime=0 cores=1,3,5,7
/proc/20318/task/20319/stat : 20319 (toysat) S 20315 20318 16189 0 -1 4202560 9 0 0 0 0 0 0 0 20 0 4 0 25011960 476508160 2560 33554432000 4194304 16246674 140733797918160 139737759198448 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 5 0 0 0 0 0
[pid=20318/tid=20320] ppid=20315 vsize=469436 CPUtime=0 cores=1,3,5,7
/proc/20318/task/20320/stat : 20320 (toysat) S 20315 20318 16189 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 25011960 480702464 2577 33554432000 4194304 16246674 140733797918160 139737748708592 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 1 0 0 0 0 0
[pid=20318/tid=20321] ppid=20315 vsize=473532 CPUtime=0 cores=1,3,5,7
/proc/20318/task/20321/stat : 20321 (toysat) S 20315 20318 16189 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 25011960 484896768 2593 33554432000 4194304 16246674 140733797918160 139737633385648 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 20318 sig 9
??? kill -20318 sig 9
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0668039
CPU time (s): 0.062989
CPU user time (s): 0.026995
CPU system time (s): 0.035994
CPU usage (%): 94.2893
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.026995
system time used= 0.035994
maximum resident set size= 63136
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 14935
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= 2
??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.006998 second user time and 0.003999 second system time
The end