Trace number 4079522

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerobjective functionCPU timeWall clock time
toysat 2016-05-02OPT64 0.082987 0.0889581

General information on the benchmark

Namenormalized-PB06/OPT-SMALLINT/submitted-PB05/
manquinho/primes-dimacs-cnf/normalized-par8-1-c.opb
MD5SUMa203c9ef5477e7407dcfddbe5a4b9f8e
Bench CategoryOPT-SMALLINT (optimisation, small integers)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark64
Best CPU time to get the best result obtained on this benchmark0.001999
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 64
Optimality of the best value was proved YES
Number of variables128
Total number of constraints318
Number of constraints which are clauses318
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint2
Maximum length of a constraint3
Number of terms in the objective function 128
Biggest coefficient in the objective function 1
Number of bits for the biggest coefficient in the objective function 1
Sum of the numbers in the objective function 128
Number of bits of the sum of numbers in the objective function 8
Biggest number in a constraint 1
Number of bits of the biggest number in a constraint 1
Biggest sum of numbers in a constraint 128
Number of bits of the biggest sum of numbers8
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.00/0.00	c 2016-06-06T19:08:23+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-4079522-1465232903.opb"]
0.00/0.01	c use --random-gen="1497219404 3613112419 31079549 2584586747 3997684593 2267267974 2581741343 4087824977 224108050 3177367755 1271389807 383146005 2391371149 3807640784 2082033521 1228948827 409052761 3774762538 1384787296 2932179380 3833981013 3861907316 2891886143 2832228022 1289910647 873530193 428402904 2652811609 2427762771 4185301852 1672288842 2282240982 3088932024 594791152 1585776681 306434461 101941012 3098071017 2070981294 3359970407 314068704 556429679 2175673686 3841166792 2243016604 1593269619 1479437550 1062966103 1444468155 3445638784 3730990396 3120951379 979787621 3994158266 1323570866 3678035974 3814371152 2161652703 3602538708 373276787 3893963415 2673256642 3480748681 1901341933 612573852 1827656660 1322856450 3431993235 2909213462 167480583 905841614 1072174161 83096879 3060588430 853858392 1265336240 2820237928 1779690726 725196992 1116241083 4198143804 3383805267 760089305 2402130243 2954264830 3791973295 1256704872 18415203 911774699 2462630297 253199112 128472280 1460760184 2433344792 3901266536 589553643 595490974 2490382584 3473992534 139786642 285991820 126138510 900541554 3063374041 267312750 456368918 1185691583 1008861077 307402298 536951127 2900775669 3333344010 3870774630 700718150 755278191 1519383635 1556339429 1238920563 591389301 2669596332 115727432 3517740292 339138304 2515992102 4210419166 365984891 3867145456 567246185 1317022343 3977845034 2060040548 2056033162 4254505509 2007254717 2779930438 557596800 2946902545 78921451 3695464681 492091745 4135799338 4162744215 3643121076 2795510336 3645361855 3755960524 2137184965 2966704515 2311558648 359321403 1918963006 2785167205 1515756707 195856966 3169619431 1022085572 595941161 2520471819 2110615422 971230929 3560732772 778357399 2025715560 110853283 2433194071 153039767 2145120386 2216211711 3012194250 3738773132 3155727826 2434298868 3763858742 3376987279 2395569630 3175859185 2729134343 2365013799 3730415880 1354860153 2133127839 971956481 2260206049 2188163117 2829624712 872799200 465410237 44168759 1013117510 1628667258 3119057714 850070568 827026425 2595401662 4086752264 206502212 2366553608 1419336490 3225367565 4222974381 161168389 2562840677 1500532597 1084119549 4138454947 611754108 965391071 1152954912 2692535887 1402156683 1471572725 484484365 202455458 3308504441 796055444 1660572359 709299712 4107622168 2139821785 3254782176 163664956 3122691576 1607447727 3723513244 3677654554 386353040 1489426321 3401004143 3388852108 2638629939 3879835066 4201716374 797211141 2106061584 2053938736 833660289 2988872835 2720051045 1104509923 3937839783 2324185485 753712799 3428308180 3001383340 1527465682 3079188718 3971722701 2286614897 1612517204 2021905889 2849862815 961937460 134209589 2981208503 1768002841 1666158114 255 362436" option to reproduce the execution
0.00/0.01	c #vars 128
0.00/0.01	c #constraints 318
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 |      148      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       11 |        8 |      148      0 |        0 |        0
0.00/0.02	c #cpu_time = 0.002s
0.00/0.02	c #wall_clock_time = 0.002s
0.00/0.02	c #decision = 11
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 8
0.00/0.02	c #restart = 0
0.00/0.02	o 64
0.00/0.02	c BCD2: updating upper bound: 128 -> 63
0.00/0.02	c BCD2: 0 <= obj <= 63
0.00/0.02	c BCD2: #cores=0, #unrelaxed=128, #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 |      148      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |        3 |        2 |      148      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 = 3
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 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 <= 63
0.00/0.02	c BCD2: #cores=1, #unrelaxed=126, #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 |      148      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |        4 |        2 |      148      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 = 2
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 2
0.00/0.02	c BCD2: 2 <= obj <= 63
0.00/0.02	c BCD2: #cores=2, #unrelaxed=124, #relaxed=4, #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 |      148      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |        7 |        2 |      148      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 = 7
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 2
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.02	c lower bound updated to 3
0.00/0.02	c BCD2: 3 <= obj <= 63
0.00/0.02	c BCD2: #cores=3, #unrelaxed=122, #relaxed=6, #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 |      148      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       10 |        2 |      148      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 = 10
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 2: 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 <= 63
0.00/0.02	c BCD2: #cores=4, #unrelaxed=120, #relaxed=8, #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 |      148      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       11 |        2 |      148      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 = 11
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 2: 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 <= 63
0.00/0.02	c BCD2: #cores=5, #unrelaxed=118, #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 |      148      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       14 |        2 |      148      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 = 14
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 2: 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 <= 63
0.00/0.02	c BCD2: #cores=6, #unrelaxed=116, #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 |      148      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       17 |        2 |      148      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 = 17
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 2: 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 <= 63
0.00/0.02	c BCD2: #cores=7, #unrelaxed=114, #relaxed=14, #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 |      148      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       20 |        2 |      148      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 = 20
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 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 <= 63
0.00/0.02	c BCD2: #cores=8, #unrelaxed=112, #relaxed=16, #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 |      148      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       27 |        2 |      148      0 |        0 |        0
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 = 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 <= 63
0.00/0.03	c BCD2: #cores=9, #unrelaxed=110, #relaxed=18, #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 |      148      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       32 |        2 |      148      0 |        0 |        0
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 = 32
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 10
0.00/0.03	c BCD2: 10 <= obj <= 63
0.00/0.03	c BCD2: #cores=10, #unrelaxed=108, #relaxed=20, #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 |      148      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       33 |        2 |      148      0 |        0 |        0
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 = 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 11
0.00/0.03	c BCD2: 11 <= obj <= 63
0.00/0.03	c BCD2: #cores=11, #unrelaxed=106, #relaxed=22, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=12 bias=12/13
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      148      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       34 |        2 |      148      0 |        0 |        0
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 = 34
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 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 <= 63
0.00/0.03	c BCD2: #cores=11, #unrelaxed=104, #relaxed=24, #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 |      148      0 |        1 |        0
0.00/0.03	c  0.0s |       0 |       33 |        1 |      148      0 |        1 |        1
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: relaxing 3 and merging with 2 cores into a new core of size 7: 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 <= 63
0.00/0.03	c BCD2: #cores=10, #unrelaxed=101, #relaxed=27, #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 |      148      0 |        3 |        1
0.00/0.03	c  0.0s |       0 |       30 |        2 |      148      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 = 30
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 14
0.00/0.03	c BCD2: 14 <= obj <= 63
0.00/0.03	c BCD2: #cores=11, #unrelaxed=99, #relaxed=29, #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 |      148      0 |        3 |        3
0.00/0.03	c  0.0s |       0 |       31 |        2 |      148      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 = 31
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.03	c BCD2: 15 <= obj <= 63
0.00/0.03	c BCD2: #cores=12, #unrelaxed=97, #relaxed=31, #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 |      148      0 |        3 |        3
0.00/0.03	c  0.0s |       0 |       32 |        2 |      148      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 = 32
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 16
0.00/0.03	c BCD2: 16 <= obj <= 63
0.00/0.03	c BCD2: #cores=13, #unrelaxed=95, #relaxed=33, #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 |      148      0 |        3 |        3
0.00/0.03	c  0.0s |       0 |       31 |        2 |      148      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 = 31
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 17
0.00/0.03	c BCD2: 17 <= obj <= 63
0.00/0.03	c BCD2: #cores=14, #unrelaxed=93, #relaxed=35, #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 |      148      0 |        3 |        3
0.00/0.03	c  0.0s |       0 |       30 |        2 |      148      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 = 30
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 18
0.00/0.03	c BCD2: 18 <= obj <= 63
0.00/0.03	c BCD2: #cores=15, #unrelaxed=91, #relaxed=37, #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 |      148      0 |        3 |        3
0.00/0.03	c  0.0s |       0 |       29 |        2 |      148      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 = 29
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 19
0.00/0.03	c BCD2: 19 <= obj <= 63
0.00/0.03	c BCD2: #cores=16, #unrelaxed=89, #relaxed=39, #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 |      148      0 |        3 |        3
0.00/0.03	c  0.0s |       0 |       28 |        0 |      148      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 = 28
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.03	c lower bound updated to 20
0.00/0.03	c BCD2: 20 <= obj <= 63
0.00/0.03	c BCD2: #cores=17, #unrelaxed=86, #relaxed=42, #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.04	c  0.0s |       0 |        0 |        0 |      148      0 |        3 |        3
0.00/0.04	c  0.0s |       0 |       28 |        2 |      148      0 |        3 |        3
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 = 28
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 2: 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 <= 63
0.00/0.04	c BCD2: #cores=18, #unrelaxed=84, #relaxed=44, #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 |      148      0 |        3 |        3
0.00/0.04	c  0.0s |       0 |       29 |        2 |      148      0 |        3 |        3
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 = 29
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 2: cost of the new core is >=1
0.00/0.04	c lower bound updated to 22
0.00/0.04	c BCD2: 22 <= obj <= 63
0.00/0.04	c BCD2: #cores=19, #unrelaxed=82, #relaxed=46, #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 |      148      0 |        3 |        3
0.00/0.04	c  0.0s |       0 |       30 |        2 |      148      0 |        3 |        3
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 = 30
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 2: 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 <= 63
0.00/0.04	c BCD2: #cores=20, #unrelaxed=80, #relaxed=48, #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 |      148      0 |        3 |        3
0.00/0.04	c  0.0s |       0 |       31 |        2 |      148      0 |        3 |        3
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 = 31
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: 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 24
0.00/0.04	c BCD2: 24 <= obj <= 63
0.00/0.04	c BCD2: #cores=20, #unrelaxed=78, #relaxed=50, #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 |      148      0 |        4 |        3
0.00/0.04	c  0.0s |       0 |       29 |        2 |      148      0 |        4 |        4
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 = 29
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: 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 25
0.00/0.04	c BCD2: 25 <= obj <= 63
0.00/0.04	c BCD2: #cores=20, #unrelaxed=76, #relaxed=52, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=26 bias=26/27
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      148      0 |        5 |        4
0.00/0.04	c  0.0s |       0 |       29 |        2 |      148      0 |        5 |        5
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 = 29
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 2: cost of the new core is >=1
0.00/0.04	c lower bound updated to 26
0.00/0.04	c BCD2: 26 <= obj <= 63
0.00/0.04	c BCD2: #cores=21, #unrelaxed=74, #relaxed=54, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=27 bias=27/28
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      148      0 |        5 |        5
0.00/0.04	c  0.0s |       0 |       30 |        2 |      148      0 |        5 |        5
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 = 30
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: 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 27
0.00/0.04	c BCD2: 27 <= obj <= 63
0.00/0.04	c BCD2: #cores=21, #unrelaxed=72, #relaxed=56, #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 |      148      0 |        6 |        5
0.00/0.04	c  0.0s |       0 |       28 |        2 |      148      0 |        6 |        6
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 = 28
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 2: cost of the new core is >=1
0.00/0.04	c lower bound updated to 28
0.00/0.04	c BCD2: 28 <= obj <= 63
0.00/0.04	c BCD2: #cores=22, #unrelaxed=70, #relaxed=58, #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 |      148      0 |        6 |        6
0.00/0.04	c  0.0s |       0 |       27 |        2 |      148      0 |        6 |        6
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 = 2
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 29
0.00/0.04	c BCD2: 29 <= obj <= 63
0.00/0.04	c BCD2: #cores=22, #unrelaxed=68, #relaxed=60, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=30 bias=30/31
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      148      0 |        7 |        6
0.00/0.04	c  0.0s |       0 |       27 |        3 |      148      0 |        7 |        7
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 = 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 30
0.00/0.04	c BCD2: 30 <= obj <= 63
0.00/0.04	c BCD2: #cores=22, #unrelaxed=66, #relaxed=62, #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 |      148      0 |        8 |        7
0.00/0.04	c  0.0s |       0 |       24 |        1 |      148      0 |        8 |        8
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 = 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 31
0.00/0.04	c BCD2: 31 <= obj <= 63
0.00/0.04	c BCD2: #cores=23, #unrelaxed=64, #relaxed=64, #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.05	c  0.0s |       0 |        0 |        0 |      148      0 |        8 |        8
0.00/0.05	c  0.0s |       0 |       26 |        2 |      148      0 |        8 |        8
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: relaxing 2 and merging with 1 cores into a new core of size 4: cost of the new core is >=2
0.00/0.05	c lower bound updated to 32
0.00/0.05	c BCD2: 32 <= obj <= 63
0.00/0.05	c BCD2: #cores=23, #unrelaxed=62, #relaxed=66, #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 |      148      0 |        9 |        8
0.00/0.05	c  0.0s |       0 |       24 |        0 |      148      0 |        9 |        9
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 = 24
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
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 33
0.00/0.05	c BCD2: 33 <= obj <= 63
0.00/0.05	c BCD2: #cores=24, #unrelaxed=60, #relaxed=68, #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 |      148      0 |        9 |        9
0.00/0.05	c  0.0s |       0 |       25 |        0 |      148      0 |        9 |        9
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 = 25
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	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.05	c lower bound updated to 34
0.00/0.05	c BCD2: 34 <= obj <= 63
0.00/0.05	c BCD2: #cores=24, #unrelaxed=58, #relaxed=70, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=35 bias=35/36
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 |      148      0 |       10 |        9
0.00/0.05	c  0.0s |       0 |       25 |        0 |      148      0 |       10 |       10
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 = 25
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
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 35
0.00/0.05	c BCD2: 35 <= obj <= 63
0.00/0.05	c BCD2: #cores=25, #unrelaxed=56, #relaxed=72, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=36 bias=36/37
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 |      148      0 |       10 |       10
0.00/0.05	c  0.0s |       0 |       26 |        0 |      148      0 |       10 |       10
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 = 26
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	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.05	c lower bound updated to 36
0.00/0.05	c BCD2: 36 <= obj <= 63
0.00/0.05	c BCD2: #cores=25, #unrelaxed=54, #relaxed=74, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=37 bias=37/38
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 |      148      0 |       11 |       10
0.00/0.05	c  0.0s |       0 |       26 |        0 |      148      0 |       11 |       11
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 = 26
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
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 37
0.00/0.05	c BCD2: 37 <= obj <= 63
0.00/0.05	c BCD2: #cores=26, #unrelaxed=52, #relaxed=76, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=38 bias=38/39
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 |      148      0 |       11 |       11
0.00/0.05	c  0.0s |       0 |       27 |        0 |      148      0 |       11 |       11
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 = 27
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	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.05	c lower bound updated to 38
0.00/0.05	c BCD2: 38 <= obj <= 63
0.00/0.05	c BCD2: #cores=26, #unrelaxed=50, #relaxed=78, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=39 bias=39/40
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 |      148      0 |       12 |       11
0.00/0.05	c  0.0s |       0 |       27 |        0 |      148      0 |       12 |       12
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 = 27
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
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 39
0.00/0.05	c BCD2: 39 <= obj <= 63
0.00/0.05	c BCD2: #cores=27, #unrelaxed=48, #relaxed=80, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=40 bias=40/41
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 |      148      0 |       12 |       12
0.00/0.05	c  0.0s |       0 |       28 |        0 |      148      0 |       12 |       12
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 = 28
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
0.00/0.05	c #restart = 0
0.00/0.05	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.05	c lower bound updated to 40
0.00/0.05	c BCD2: 40 <= obj <= 63
0.00/0.05	c BCD2: #cores=27, #unrelaxed=46, #relaxed=82, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=41 bias=41/42
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 |      148      0 |       13 |       12
0.00/0.05	c  0.0s |       0 |       28 |        0 |      148      0 |       13 |       13
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 = 28
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 0
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 41
0.00/0.05	c BCD2: 41 <= obj <= 63
0.00/0.05	c BCD2: #cores=28, #unrelaxed=44, #relaxed=84, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=42 bias=42/43
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 |      148      0 |       13 |       13
0.00/0.06	c  0.0s |       0 |       29 |        0 |      148      0 |       13 |       13
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 29
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	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.06	c lower bound updated to 42
0.00/0.06	c BCD2: 42 <= obj <= 63
0.00/0.06	c BCD2: #cores=28, #unrelaxed=42, #relaxed=86, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=43 bias=43/44
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 |      148      0 |       14 |       13
0.00/0.06	c  0.0s |       0 |       29 |        0 |      148      0 |       14 |       14
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 29
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06	c lower bound updated to 43
0.00/0.06	c BCD2: 43 <= obj <= 63
0.00/0.06	c BCD2: #cores=29, #unrelaxed=40, #relaxed=88, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=44 bias=44/45
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 |      148      0 |       14 |       14
0.00/0.06	c  0.0s |       0 |       30 |        0 |      148      0 |       14 |       14
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 30
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	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.06	c lower bound updated to 44
0.00/0.06	c BCD2: 44 <= obj <= 63
0.00/0.06	c BCD2: #cores=29, #unrelaxed=38, #relaxed=90, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=45 bias=45/46
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 |      148      0 |       15 |       14
0.00/0.06	c  0.0s |       0 |       30 |        0 |      148      0 |       15 |       15
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 30
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06	c lower bound updated to 45
0.00/0.06	c BCD2: 45 <= obj <= 63
0.00/0.06	c BCD2: #cores=30, #unrelaxed=36, #relaxed=92, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=46 bias=46/47
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 |      148      0 |       15 |       15
0.00/0.06	c  0.0s |       0 |       31 |        0 |      148      0 |       15 |       15
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 31
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	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.06	c lower bound updated to 46
0.00/0.06	c BCD2: 46 <= obj <= 63
0.00/0.06	c BCD2: #cores=30, #unrelaxed=34, #relaxed=94, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=47 bias=47/48
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 |      148      0 |       16 |       15
0.00/0.06	c  0.0s |       0 |       31 |        0 |      148      0 |       16 |       16
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 31
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06	c lower bound updated to 47
0.00/0.06	c BCD2: 47 <= obj <= 63
0.00/0.06	c BCD2: #cores=31, #unrelaxed=32, #relaxed=96, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=48 bias=48/49
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 |      148      0 |       16 |       16
0.00/0.06	c  0.0s |       0 |       32 |        0 |      148      0 |       16 |       16
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 32
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	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.06	c lower bound updated to 48
0.00/0.06	c BCD2: 48 <= obj <= 63
0.00/0.06	c BCD2: #cores=31, #unrelaxed=30, #relaxed=98, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=49 bias=49/50
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 |      148      0 |       17 |       16
0.00/0.06	c  0.0s |       0 |       32 |        0 |      148      0 |       17 |       17
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 32
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06	c lower bound updated to 49
0.00/0.06	c BCD2: 49 <= obj <= 63
0.00/0.06	c BCD2: #cores=32, #unrelaxed=28, #relaxed=100, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=50 bias=50/51
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 |      148      0 |       17 |       17
0.00/0.06	c  0.0s |       0 |       33 |        0 |      148      0 |       17 |       17
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 33
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	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.06	c lower bound updated to 50
0.00/0.06	c BCD2: 50 <= obj <= 63
0.00/0.06	c BCD2: #cores=32, #unrelaxed=26, #relaxed=102, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=51 bias=51/52
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 |      148      0 |       18 |       17
0.00/0.06	c  0.0s |       0 |       33 |        0 |      148      0 |       18 |       18
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 33
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.06	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.06	c lower bound updated to 51
0.00/0.06	c BCD2: 51 <= obj <= 63
0.00/0.06	c BCD2: #cores=33, #unrelaxed=24, #relaxed=104, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=52 bias=52/53
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 |      148      0 |       18 |       18
0.00/0.06	c  0.0s |       0 |       34 |        0 |      148      0 |       18 |       18
0.00/0.06	c #cpu_time = 0.000s
0.00/0.06	c #wall_clock_time = 0.000s
0.00/0.06	c #decision = 34
0.00/0.06	c #random_decision = 0
0.00/0.06	c #conflict = 0
0.00/0.06	c #restart = 0
0.00/0.07	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.07	c lower bound updated to 52
0.00/0.07	c BCD2: 52 <= obj <= 63
0.00/0.07	c BCD2: #cores=33, #unrelaxed=22, #relaxed=106, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=53 bias=53/54
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       19 |       18
0.00/0.07	c  0.0s |       0 |       34 |        0 |      148      0 |       19 |       19
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 34
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07	c lower bound updated to 53
0.00/0.07	c BCD2: 53 <= obj <= 63
0.00/0.07	c BCD2: #cores=34, #unrelaxed=20, #relaxed=108, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=54 bias=54/55
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       19 |       19
0.00/0.07	c  0.0s |       0 |       35 |        0 |      148      0 |       19 |       19
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 35
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	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.07	c lower bound updated to 54
0.00/0.07	c BCD2: 54 <= obj <= 63
0.00/0.07	c BCD2: #cores=34, #unrelaxed=18, #relaxed=110, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=55 bias=55/56
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       20 |       19
0.00/0.07	c  0.0s |       0 |       35 |        0 |      148      0 |       20 |       20
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 35
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07	c lower bound updated to 55
0.00/0.07	c BCD2: 55 <= obj <= 63
0.00/0.07	c BCD2: #cores=35, #unrelaxed=16, #relaxed=112, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=56 bias=56/57
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       20 |       20
0.00/0.07	c  0.0s |       0 |       36 |        0 |      148      0 |       20 |       20
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 36
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	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.07	c lower bound updated to 56
0.00/0.07	c BCD2: 56 <= obj <= 63
0.00/0.07	c BCD2: #cores=35, #unrelaxed=14, #relaxed=114, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=57 bias=57/58
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       21 |       20
0.00/0.07	c  0.0s |       0 |       36 |        0 |      148      0 |       21 |       21
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 36
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07	c lower bound updated to 57
0.00/0.07	c BCD2: 57 <= obj <= 63
0.00/0.07	c BCD2: #cores=36, #unrelaxed=12, #relaxed=116, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=58 bias=58/59
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       21 |       21
0.00/0.07	c  0.0s |       0 |       37 |        0 |      148      0 |       21 |       21
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 37
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	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.07	c lower bound updated to 58
0.00/0.07	c BCD2: 58 <= obj <= 63
0.00/0.07	c BCD2: #cores=36, #unrelaxed=10, #relaxed=118, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=59 bias=59/60
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       22 |       21
0.00/0.07	c  0.0s |       0 |       37 |        0 |      148      0 |       22 |       22
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 37
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07	c lower bound updated to 59
0.00/0.07	c BCD2: 59 <= obj <= 63
0.00/0.07	c BCD2: #cores=37, #unrelaxed=8, #relaxed=120, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=60 bias=60/61
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       22 |       22
0.00/0.07	c  0.0s |       0 |       38 |        0 |      148      0 |       22 |       22
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 38
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	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.07	c lower bound updated to 60
0.00/0.07	c BCD2: 60 <= obj <= 63
0.00/0.07	c BCD2: #cores=37, #unrelaxed=6, #relaxed=122, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=61 bias=61/62
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       23 |       22
0.00/0.07	c  0.0s |       0 |       38 |        0 |      148      0 |       23 |       23
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 38
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.07	c lower bound updated to 61
0.00/0.07	c BCD2: 61 <= obj <= 63
0.00/0.07	c BCD2: #cores=38, #unrelaxed=4, #relaxed=124, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=62 bias=62/63
0.00/0.07	c Solving starts ...
0.00/0.07	c ============================[ Search Statistics ]============================
0.00/0.07	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.07	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.07	c =============================================================================
0.00/0.07	c  0.0s |       0 |        0 |        0 |      148      0 |       23 |       23
0.00/0.07	c  0.0s |       0 |       39 |        0 |      148      0 |       23 |       23
0.00/0.07	c #cpu_time = 0.000s
0.00/0.07	c #wall_clock_time = 0.000s
0.00/0.07	c #decision = 39
0.00/0.07	c #random_decision = 0
0.00/0.07	c #conflict = 0
0.00/0.07	c #restart = 0
0.00/0.07	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.07	c lower bound updated to 62
0.00/0.08	c BCD2: 62 <= obj <= 63
0.00/0.08	c BCD2: #cores=38, #unrelaxed=2, #relaxed=126, #hardened=0
0.00/0.08	c BCD2: #sat=1 #unsat=63 bias=63/64
0.00/0.08	c Solving starts ...
0.00/0.08	c ============================[ Search Statistics ]============================
0.00/0.08	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.08	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.08	c =============================================================================
0.00/0.08	c  0.0s |       0 |        0 |        0 |      148      0 |       24 |       23
0.00/0.08	c  0.0s |       0 |       40 |        1 |      148      0 |       24 |       24
0.00/0.08	c #cpu_time = 0.000s
0.00/0.08	c #wall_clock_time = 0.000s
0.00/0.08	c #decision = 40
0.00/0.08	c #random_decision = 0
0.00/0.08	c #conflict = 1
0.00/0.08	c #restart = 0
0.00/0.08	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.08	c lower bound updated to 63
0.00/0.08	c BCD2: 63 <= obj <= 63
0.00/0.08	c BCD2: #cores=39, #unrelaxed=0, #relaxed=128, #hardened=0
0.00/0.08	c BCD2: #sat=1 #unsat=64 bias=64/65
0.00/0.08	c Solving starts ...
0.00/0.08	c ============================[ Search Statistics ]============================
0.00/0.08	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.08	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.08	c =============================================================================
0.00/0.08	c  0.0s |       0 |        0 |        0 |      148      0 |       24 |       24
0.00/0.08	c  0.0s |       0 |       75 |        8 |      148      0 |       24 |       24
0.00/0.08	c #cpu_time = 0.002s
0.00/0.08	c #wall_clock_time = 0.002s
0.00/0.08	c #decision = 75
0.00/0.08	c #random_decision = 0
0.00/0.08	c #conflict = 8
0.00/0.08	c #restart = 0
0.00/0.08	c BCD2: relaxing 0 and merging with 5 cores into a new core of size 20: cost of the new core is >=10
0.00/0.08	c lower bound updated to 64
0.00/0.08	s OPTIMUM FOUND
0.00/0.08	v x1 -x2 -x3 x4 x5 -x6 -x7 x8 -x9 x10
0.00/0.08	v -x11 x12 -x13 x14 -x15 x16 -x17 x18 -x19 x20
0.00/0.08	v -x21 x22 -x23 x24 -x25 x26 -x27 x28 -x29 x30
0.00/0.08	v -x31 x32 -x33 x34 -x35 x36 -x37 x38 -x39 x40
0.00/0.08	v -x41 x42 -x43 x44 -x45 x46 -x47 x48 -x49 x50
0.00/0.08	v -x51 x52 -x53 x54 -x55 x56 -x57 x58 -x59 x60
0.00/0.08	v -x61 x62 x63 -x64 -x65 x66 -x67 x68 x69 -x70
0.00/0.08	v x71 -x72 -x73 x74 x75 -x76 x77 -x78 -x79 x80
0.00/0.08	v x81 -x82 x83 -x84 x85 -x86 x87 -x88 x89 -x90
0.00/0.08	v -x91 x92 x93 -x94 x95 -x96 x97 -x98 x99 -x100
0.00/0.08	v x101 -x102 -x103 x104 x105 -x106 x107 -x108 x109 -x110
0.00/0.08	v x111 -x112 x113 -x114 -x115 x116 x117 -x118 -x119 x120
0.00/0.08	v x121 -x122 x123 -x124 x125 -x126 -x127 x128
0.00/0.08	c total CPU time = 0.081s
0.00/0.08	c total wall clock time = 0.081s

