0.00/0.00 c 2016-06-29T17:55:12+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-4117807-1467215712.opb"]
0.00/0.01 c use --random-gen="2901632203 1824485679 972509297 2181753834 1212699489 2928899900 1972843673 2908320144 1744613699 1177071790 1074086067 3213582757 3262021735 1100670260 1494818529 3248587481 3573989345 3561901801 201298209 324607347 355353251 3142047698 1386383854 2532959964 1074203986 2515709163 1300689012 2060608793 3891752403 3700007410 3786612917 849996198 1147499854 1835879662 756750907 2355035564 3879294632 2807484785 423409534 1228218915 2835455310 2863768672 564611144 4213146072 1263977569 169002664 736915772 2084626928 1674564310 1840609907 1520932836 2330937710 1519473929 1777135646 281406084 1565073180 3541513120 4008024428 3134531820 1762517068 644593472 3483997994 3425246104 3338834311 143185798 1492142822 2586789202 307952442 2050852513 1444405493 605336279 1756911889 3580310824 2285792614 3846457349 2201787240 1146336159 1548837580 2224756499 2208313076 107569665 4273875343 501176789 3182168335 487524265 2967595154 1698596247 951190982 2619277555 806391927 90850397 3964952115 3394978667 564086633 3395985585 3293224952 3339255672 2936302813 1260979418 3548862227 3209376035 679352386 559091526 1150344809 3385128206 1198150872 3837840337 2141175330 498115223 2963320954 3264849868 3646225821 1846079620 1424051644 947340704 597593476 3894212237 1708709926 3190742110 2388568941 1995234645 305895062 1178733771 1006063763 737127943 2583558314 2533318048 746584234 1712426335 1970966935 3126632588 1643226310 1062289678 651633532 1679339990 764942761 1270658895 2258849401 1505589479 2274530469 1482202613 1536021884 603871848 1694327665 1570512096 1868350964 3585082359 2485390048 681334434 373884175 4035229459 81967313 1930303028 3881647811 4239548976 3537409252 578319555 1523845291 4034822962 3467681246 1393858346 964716247 3214617683 735455977 3650155239 2358552372 441829941 2622527271 3791275586 2250044136 4076538862 808748803 2016748587 3521824778 1186005592 325020552 2762226550 2111856192 3243026575 2984883705 798052669 3473985820 4016008747 1011073766 290796379 1986964941 2478649595 884048101 1489772705 2284128640 4002323218 3068295655 3612612839 83595406 2127510676 350406232 762024884 2160200277 3285617260 2138476678 4242061332 1220354311 3154166736 3681372973 853240170 1816684320 3565719814 3460731167 1950376486 4159258647 2756992155 3555907242 1918117614 3047182045 1405806098 158660863 1397276874 661752324 3649084337 4035321557 3191703418 827201106 1444038491 1111703647 950892546 2423158796 2669716484 2545195411 1196441227 742854190 3322196409 2976686687 4117815699 2054569453 2401571118 1590841119 4106816112 20250691 2122527252 1998392714 2878699474 451319474 1604066706 4110947218 3387061304 2094432566 1766523290 382520105 3068769615 906636017 3820756881 3574229646 2866306733 1883774786 3617591712 354242383 255 362436" option to reproduce the execution
0.00/0.01 c #vars 64
0.00/0.01 c #constraints 46
0.00/0.01 c BCD2: Hardening is enabled.
0.00/0.01 c BCD2: BiasedSearch is enabled.
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 46 0 | 15 | 0
0.00/0.01 c 0.0s | 0 | 3 | 1 | 46 0 | 15 | 0
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 3
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 1
0.00/0.01 c #restart = 0
0.00/0.01 o 36
0.00/0.01 c BCD2: updating upper bound: 64 -> 35
0.00/0.01 c BCD2: 0 <= obj <= 35
0.00/0.01 c BCD2: #cores=0, #unrelaxed=64, #relaxed=0, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=1 bias=1/2
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.01 c 0.0s | 0 | 0 | 0 | 46 0 | 15 | 0
0.00/0.01 c 0.0s | 0 | 0 | 0 | 46 0 | 15 | 0
0.00/0.01 c #cpu_time = 0.000s
0.00/0.01 c #wall_clock_time = 0.000s
0.00/0.01 c #decision = 0
0.00/0.01 c #random_decision = 0
0.00/0.01 c #conflict = 0
0.00/0.01 c #restart = 0
0.00/0.01 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.01 c lower bound updated to 1
0.00/0.01 c BCD2: 1 <= obj <= 35
0.00/0.01 c BCD2: #cores=1, #unrelaxed=63, #relaxed=1, #hardened=0
0.00/0.01 c BCD2: #sat=1 #unsat=2 bias=2/3
0.00/0.01 c Solving starts ...
0.00/0.01 c ============================[ Search Statistics ]============================
0.00/0.01 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.01 c | | | | Limit GC | Var | Constra
0.00/0.01 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 46 0 | 15 | 0
0.00/0.02 c 0.0s | 0 | 3 | 1 | 46 0 | 20 | 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 = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 2
0.00/0.02 c BCD2: 2 <= obj <= 35
0.00/0.02 c BCD2: #cores=2, #unrelaxed=62, #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 | 46 0 | 20 | 4
0.00/0.02 c 0.0s | 0 | 2 | 0 | 46 0 | 20 | 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 <= 35
0.00/0.02 c BCD2: #cores=3, #unrelaxed=61, #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 | 46 0 | 20 | 4
0.00/0.02 c 0.0s | 0 | 5 | 0 | 46 0 | 20 | 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 3: 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 <= 35
0.00/0.02 c BCD2: #cores=4, #unrelaxed=58, #relaxed=6, #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 | 46 0 | 20 | 5
0.00/0.02 c 0.0s | 0 | 4 | 0 | 46 0 | 20 | 5
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 4
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 0
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 5
0.00/0.02 c BCD2: 5 <= obj <= 35
0.00/0.02 c BCD2: #cores=5, #unrelaxed=57, #relaxed=7, #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 | 46 0 | 20 | 5
0.00/0.02 c 0.0s | 0 | 10 | 1 | 46 0 | 20 | 5
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 10
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 1
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: relaxing 5 and merging with 1 cores into a new core of size 8: cost of the new core is >=2
0.00/0.02 c lower bound updated to 6
0.00/0.02 c BCD2: 6 <= obj <= 35
0.00/0.02 c BCD2: #cores=5, #unrelaxed=52, #relaxed=12, #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 | 46 0 | 21 | 5
0.00/0.02 c 0.0s | 0 | 6 | 0 | 46 0 | 21 | 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 = 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 <= 35
0.00/0.02 c BCD2: #cores=6, #unrelaxed=51, #relaxed=13, #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 | 46 0 | 21 | 6
0.00/0.02 c 0.0s | 0 | 7 | 0 | 46 0 | 21 | 6
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 7
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 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 8
0.00/0.02 c BCD2: 8 <= obj <= 35
0.00/0.02 c BCD2: #cores=7, #unrelaxed=49, #relaxed=15, #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 | 46 0 | 21 | 6
0.00/0.02 c 0.0s | 0 | 15 | 1 | 46 0 | 22 | 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 = 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 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 9
0.00/0.02 c BCD2: 9 <= obj <= 35
0.00/0.02 c BCD2: #cores=8, #unrelaxed=48, #relaxed=16, #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 | 46 0 | 22 | 6
0.00/0.02 c 0.0s | 0 | 10 | 1 | 46 0 | 22 | 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 = 10
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 10
0.00/0.02 c BCD2: 10 <= obj <= 35
0.00/0.02 c BCD2: #cores=8, #unrelaxed=47, #relaxed=17, #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 | 46 0 | 23 | 6
0.00/0.02 c 0.0s | 0 | 9 | 0 | 46 0 | 23 | 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 = 9
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 11
0.00/0.02 c BCD2: 11 <= obj <= 35
0.00/0.02 c BCD2: #cores=9, #unrelaxed=45, #relaxed=19, #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 | 46 0 | 23 | 7
0.00/0.02 c 0.0s | 0 | 10 | 1 | 46 0 | 23 | 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 = 10
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 12
0.00/0.02 c BCD2: 12 <= obj <= 35
0.00/0.02 c BCD2: #cores=9, #unrelaxed=44, #relaxed=20, #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 | 46 0 | 24 | 7
0.00/0.02 c 0.0s | 0 | 10 | 1 | 46 0 | 24 | 8
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 10
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 13
0.00/0.02 c BCD2: 13 <= obj <= 35
0.00/0.02 c BCD2: #cores=9, #unrelaxed=43, #relaxed=21, #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 | 46 0 | 25 | 8
0.00/0.02 c 0.0s | 0 | 9 | 0 | 46 0 | 25 | 9
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 9
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 14
0.00/0.02 c BCD2: 14 <= obj <= 35
0.00/0.02 c BCD2: #cores=10, #unrelaxed=42, #relaxed=22, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=15 bias=15/16
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 46 0 | 25 | 9
0.00/0.02 c 0.0s | 0 | 22 | 2 | 46 0 | 28 | 11
0.00/0.02 c #cpu_time = 0.000s
0.00/0.02 c #wall_clock_time = 0.000s
0.00/0.02 c #decision = 22
0.00/0.02 c #random_decision = 0
0.00/0.02 c #conflict = 2
0.00/0.02 c #restart = 0
0.00/0.02 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.02 c lower bound updated to 15
0.00/0.02 c BCD2: 15 <= obj <= 35
0.00/0.02 c BCD2: #cores=11, #unrelaxed=41, #relaxed=23, #hardened=0
0.00/0.02 c BCD2: #sat=1 #unsat=16 bias=16/17
0.00/0.02 c Solving starts ...
0.00/0.02 c ============================[ Search Statistics ]============================
0.00/0.02 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.02 c | | | | Limit GC | Var | Constra
0.00/0.02 c =============================================================================
0.00/0.02 c 0.0s | 0 | 0 | 0 | 46 0 | 28 | 11
0.00/0.03 c 0.0s | 0 | 13 | 1 | 46 0 | 28 | 11
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 13
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 16
0.00/0.03 c BCD2: 16 <= obj <= 35
0.00/0.03 c BCD2: #cores=12, #unrelaxed=39, #relaxed=25, #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 | 46 0 | 28 | 11
0.00/0.03 c 0.0s | 0 | 14 | 2 | 46 0 | 28 | 11
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 14
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 2
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 17
0.00/0.03 c BCD2: 17 <= obj <= 35
0.00/0.03 c BCD2: #cores=12, #unrelaxed=38, #relaxed=26, #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 | 46 0 | 29 | 11
0.00/0.03 c 0.0s | 0 | 14 | 1 | 46 0 | 29 | 12
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 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: relaxing 2 and merging with 1 cores into a new core of size 5: cost of the new core is >=3
0.00/0.03 c lower bound updated to 18
0.00/0.03 c BCD2: 18 <= obj <= 35
0.00/0.03 c BCD2: #cores=12, #unrelaxed=36, #relaxed=28, #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 | 46 0 | 30 | 12
0.00/0.03 c 0.0s | 0 | 13 | 0 | 46 0 | 30 | 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 = 13
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 19
0.00/0.03 c BCD2: 19 <= obj <= 35
0.00/0.03 c BCD2: #cores=13, #unrelaxed=35, #relaxed=29, #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 | 46 0 | 30 | 13
0.00/0.03 c 0.0s | 0 | 16 | 1 | 46 0 | 30 | 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 = 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: 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 <= 35
0.00/0.03 c BCD2: #cores=14, #unrelaxed=33, #relaxed=31, #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 | 46 0 | 30 | 13
0.00/0.03 c 0.0s | 0 | 18 | 1 | 46 0 | 30 | 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 = 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 2: cost of the new core is >=1
0.00/0.03 c lower bound updated to 21
0.00/0.03 c BCD2: 21 <= obj <= 35
0.00/0.03 c BCD2: #cores=15, #unrelaxed=31, #relaxed=33, #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 | 46 0 | 30 | 13
0.00/0.03 c 0.0s | 0 | 19 | 0 | 46 0 | 30 | 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 = 19
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 22
0.00/0.03 c BCD2: 22 <= obj <= 35
0.00/0.03 c BCD2: #cores=16, #unrelaxed=30, #relaxed=34, #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 | 46 0 | 30 | 13
0.00/0.03 c 0.0s | 0 | 27 | 1 | 46 0 | 30 | 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 = 27
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: 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 <= 35
0.00/0.03 c BCD2: #cores=16, #unrelaxed=29, #relaxed=35, #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 | 46 0 | 31 | 13
0.00/0.03 c 0.0s | 0 | 21 | 1 | 46 0 | 31 | 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 = 21
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 4: 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 <= 35
0.00/0.03 c BCD2: #cores=17, #unrelaxed=25, #relaxed=39, #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 | 46 0 | 31 | 14
0.00/0.03 c 0.0s | 0 | 20 | 1 | 46 0 | 31 | 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 = 20
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 1
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: relaxing 2 and merging with 3 cores into a new core of size 13: cost of the new core is >=6
0.00/0.03 c lower bound updated to 25
0.00/0.03 c BCD2: 25 <= obj <= 35
0.00/0.03 c BCD2: #cores=15, #unrelaxed=23, #relaxed=41, #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 | 46 0 | 34 | 14
0.00/0.03 c 0.0s | 0 | 33 | 1 | 46 0 | 35 | 17
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 = 33
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 26
0.00/0.03 c BCD2: 26 <= obj <= 35
0.00/0.03 c BCD2: #cores=16, #unrelaxed=22, #relaxed=42, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=27 bias=27/28
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 | 46 0 | 35 | 17
0.00/0.03 c 0.0s | 0 | 18 | 0 | 46 0 | 35 | 17
0.00/0.03 c #cpu_time = 0.000s
0.00/0.03 c #wall_clock_time = 0.000s
0.00/0.03 c #decision = 18
0.00/0.03 c #random_decision = 0
0.00/0.03 c #conflict = 0
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.03 c lower bound updated to 27
0.00/0.03 c BCD2: 27 <= obj <= 35
0.00/0.03 c BCD2: #cores=17, #unrelaxed=21, #relaxed=43, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=28 bias=28/29
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 | 46 0 | 35 | 17
0.00/0.03 c 0.0s | 0 | 19 | 0 | 46 0 | 35 | 17
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 = 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 28
0.00/0.03 c BCD2: 28 <= obj <= 35
0.00/0.03 c BCD2: #cores=18, #unrelaxed=20, #relaxed=44, #hardened=0
0.00/0.03 c BCD2: #sat=1 #unsat=29 bias=29/30
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 | 46 0 | 35 | 17
0.00/0.03 c 0.0s | 0 | 23 | 2 | 46 0 | 35 | 17
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 = 2
0.00/0.03 c #restart = 0
0.00/0.03 c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.03 c lower bound updated to 29
0.00/0.03 c BCD2: 29 <= obj <= 35
0.00/0.03 c BCD2: #cores=19, #unrelaxed=16, #relaxed=48, #hardened=0
0.00/0.03 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 | 46 0 | 35 | 17
0.00/0.04 c 0.0s | 0 | 21 | 0 | 46 0 | 35 | 17
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 21
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 30
0.00/0.04 c BCD2: 30 <= obj <= 35
0.00/0.04 c BCD2: #cores=20, #unrelaxed=15, #relaxed=49, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=31 bias=31/32
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 46 0 | 35 | 17
0.00/0.04 c 0.0s | 0 | 23 | 0 | 46 0 | 35 | 17
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 = 23
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 31
0.00/0.04 c BCD2: 31 <= obj <= 35
0.00/0.04 c BCD2: #cores=21, #unrelaxed=14, #relaxed=50, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=32 bias=32/33
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 46 0 | 35 | 17
0.00/0.04 c 0.0s | 0 | 27 | 1 | 46 0 | 35 | 17
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 27
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 1
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: relaxing 2 and merging with 1 cores into a new core of size 6: cost of the new core is >=2
0.00/0.04 c lower bound updated to 32
0.00/0.04 c BCD2: 32 <= obj <= 35
0.00/0.04 c BCD2: #cores=21, #unrelaxed=12, #relaxed=52, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=33 bias=33/34
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 46 0 | 36 | 17
0.00/0.04 c 0.0s | 0 | 24 | 0 | 46 0 | 36 | 18
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 = 24
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 33
0.00/0.04 c BCD2: 33 <= obj <= 35
0.00/0.04 c BCD2: #cores=22, #unrelaxed=11, #relaxed=53, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=34 bias=34/35
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 46 0 | 36 | 18
0.00/0.04 c 0.0s | 0 | 25 | 0 | 46 0 | 36 | 18
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 25
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.04 c lower bound updated to 34
0.00/0.04 c BCD2: 34 <= obj <= 35
0.00/0.04 c BCD2: #cores=23, #unrelaxed=9, #relaxed=55, #hardened=0
0.00/0.04 c BCD2: #sat=1 #unsat=35 bias=35/36
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 46 0 | 36 | 19
0.00/0.04 c 0.0s | 0 | 25 | 0 | 46 0 | 36 | 19
0.00/0.04 c #cpu_time = 0.000s
0.00/0.04 c #wall_clock_time = 0.000s
0.00/0.04 c #decision = 25
0.00/0.04 c #random_decision = 0
0.00/0.04 c #conflict = 0
0.00/0.04 c #restart = 0
0.00/0.04 c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04 c lower bound updated to 35
0.00/0.04 c BCD2: hardening fixes 8 literals
0.00/0.04 c BCD2: 35 <= obj <= 35
0.00/0.04 c BCD2: #cores=24, #unrelaxed=0, #relaxed=56, #hardened=8
0.00/0.04 c BCD2: #sat=1 #unsat=36 bias=36/37
0.00/0.04 c Solving starts ...
0.00/0.04 c ============================[ Search Statistics ]============================
0.00/0.04 c Time | Restart | Decision | Conflict | LEARNT | Fixed | Removed
0.00/0.04 c | | | | Limit GC | Var | Constra
0.00/0.04 c =============================================================================
0.00/0.04 c 0.0s | 0 | 0 | 0 | 46 0 | 44 | 19
0.00/0.04 c 0.0s | 0 | 49 | 3 | 46 0 | 45 | 27
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 = 49
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: updating lower bound of a core
0.00/0.04 c lower bound updated to 36
0.00/0.04 s OPTIMUM FOUND
0.00/0.04 v x1 x2 x3 -x4 x5 x6 -x7 -x8 -x9 x10
0.00/0.04 v -x11 -x12 x13 -x14 x15 -x16 x17 x18 x19 -x20
0.00/0.04 v -x21 x22 x23 x24 -x25 -x26 x27 -x28 -x29 x30
0.00/0.04 v -x31 x32 -x33 x34 -x35 x36 x37 x38 x39 x40
0.00/0.04 v x41 x42 x43 x44 -x45 x46 x47 x48 x49 -x50
0.00/0.04 v -x51 -x52 -x53 -x54 x55 -x56 -x57 -x58 x59 -x60
0.00/0.04 v -x61 x62 x63 x64
0.00/0.04 c total CPU time = 0.041s
0.00/0.04 c total wall clock time = 0.041s
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-4117807-1467215712/watcher-4117807-1467215712 -o /tmp/evaluation-result-4117807-1467215712/solver-4117807-1467215712 -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-4117807-1467215712.opb
pid=2523
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.20 2.22 2.18 3/179 2526
/proc/meminfo: memFree=27586044/32872528 swapFree=1553660/1717180
[pid=2526] ppid=2523 vsize=416188 CPUtime=0 cores=1,3,5,7
/proc/2526/stat : 2526 (toysat) R 2523 2526 1984 0 -1 4202496 1499 0 0 0 0 0 0 0 20 0 4 0 598848 426176512 1348 33554432000 4194304 16246674 140735573333600 140735573333024 13880264 0 2 0 34082818 18446744073709551615 0 0 17 3 0 0 0 0 0
/proc/2526/statm: 104559 1358 441 2943 0 101453 0
[pid=2526/tid=2527] ppid=2523 vsize=432572 CPUtime=0 cores=1,3,5,7
/proc/2526/task/2527/stat : 2527 (toysat) S 2523 2526 1984 0 -1 4202560 10 0 0 0 0 0 0 0 20 0 4 0 598848 442953728 1415 33554432000 4194304 16246674 140735573333600 140622636756208 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 5 0 0 0 0 0
[pid=2526/tid=2528] ppid=2523 vsize=437692 CPUtime=0 cores=1,3,5,7
/proc/2526/task/2528/stat : 2528 (toysat) S 2523 2526 1984 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 598848 448196608 1433 33554432000 4194304 16246674 140735573333600 140622626266352 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 1 0 0 0 0 0
[pid=2526/tid=2529] ppid=2523 vsize=440764 CPUtime=0 cores=1,3,5,7
/proc/2526/task/2529/stat : 2529 (toysat) S 2523 2526 1984 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 598848 451342336 1448 33554432000 4194304 16246674 140735573333600 140622615792816 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 2526 sig 9
??? kill -2526 sig 9
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.048351
CPU time (s): 0.044992
CPU user time (s): 0.020996
CPU system time (s): 0.023996
CPU usage (%): 93.0529
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.020996
system time used= 0.023996
maximum resident set size= 42144
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10708
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.004999 second user time and 0.003999 second system time
The end