0.00/0.00 c 2016-06-29T17:46:19+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-4117717-1467215179.opb"]
0.00/0.01 c use --random-gen="3433975763 515923612 3203664480 2412629743 2360699809 350563269 1356591894 1852189799 3230424686 2875302866 2159580496 2229311943 797877121 466987784 1318330457 958914843 1650056599 3511600488 2411602480 1495193058 2118551986 712514261 3680446245 3640268681 554640417 1400281555 811633168 4127922229 418322732 3775693646 2714964254 3759907658 997018481 3745571597 1189855995 1039027698 1352815797 2524333510 2926392526 417895910 977080638 258762755 421274981 403211919 3688527215 1385597794 942162173 1844669133 2341230152 2219934352 3979999773 3627791572 3645562934 3735878646 2368130826 3363446997 1134653691 4229167361 2647886705 2933598641 904569928 612428636 972749588 2820820199 3646380371 1123062407 3529152061 942537257 2562914316 2542975874 214990891 2739200401 1203295631 1799727492 975808688 2869027107 431156897 988572295 203812787 545656768 1610580172 1720622608 1538250783 3550778176 3423558635 2950759525 3738289579 4213815105 2485783661 1099958648 1772984149 1704457479 4072986999 1233657757 494539177 3249998879 4221380274 2443808662 3736628692 3511025437 2070129948 2313340799 186585008 3870957976 1008518469 449208153 2378800444 2156614053 3020166855 2547265054 3878550123 737015738 1526983753 2469248439 2116826063 674902937 364495483 2322770547 3531224010 2009849681 3371329803 2333530394 2292940890 151967180 3626867840 1997607680 852810702 4106693028 1340910093 683952756 3713834026 223505996 1650820391 4003890582 2426204721 1626808643 2770512895 2661601061 3812370268 620727362 4276124202 3216397527 2376432281 516666019 976205590 96406837 166241157 4023376237 2670092936 902945405 853430826 3748113098 3333689877 105995229 1191942977 3191240802 374837364 872014530 2885653124 2191544647 3828444761 4184531093 4099052609 981047116 550461568 3887920573 841862082 3296648680 1165446133 4001570307 1978085520 891897761 263905738 574208783 4241371499 2486756300 598032452 802981973 2396445606 3040576760 3308487836 1032026345 980786636 440322492 3889293725 790922811 758319990 180822135 716490495 1045523304 1410894311 20387015 3904023294 3605444264 4269197311 2653224140 588943774 2435264910 2080185590 2588341183 2987234756 1517106996 1277387359 1012864477 3162176985 676793031 2963525501 2956806866 3713925316 1362755339 1778192406 1004301632 64611270 1248272414 3548749482 1746398954 2002200913 3871223619 3245136853 801908871 2651534088 643039665 3771075408 1023064142 2388874062 1023756795 3828564022 53090572 1341925552 1742106621 1105789534 290311285 3784566027 550708711 404773506 255472875 2006412835 3159629967 136063857 3302467504 514674522 1298808944 1243576411 1930035321 2067644602 3915755219 1923673519 3353323308 3652035168 1207484949 3312381858 241762670 2706951684 3030467272 3765904044 1401717927 255 362436" option to reproduce the execution
0.00/0.01 c #vars 100
0.00/0.01 c #constraints 58
0.00/0.01 c BCD2: Hardening is enabled.
0.00/0.01 c BCD2: BiasedSearch is enabled.
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 66 0 | 23 | 0
0.00/0.01 c 0.0s | 0 | 7 | 3 | 66 0 | 23 | 4
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 = 7
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 3
0.00/0.01 c #restart = 0
0.00/0.01 o 42
0.00/0.01 c BCD2: updating upper bound: 100 -> 41
0.00/0.01 c BCD2: 0 <= obj <= 41
0.00/0.01 c BCD2: #cores=0, #unrelaxed=100, #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 | 66 0 | 23 | 4
0.00/0.01 c 0.0s | 0 | 0 | 0 | 66 0 | 23 | 4
0.00/0.01 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 <= 41
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 | 23 | 4
0.00/0.02 c 0.0s | 0 | 1 | 0 | 66 0 | 23 | 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 = 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 <= 41
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 | 23 | 4
0.00/0.02 c 0.0s | 0 | 2 | 0 | 66 0 | 23 | 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 = 2
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 3
0.00/0.02 c BCD2: 3 <= obj <= 41
0.00/0.02 c BCD2: #cores=3, #unrelaxed=97, #relaxed=3, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=4 bias=4/5
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 66 0 | 23 | 4
0.00/0.02 c 0.0s | 0 | 6 | 0 | 66 0 | 23 | 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 = 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 4: 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 <= 41
0.00/0.02 c BCD2: #cores=4, #unrelaxed=93, #relaxed=7, #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 | 23 | 4
0.00/0.02 c 0.0s | 0 | 7 | 1 | 66 0 | 23 | 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 = 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 3: cost of the new core is >=1
0.00/0.02 c lower bound updated to 5
0.00/0.02 c BCD2: 5 <= obj <= 41
0.00/0.02 c BCD2: #cores=5, #unrelaxed=90, #relaxed=10, #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 | 23 | 4
0.00/0.02 c 0.0s | 0 | 5 | 0 | 66 0 | 23 | 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 = 5
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 6
0.00/0.02 c BCD2: 6 <= obj <= 41
0.00/0.02 c BCD2: #cores=6, #unrelaxed=89, #relaxed=11, #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 | 23 | 4
0.00/0.02 c 0.0s | 0 | 6 | 0 | 66 0 | 23 | 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 = 6
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 7
0.00/0.02 c BCD2: 7 <= obj <= 41
0.00/0.02 c BCD2: #cores=7, #unrelaxed=88, #relaxed=12, #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 | 23 | 4
0.00/0.02 c 0.0s | 0 | 9 | 1 | 66 0 | 23 | 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 = 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 2 cores into a new core of size 9: cost of the new core is >=3
0.00/0.02 c lower bound updated to 8
0.00/0.02 c BCD2: 8 <= obj <= 41
0.00/0.02 c BCD2: #cores=6, #unrelaxed=86, #relaxed=14, #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 | 25 | 4
0.00/0.02 c 0.0s | 0 | 9 | 1 | 66 0 | 25 | 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 3 and merging with 1 cores into a new core of size 12: cost of the new core is >=4
0.00/0.02 c lower bound updated to 9
0.00/0.02 c BCD2: 9 <= obj <= 41
0.00/0.02 c BCD2: #cores=6, #unrelaxed=83, #relaxed=17, #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 | 26 | 6
0.00/0.02 c 0.0s | 0 | 8 | 1 | 66 0 | 26 | 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 = 8
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 14: cost of the new core is >=5
0.00/0.02 c lower bound updated to 10
0.00/0.02 c BCD2: 10 <= obj <= 41
0.00/0.02 c BCD2: #cores=6, #unrelaxed=81, #relaxed=19, #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 | 27 | 7
0.00/0.02 c 0.0s | 0 | 15 | 1 | 66 0 | 27 | 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 = 15
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 9: cost of the new core is >=1
0.00/0.02 c lower bound updated to 11
0.00/0.02 c BCD2: 11 <= obj <= 41
0.00/0.02 c BCD2: #cores=7, #unrelaxed=72, #relaxed=28, #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 | 66 0 | 27 | 8
0.00/0.02 c 0.0s | 0 | 16 | 0 | 66 0 | 27 | 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 = 16
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 7: 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 <= 41
0.00/0.02 c BCD2: #cores=8, #unrelaxed=65, #relaxed=35, #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 | 66 0 | 27 | 8
0.00/0.02 c 0.0s | 0 | 12 | 0 | 66 0 | 27 | 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 = 12
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 13
0.00/0.02 c BCD2: 13 <= obj <= 41
0.00/0.02 c BCD2: #cores=9, #unrelaxed=63, #relaxed=37, #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 | 66 0 | 27 | 8
0.00/0.02 c 0.0s | 0 | 18 | 1 | 66 0 | 27 | 8
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 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: relaxing 5 and merging with 1 cores into a new core of size 12: 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 <= 41
0.00/0.03 c BCD2: #cores=9, #unrelaxed=58, #relaxed=42, #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 | 28 | 8
0.00/0.03 c 0.0s | 0 | 20 | 1 | 66 0 | 28 | 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 = 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 15
0.00/0.03 c BCD2: 15 <= obj <= 41
0.00/0.03 c BCD2: #cores=10, #unrelaxed=55, #relaxed=45, #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 | 28 | 9
0.00/0.03 c 0.0s | 0 | 23 | 1 | 66 0 | 28 | 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 = 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: 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 16
0.00/0.03 c BCD2: 16 <= obj <= 41
0.00/0.03 c BCD2: #cores=10, #unrelaxed=54, #relaxed=46, #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 | 29 | 9
0.00/0.03 c 0.0s | 0 | 21 | 0 | 66 0 | 29 | 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 7: cost of the new core is >=1
0.00/0.03 c lower bound updated to 17
0.00/0.03 c BCD2: 17 <= obj <= 41
0.00/0.03 c BCD2: #cores=11, #unrelaxed=47, #relaxed=53, #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 | 29 | 10
0.00/0.03 c 0.0s | 0 | 24 | 0 | 66 0 | 29 | 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 = 24
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 6: 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 <= 41
0.00/0.03 c BCD2: #cores=12, #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 | 29 | 10
0.00/0.03 c 0.0s | 0 | 20 | 0 | 66 0 | 29 | 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 = 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 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 19
0.00/0.03 c BCD2: 19 <= obj <= 41
0.00/0.03 c BCD2: #cores=13, #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 | 29 | 10
0.00/0.03 c 0.0s | 0 | 20 | 0 | 66 0 | 29 | 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 = 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 2: 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 <= 41
0.00/0.03 c BCD2: #cores=14, #unrelaxed=37, #relaxed=63, #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 | 29 | 10
0.00/0.03 c 0.0s | 0 | 29 | 1 | 66 0 | 29 | 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 = 29
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 5: cost of the new core is >=2
0.00/0.03 c lower bound updated to 21
0.00/0.03 c BCD2: 21 <= obj <= 41
0.00/0.03 c BCD2: #cores=14, #unrelaxed=35, #relaxed=65, #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 | 30 | 10
0.00/0.03 c 0.0s | 0 | 35 | 1 | 66 0 | 30 | 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 = 35
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 22
0.00/0.03 c BCD2: 22 <= obj <= 41
0.00/0.03 c BCD2: #cores=14, #unrelaxed=34, #relaxed=66, #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 | 31 | 11
0.00/0.03 c 0.0s | 0 | 35 | 1 | 66 0 | 31 | 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 = 35
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 23
0.00/0.03 c BCD2: 23 <= obj <= 41
0.00/0.03 c BCD2: #cores=14, #unrelaxed=33, #relaxed=67, #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 | 66 0 | 32 | 12
0.00/0.03 c 0.0s | 0 | 26 | 0 | 66 0 | 32 | 13
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 = 26
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 24
0.00/0.03 c BCD2: 24 <= obj <= 41
0.00/0.03 c BCD2: #cores=15, #unrelaxed=30, #relaxed=70, #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 | 66 0 | 32 | 13
0.00/0.03 c 0.0s | 0 | 26 | 1 | 66 0 | 32 | 13
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 = 26
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 8: cost of the new core is >=3
0.00/0.03 c lower bound updated to 25
0.00/0.03 c BCD2: 25 <= obj <= 41
0.00/0.03 c BCD2: #cores=15, #unrelaxed=25, #relaxed=75, #hardened=0
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 | 66 0 | 33 | 13
0.00/0.03 c 0.0s | 0 | 22 | 0 | 66 0 | 33 | 14
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 = 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 26
0.00/0.03 c BCD2: 26 <= obj <= 41
0.00/0.03 c BCD2: #cores=16, #unrelaxed=24, #relaxed=76, #hardened=0
0.00/0.03 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 | 33 | 14
0.00/0.04 c 0.0s | 0 | 39 | 8 | 66 0 | 33 | 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 = 39
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 8
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 1 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.04 c lower bound updated to 27
0.00/0.04 c BCD2: 27 <= obj <= 41
0.00/0.04 c BCD2: #cores=16, #unrelaxed=23, #relaxed=77, #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 | 34 | 14
0.00/0.04 c 0.0s | 0 | 39 | 9 | 66 0 | 34 | 15
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 = 39
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 9
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 6 and merging with 3 cores into a new core of size 34: cost of the new core is >=9
0.00/0.04 c lower bound updated to 28
0.00/0.04 c BCD2: 28 <= obj <= 41
0.00/0.04 c BCD2: #cores=14, #unrelaxed=17, #relaxed=83, #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 | 37 | 15
0.00/0.05 c 0.0s | 0 | 149 | 99 | 73 0 | 37 | 18
0.00/0.05 c #cpu_time = 0.010s
0.00/0.05 c #wall_clock_time = 0.010s
0.00/0.05 c #decision = 149
0.00/0.05 c #random_decision = 1
0.00/0.05 c #conflict = 99
0.00/0.05 c #restart = 0
0.00/0.05 c BCD2: relaxing 0 and merging with 8 cores into a new core of size 77: cost of the new core is >=23
0.00/0.05 c lower bound updated to 29
0.00/0.05 c BCD2: 29 <= obj <= 41
0.00/0.05 c BCD2: #cores=7, #unrelaxed=17, #relaxed=83, #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 | 73 0 | 45 | 18
0.00/0.06 c 0.0s | 1 | 118 | 100 | 73 0 | 45 | 26
0.00/0.08 c 0.0s | 2 | 289 | 250 | 81 2 | 45 | 26
0.00/0.09 c 0.0s | 2 | 374 | 293 | 81 2 | 93 | 54
0.00/0.09 c #cpu_time = 0.037s
0.00/0.09 c #wall_clock_time = 0.037s
0.00/0.09 c #decision = 374
0.00/0.09 c #random_decision = 1
0.00/0.09 c #conflict = 293
0.00/0.09 c #restart = 2
0.00/0.09 c lower bound updated to 42
0.00/0.09 s OPTIMUM FOUND
0.00/0.09 v x1 -x2 x3 x4 x5 -x6 -x7 -x8 -x9 -x10
0.00/0.09 v -x11 -x12 x13 x14 x15 -x16 -x17 -x18 -x19 -x20
0.00/0.09 v -x21 x22 -x23 x24 -x25 -x26 -x27 x28 x29 -x30
0.00/0.09 v -x31 x32 -x33 x34 x35 -x36 x37 -x38 -x39 -x40
0.00/0.09 v x41 x42 -x43 x44 -x45 -x46 x47 -x48 x49 -x50
0.00/0.09 v x51 x52 -x53 -x54 -x55 -x56 x57 -x58 -x59 x60
0.00/0.09 v -x61 -x62 x63 x64 -x65 -x66 x67 -x68 -x69 -x70
0.00/0.09 v x71 -x72 x73 x74 x75 -x76 x77 x78 -x79 x80
0.00/0.09 v x81 -x82 x83 -x84 -x85 x86 x87 x88 x89 -x90
0.00/0.09 v -x91 -x92 -x93 -x94 -x95 -x96 -x97 x98 -x99 x100
0.00/0.09 c total CPU time = 0.088s
0.00/0.09 c total wall clock time = 0.088s
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-4117717-1467215179/watcher-4117717-1467215179 -o /tmp/evaluation-result-4117717-1467215179/solver-4117717-1467215179 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node139-1467208982-19135 --watchdog 1960 toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4117717-1467215179.opb
pid=20071
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.28 2.29 2.21 2/179 20074
/proc/meminfo: memFree=28545992/32872528 swapFree=1394328/1580332
[pid=20074] ppid=20071 vsize=687548 CPUtime=0 cores=0,2,4,6
/proc/20074/stat : 20074 (toysat) R 20071 20074 19119 0 -1 4202496 2559 0 0 0 0 0 0 0 20 0 4 0 11546458 704049152 3430 33554432000 4194304 16246674 140737449944992 140737449944416 13880264 0 2 0 34082818 18446744073709551615 0 0 17 4 0 0 0 0 0
/proc/20074/statm: 172655 3438 441 2943 0 169549 0
[pid=20074/tid=20075] ppid=20071 vsize=704956 CPUtime=0 cores=0,2,4,6
/proc/20074/task/20075/stat : 20075 (toysat) S 20071 20074 19119 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 11546458 721874944 3498 33554432000 4194304 16246674 140737449944992 139990247910640 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 0 0 0 0 0 0
[pid=20074/tid=20076] ppid=20071 vsize=710076 CPUtime=0 cores=0,2,4,6
/proc/20074/task/20076/stat : 20076 (toysat) S 20071 20074 19119 0 -1 4202560 7 0 0 0 0 0 0 0 20 0 4 0 11546458 727117824 3516 33554432000 4194304 16246674 140737449944992 139990164024560 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 2 0 0 0 0 0
[pid=20074/tid=20077] ppid=20071 vsize=714172 CPUtime=0 cores=0,2,4,6
/proc/20074/task/20077/stat : 20077 (toysat) S 20071 20074 19119 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 11546458 731312128 3534 33554432000 4194304 16246674 140737449944992 139990153551024 14069300 0 0 0 34082818 18446744071579510697 0 0 -1 0 0 0 0 0 0
Solver just ended.
??? exit watcher main loop
??? sigkill at end of watcher main loop
??? kill 20074 sig 9
??? kill -20074 sig 9
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.096617
CPU time (s): 0.093984
CPU user time (s): 0.053991
CPU system time (s): 0.039993
CPU usage (%): 97.2748
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.053991
system time used= 0.039993
maximum resident set size= 82544
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 19787
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= 17
involuntary context switches= 1
??? 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