Verifier Data 

OK	64

Watcher Data 

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-4079522-1465232903/watcher-4079522-1465232903 -o /tmp/evaluation-result-4079522-1465232903/solver-4079522-1465232903 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node117-1465227498-31671 --watchdog 1960 toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4079522-1465232903.opb 

pid=32369
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.12 2.20 2.18 4/179 32372
/proc/meminfo: memFree=29212008/32872528 swapFree=17892/1720544
[pid=32372] ppid=32369 vsize=704956 CPUtime=0 cores=0,2,4,6
/proc/32372/stat : 32372 (toysat) R 32369 32372 31655 0 -1 4202496 2629 0 0 0 0 0 0 0 20 0 4 0 105223477 721874944 2989 33554432000 4194304 16246674 140735771258240 140735771257664 13880264 0 2 0 34082818 18446744073709551615 0 0 17 4 0 0 0 0 0
/proc/32372/statm: 177007 2999 441 2943 0 173901 0
[pid=32372/tid=32373] ppid=32369 vsize=723388 CPUtime=0 cores=0,2,4,6
/proc/32372/task/32373/stat : 32373 (toysat) S 32369 32372 31655 0 -1 4202560 10 0 0 0 0 0 0 0 20 0 4 0 105223477 740749312 3059 33554432000 4194304 16246674 140735771258240 139684471614704 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 2 0 0 0 0 0
[pid=32372/tid=32374] ppid=32369 vsize=727484 CPUtime=0 cores=0,2,4,6
/proc/32372/task/32374/stat : 32374 (toysat) S 32369 32372 31655 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 105223477 744943616 3076 33554432000 4194304 16246674 140735771258240 139684461124848 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 4 0 0 0 0 0
[pid=32372/tid=32375] ppid=32369 vsize=731580 CPUtime=0 cores=0,2,4,6
/proc/32372/task/32375/stat : 32375 (toysat) S 32369 32372 31655 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 105223477 749137920 3091 33554432000 4194304 16246674 140735771258240 139684348947632 14069300 0 0 0 34082818 18446744071579510697 0 0 -1 2 0 0 0 0 0

Solver just ended.
??? exit watcher main loop
??? sigkill at end of watcher main loop
??? kill 32372 sig 9
??? kill -32372 sig 9
??? end of watcher thread
Dumping a history of the last processes samples

Child status: 0
Real time (s): 0.0889581
CPU time (s): 0.082987
CPU user time (s): 0.045993
CPU system time (s): 0.036994
CPU usage (%): 93.2878
Max. virtual memory (cumulated for all children) (KiB): 0

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.045993
system time used= 0.036994
maximum resident set size= 78180
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 19207
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= 22
involuntary context switches= 4

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.001999 second user time and 0.007998 second system time

The end

Launcher Data 

Begin job on node117 at 2016-06-06 19:08:23
IDJOB=4079522
IDBENCH=2108
IDSOLVER=2542
FILE ID=node117/4079522-1465232903
RUNJOBID= node117-1465227498-31671
PBS_JOBID= 19843241
Free space on /tmp= 71724 MiB

SOLVER NAME= toysat 2016-05-02
BENCH NAME= PB06//final/normalized-PB06/OPT-SMALLINT/submitted-PB05/manquinho/primes-dimacs-cnf/normalized-par8-1-c.opb
COMMAND LINE= toysat +RTS -H1G -MMEMLIMITm -K1G -RTS --pb --search=bcd2 BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4079522-1465232903/watcher-4079522-1465232903 -o /tmp/evaluation-result-4079522-1465232903/solver-4079522-1465232903 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node117-1465227498-31671 --watchdog 1960  toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4079522-1465232903.opb

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 15500 MiB
NBCORE= 4

MD5SUM BENCH= a203c9ef5477e7407dcfddbe5a4b9f8e
RANDOM SEED=573828642

node117.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.088
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
initial apicid	: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5334.17
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.088
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
initial apicid	: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.088
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
initial apicid	: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.088
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
initial apicid	: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.56
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 4
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.088
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
initial apicid	: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.54
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.088
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
initial apicid	: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 6
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.088
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
initial apicid	: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.53
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 7
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2667.088
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
initial apicid	: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32872528 kB
MemFree:        29211908 kB
Buffers:           23616 kB
Cached:            96844 kB
SwapCached:         1400 kB
Active:          1190848 kB
Inactive:          44448 kB
Active(anon):    1114960 kB
Inactive(anon):     2180 kB
Active(file):      75888 kB
Inactive(file):    42268 kB
Unevictable:     1720544 kB
Mlocked:           17892 kB
SwapTotal:      67108856 kB
SwapFree:       67098976 kB
Dirty:             16360 kB
Writeback:            68 kB
AnonPages:       2837040 kB
Mapped:            10580 kB
Shmem:                 0 kB
Slab:             567660 kB
SReclaimable:      11788 kB
SUnreclaim:       555872 kB
KernelStack:        1456 kB
PageTables:         9664 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545120 kB
Committed_AS:    2980704 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346412 kB
VmallocChunk:   34341988032 kB
HardwareCorrupted:     0 kB
AnonHugePages:   2357248 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:        7552 kB
DirectMap2M:    33538048 kB

Free space on /tmp at the end= 71708 MiB
End job on node117 at 2016-06-06 19:08:23