Trace number 4102393

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-02OPT67 0.090985 0.0915269

General information on the benchmark

Namenormalized-PB06/OPT-SMALLINT/submitted-PB05/
manquinho/primes-dimacs-cnf/normalized-par8-4-c.opb
MD5SUM3fc0f05f9473baae5c6e275c75745a2b
Bench CategoryOPT-SMALLINT (optimisation, small integers)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark67
Best CPU time to get the best result obtained on this benchmark0.002998
Has Objective FunctionYES
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function 67
Optimality of the best value was proved YES
Number of variables134
Total number of constraints333
Number of constraints which are clauses333
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 134
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 134
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 134
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-18T08:06: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-4102393-1466229983.opb"]
0.00/0.01	c use --random-gen="2390715252 669672578 3409457209 2829335838 323001143 3530599532 1378497524 4045423912 2530523010 4273697169 3645333809 3030501176 1941083976 1115002874 2820425363 1037515961 3429704059 1169176277 1601180057 324697865 2841667206 1666680440 864815036 4120680342 1443931214 4049537421 2252999293 1642062233 3725362126 1382690690 2290740416 2894373781 451282925 2543106415 3091194494 2624922402 3936626284 4073792621 4153054690 3265485716 4005437588 219748260 818974577 1592401459 1420303762 3922809529 2199371597 483100388 670729371 1232839195 2104073941 2158893097 241787295 3187378735 2752962407 2366005313 3010396640 3070668250 2774536357 1906054284 3390453909 2297614657 30555764 3288097536 3872216702 2349698778 907584469 1854929433 1200594813 4259798247 3833043753 2393130363 3765740041 2079354293 2432460243 439926046 123602775 1305189294 1190909801 502155281 4096283472 1155268530 1899925673 2534484299 4184158198 494870967 1805788959 3178790794 875258238 1838075189 3592223345 1173950278 644991404 3791463865 2548853928 344601013 1078659611 1696551568 3598495933 454416954 1205023473 3576884061 2611382154 1802550686 3363809015 3246760013 2715360623 3561499707 3717273244 4289239668 734809114 799815190 925128205 107854627 2692909138 1972721494 3160883590 2269468499 2630306213 197798066 2219381267 767549830 3214544550 2039727207 1033395445 976730812 1290428000 9206575 4231175266 2132924730 3937131222 37718514 579177061 4213994294 3264627492 2657557648 334129811 3846987944 2701841642 3745017398 1726405166 3543311576 2475200886 2412263672 1039990597 970153832 2971591016 2467051122 620190337 2897012036 1910314229 1327833829 3837568 156141396 3762760452 2359141064 1553908121 2032725889 3685156531 3524015690 3691693528 3986447306 219668140 3174175467 1967039656 2587238256 357912502 1762701894 2174785867 1475790119 3248360093 2653156002 2895669793 621622690 2845580781 2875611129 3206602358 1989805517 138694016 3742626528 1879078117 2600025888 2430133798 882014927 3578375967 1658664278 2234110366 1797373378 2880301914 2051258374 78308936 2452081787 3830258491 4190894971 4130019212 1014140350 3788569167 2885889532 3776322416 3267110919 3105876646 3876874962 1991791683 3128334515 2696873879 1034109411 658575721 2015339345 1272786200 4287622188 4061574969 1627013444 3382649617 827660747 2856641582 2875738634 3764432488 2924479318 3727455879 3314045695 1632501373 4165682897 3317836032 3270433705 681330386 1215388667 3811842476 4241041833 1835465595 1549953316 2946763879 3577925934 2498939198 712381065 1582062616 3501045186 163944556 1867212097 2658359587 2462630802 263196625 875222260 3008273781 2811704376 430628509 4086018257 2466810092 1174229124 981917006 1220481937 678463144 257676692 1837649126 3568645352 2464637974 828846163 255 362436" option to reproduce the execution
0.00/0.01	c #vars 134
0.00/0.01	c #constraints 333
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 |      155      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       11 |        7 |      155      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 = 7
0.00/0.02	c #restart = 0
0.00/0.02	o 67
0.00/0.02	c BCD2: updating upper bound: 134 -> 66
0.00/0.02	c BCD2: 0 <= obj <= 66
0.00/0.02	c BCD2: #cores=0, #unrelaxed=134, #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 |      155      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |        3 |        2 |      155      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 <= 66
0.00/0.02	c BCD2: #cores=1, #unrelaxed=132, #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 |      155      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |        4 |        2 |      155      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 <= 66
0.00/0.02	c BCD2: #cores=2, #unrelaxed=130, #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 |      155      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |        7 |        2 |      155      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 <= 66
0.00/0.02	c BCD2: #cores=3, #unrelaxed=128, #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 |      155      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |        8 |        2 |      155      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 = 8
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 <= 66
0.00/0.02	c BCD2: #cores=4, #unrelaxed=126, #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 |      155      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |        9 |        2 |      155      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 = 9
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 <= 66
0.00/0.02	c BCD2: #cores=5, #unrelaxed=124, #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 |      155      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       16 |        2 |      155      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 = 16
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 <= 66
0.00/0.02	c BCD2: #cores=6, #unrelaxed=122, #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 |      155      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       21 |        2 |      155      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 = 21
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 <= 66
0.00/0.02	c BCD2: #cores=7, #unrelaxed=120, #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 |      155      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       22 |        2 |      155      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 = 22
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 8
0.00/0.03	c BCD2: 8 <= obj <= 66
0.00/0.03	c BCD2: #cores=8, #unrelaxed=118, #relaxed=16, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=9 bias=9/10
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      155      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       27 |        2 |      155      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 <= 66
0.00/0.03	c BCD2: #cores=9, #unrelaxed=116, #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 |      155      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       28 |        2 |      155      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 = 28
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 <= 66
0.00/0.03	c BCD2: #cores=10, #unrelaxed=114, #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 |      155      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       29 |        2 |      155      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 = 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 11
0.00/0.03	c BCD2: 11 <= obj <= 66
0.00/0.03	c BCD2: #cores=11, #unrelaxed=112, #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 |      155      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       34 |        2 |      155      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: found a new core of size 2: cost of the new core is >=1
0.00/0.03	c lower bound updated to 12
0.00/0.03	c BCD2: 12 <= obj <= 66
0.00/0.03	c BCD2: #cores=12, #unrelaxed=110, #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 |      155      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       35 |        2 |      155      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 = 35
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 13
0.00/0.03	c BCD2: 13 <= obj <= 66
0.00/0.03	c BCD2: #cores=13, #unrelaxed=108, #relaxed=26, #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 |      155      0 |        0 |        0
0.00/0.03	c  0.0s |       0 |       36 |        2 |      155      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 = 36
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 14
0.00/0.03	c BCD2: 14 <= obj <= 66
0.00/0.03	c BCD2: #cores=13, #unrelaxed=106, #relaxed=28, #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 |      155      0 |        1 |        0
0.00/0.03	c  0.0s |       0 |       34 |        2 |      155      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 = 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: 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 <= 66
0.00/0.03	c BCD2: #cores=14, #unrelaxed=104, #relaxed=30, #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 |      155      0 |        1 |        1
0.00/0.03	c  0.0s |       0 |       33 |        2 |      155      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 = 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 <= 66
0.00/0.03	c BCD2: #cores=15, #unrelaxed=102, #relaxed=32, #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 |      155      0 |        1 |        1
0.00/0.03	c  0.0s |       0 |       32 |        2 |      155      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 = 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 17
0.00/0.03	c BCD2: 17 <= obj <= 66
0.00/0.03	c BCD2: #cores=16, #unrelaxed=100, #relaxed=34, #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 |      155      0 |        1 |        1
0.00/0.03	c  0.0s |       0 |       31 |        2 |      155      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 = 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: 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 18
0.00/0.03	c BCD2: 18 <= obj <= 66
0.00/0.03	c BCD2: #cores=16, #unrelaxed=98, #relaxed=36, #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 |      155      0 |        2 |        1
0.00/0.03	c  0.0s |       0 |       29 |        2 |      155      0 |        2 |        2
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 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: 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 19
0.00/0.03	c BCD2: 19 <= obj <= 66
0.00/0.03	c BCD2: #cores=16, #unrelaxed=96, #relaxed=38, #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.04	c  0.0s |       0 |        0 |        0 |      155      0 |        3 |        2
0.00/0.04	c  0.0s |       0 |       27 |        2 |      155      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 = 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: found a new core of size 2: cost of the new core is >=1
0.00/0.04	c lower bound updated to 20
0.00/0.04	c BCD2: 20 <= obj <= 66
0.00/0.04	c BCD2: #cores=17, #unrelaxed=94, #relaxed=40, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=21 bias=21/22
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |      155      0 |        3 |        3
0.00/0.04	c  0.0s |       0 |       28 |        2 |      155      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 <= 66
0.00/0.04	c BCD2: #cores=18, #unrelaxed=92, #relaxed=42, #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 |      155      0 |        3 |        3
0.00/0.04	c  0.0s |       0 |       27 |        2 |      155      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 = 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: 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 <= 66
0.00/0.04	c BCD2: #cores=19, #unrelaxed=90, #relaxed=44, #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 |      155      0 |        3 |        3
0.00/0.04	c  0.0s |       0 |       28 |        2 |      155      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 23
0.00/0.04	c BCD2: 23 <= obj <= 66
0.00/0.04	c BCD2: #cores=20, #unrelaxed=88, #relaxed=46, #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 |      155      0 |        3 |        3
0.00/0.04	c  0.0s |       0 |       31 |        2 |      155      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: found a new core of size 2: cost of the new core is >=1
0.00/0.04	c lower bound updated to 24
0.00/0.04	c BCD2: 24 <= obj <= 66
0.00/0.04	c BCD2: #cores=21, #unrelaxed=86, #relaxed=48, #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 |      155      0 |        3 |        3
0.00/0.04	c  0.0s |       0 |       32 |        2 |      155      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 = 32
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 <= 66
0.00/0.04	c BCD2: #cores=21, #unrelaxed=84, #relaxed=50, #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 |      155      0 |        4 |        3
0.00/0.04	c  0.0s |       0 |       32 |        2 |      155      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 = 32
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 26
0.00/0.04	c BCD2: 26 <= obj <= 66
0.00/0.04	c BCD2: #cores=21, #unrelaxed=82, #relaxed=52, #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 |      155      0 |        5 |        4
0.00/0.04	c  0.0s |       0 |       32 |        2 |      155      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 = 32
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 27
0.00/0.04	c BCD2: 27 <= obj <= 66
0.00/0.04	c BCD2: #cores=22, #unrelaxed=80, #relaxed=54, #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 |      155      0 |        5 |        5
0.00/0.04	c  0.0s |       0 |       33 |        2 |      155      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 = 33
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 <= 66
0.00/0.04	c BCD2: #cores=23, #unrelaxed=78, #relaxed=56, #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 |      155      0 |        5 |        5
0.00/0.04	c  0.0s |       0 |       32 |        2 |      155      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 = 32
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 <= 66
0.00/0.04	c BCD2: #cores=23, #unrelaxed=76, #relaxed=58, #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 |      155      0 |        6 |        5
0.00/0.04	c  0.0s |       0 |       30 |        2 |      155      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 = 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 30
0.00/0.04	c BCD2: 30 <= obj <= 66
0.00/0.04	c BCD2: #cores=23, #unrelaxed=74, #relaxed=60, #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.05	c  0.0s |       0 |        0 |        0 |      155      0 |        7 |        6
0.00/0.05	c  0.0s |       0 |       28 |        2 |      155      0 |        7 |        7
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 = 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 31
0.00/0.05	c BCD2: 31 <= obj <= 66
0.00/0.05	c BCD2: #cores=23, #unrelaxed=72, #relaxed=62, #hardened=0
0.00/0.05	c BCD2: #sat=1 #unsat=32 bias=32/33
0.00/0.05	c Solving starts ...
0.00/0.05	c ============================[ Search Statistics ]============================
0.00/0.05	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.05	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.05	c =============================================================================
0.00/0.05	c  0.0s |       0 |        0 |        0 |      155      0 |        8 |        7
0.00/0.05	c  0.0s |       0 |       28 |        3 |      155      0 |        8 |        8
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 = 3
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 <= 66
0.00/0.05	c BCD2: #cores=23, #unrelaxed=70, #relaxed=64, #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 |      155      0 |        9 |        8
0.00/0.05	c  0.0s |       0 |       25 |        1 |      155      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 = 1
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.05	c lower bound updated to 33
0.00/0.05	c BCD2: 33 <= obj <= 66
0.00/0.05	c BCD2: #cores=24, #unrelaxed=68, #relaxed=66, #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 |      155      0 |        9 |        9
0.00/0.05	c  0.0s |       0 |       29 |        2 |      155      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 = 29
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 34
0.00/0.05	c BCD2: 34 <= obj <= 66
0.00/0.05	c BCD2: #cores=24, #unrelaxed=66, #relaxed=68, #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 |      155      0 |       10 |        9
0.00/0.05	c  0.0s |       0 |       27 |        2 |      155      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 = 27
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 2
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.05	c lower bound updated to 35
0.00/0.05	c BCD2: 35 <= obj <= 66
0.00/0.05	c BCD2: #cores=25, #unrelaxed=64, #relaxed=70, #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 |      155      0 |       10 |       10
0.00/0.05	c  0.0s |       0 |       28 |        2 |      155      0 |       10 |       10
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 = 28
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 36
0.00/0.05	c BCD2: 36 <= obj <= 66
0.00/0.05	c BCD2: #cores=25, #unrelaxed=62, #relaxed=72, #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 |      155      0 |       11 |       10
0.00/0.05	c  0.0s |       0 |       26 |        0 |      155      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 <= 66
0.00/0.05	c BCD2: #cores=26, #unrelaxed=60, #relaxed=74, #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 |      155      0 |       11 |       11
0.00/0.05	c  0.0s |       0 |       27 |        0 |      155      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 <= 66
0.00/0.05	c BCD2: #cores=26, #unrelaxed=58, #relaxed=76, #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 |      155      0 |       12 |       11
0.00/0.05	c  0.0s |       0 |       27 |        0 |      155      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 <= 66
0.00/0.05	c BCD2: #cores=27, #unrelaxed=56, #relaxed=78, #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 |      155      0 |       12 |       12
0.00/0.05	c  0.0s |       0 |       28 |        0 |      155      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 <= 66
0.00/0.05	c BCD2: #cores=27, #unrelaxed=54, #relaxed=80, #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 |      155      0 |       13 |       12
0.00/0.06	c  0.0s |       0 |       28 |        0 |      155      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 = 28
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 41
0.00/0.06	c BCD2: 41 <= obj <= 66
0.00/0.06	c BCD2: #cores=28, #unrelaxed=52, #relaxed=82, #hardened=0
0.00/0.06	c BCD2: #sat=1 #unsat=42 bias=42/43
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 |      155      0 |       13 |       13
0.00/0.06	c  0.0s |       0 |       29 |        0 |      155      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 <= 66
0.00/0.06	c BCD2: #cores=28, #unrelaxed=50, #relaxed=84, #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 |      155      0 |       14 |       13
0.00/0.06	c  0.0s |       0 |       29 |        0 |      155      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 <= 66
0.00/0.06	c BCD2: #cores=29, #unrelaxed=48, #relaxed=86, #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 |      155      0 |       14 |       14
0.00/0.06	c  0.0s |       0 |       30 |        0 |      155      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 <= 66
0.00/0.06	c BCD2: #cores=29, #unrelaxed=46, #relaxed=88, #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 |      155      0 |       15 |       14
0.00/0.06	c  0.0s |       0 |       30 |        0 |      155      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 <= 66
0.00/0.06	c BCD2: #cores=30, #unrelaxed=44, #relaxed=90, #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 |      155      0 |       15 |       15
0.00/0.06	c  0.0s |       0 |       31 |        0 |      155      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 <= 66
0.00/0.06	c BCD2: #cores=30, #unrelaxed=42, #relaxed=92, #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 |      155      0 |       16 |       15
0.00/0.06	c  0.0s |       0 |       31 |        0 |      155      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 <= 66
0.00/0.06	c BCD2: #cores=31, #unrelaxed=40, #relaxed=94, #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 |      155      0 |       16 |       16
0.00/0.06	c  0.0s |       0 |       32 |        0 |      155      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 <= 66
0.00/0.06	c BCD2: #cores=31, #unrelaxed=38, #relaxed=96, #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 |      155      0 |       17 |       16
0.00/0.06	c  0.0s |       0 |       32 |        0 |      155      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 <= 66
0.00/0.06	c BCD2: #cores=32, #unrelaxed=36, #relaxed=98, #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 |      155      0 |       17 |       17
0.00/0.06	c  0.0s |       0 |       33 |        0 |      155      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 <= 66
0.00/0.06	c BCD2: #cores=32, #unrelaxed=34, #relaxed=100, #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 |      155      0 |       18 |       17
0.00/0.06	c  0.0s |       0 |       33 |        0 |      155      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.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 51
0.00/0.07	c BCD2: 51 <= obj <= 66
0.00/0.07	c BCD2: #cores=33, #unrelaxed=32, #relaxed=102, #hardened=0
0.00/0.07	c BCD2: #sat=1 #unsat=52 bias=52/53
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 |      155      0 |       18 |       18
0.00/0.07	c  0.0s |       0 |       34 |        0 |      155      0 |       18 |       18
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: 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 <= 66
0.00/0.07	c BCD2: #cores=33, #unrelaxed=30, #relaxed=104, #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 |      155      0 |       19 |       18
0.00/0.07	c  0.0s |       0 |       34 |        0 |      155      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 <= 66
0.00/0.07	c BCD2: #cores=34, #unrelaxed=28, #relaxed=106, #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 |      155      0 |       19 |       19
0.00/0.07	c  0.0s |       0 |       35 |        0 |      155      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 <= 66
0.00/0.07	c BCD2: #cores=34, #unrelaxed=26, #relaxed=108, #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 |      155      0 |       20 |       19
0.00/0.07	c  0.0s |       0 |       35 |        0 |      155      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 <= 66
0.00/0.07	c BCD2: #cores=35, #unrelaxed=24, #relaxed=110, #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 |      155      0 |       20 |       20
0.00/0.07	c  0.0s |       0 |       36 |        0 |      155      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 <= 66
0.00/0.07	c BCD2: #cores=35, #unrelaxed=22, #relaxed=112, #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 |      155      0 |       21 |       20
0.00/0.07	c  0.0s |       0 |       36 |        0 |      155      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 <= 66
0.00/0.07	c BCD2: #cores=36, #unrelaxed=20, #relaxed=114, #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 |      155      0 |       21 |       21
0.00/0.07	c  0.0s |       0 |       37 |        0 |      155      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 <= 66
0.00/0.07	c BCD2: #cores=36, #unrelaxed=18, #relaxed=116, #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 |      155      0 |       22 |       21
0.00/0.07	c  0.0s |       0 |       37 |        0 |      155      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 <= 66
0.00/0.07	c BCD2: #cores=37, #unrelaxed=16, #relaxed=118, #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 |      155      0 |       22 |       22
0.00/0.07	c  0.0s |       0 |       38 |        0 |      155      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 <= 66
0.00/0.07	c BCD2: #cores=37, #unrelaxed=14, #relaxed=120, #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 |      155      0 |       23 |       22
0.00/0.07	c  0.0s |       0 |       38 |        0 |      155      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.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 61
0.00/0.08	c BCD2: 61 <= obj <= 66
0.00/0.08	c BCD2: #cores=38, #unrelaxed=12, #relaxed=122, #hardened=0
0.00/0.08	c BCD2: #sat=1 #unsat=62 bias=62/63
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 |      155      0 |       23 |       23
0.00/0.08	c  0.0s |       0 |       39 |        0 |      155      0 |       23 |       23
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 = 39
0.00/0.08	c #random_decision = 0
0.00/0.08	c #conflict = 0
0.00/0.08	c #restart = 0
0.00/0.08	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.08	c lower bound updated to 62
0.00/0.08	c BCD2: 62 <= obj <= 66
0.00/0.08	c BCD2: #cores=38, #unrelaxed=10, #relaxed=124, #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 |      155      0 |       24 |       23
0.00/0.08	c  0.0s |       0 |       39 |        0 |      155      0 |       24 |       24
0.00/0.08	c #cpu_time = 0.001s
0.00/0.08	c #wall_clock_time = 0.001s
0.00/0.08	c #decision = 39
0.00/0.08	c #random_decision = 0
0.00/0.08	c #conflict = 0
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 <= 66
0.00/0.08	c BCD2: #cores=39, #unrelaxed=8, #relaxed=126, #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 |      155      0 |       24 |       24
0.00/0.08	c  0.0s |       0 |       40 |        0 |      155      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 = 0
0.00/0.08	c #restart = 0
0.00/0.08	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.08	c lower bound updated to 64
0.00/0.08	c BCD2: 64 <= obj <= 66
0.00/0.08	c BCD2: #cores=39, #unrelaxed=6, #relaxed=128, #hardened=0
0.00/0.08	c BCD2: #sat=1 #unsat=65 bias=65/66
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 |      155      0 |       25 |       24
0.00/0.08	c  0.0s |       0 |       40 |        0 |      155      0 |       25 |       25
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 = 0
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 65
0.00/0.08	c BCD2: 65 <= obj <= 66
0.00/0.08	c BCD2: #cores=40, #unrelaxed=4, #relaxed=130, #hardened=0
0.00/0.08	c BCD2: #sat=1 #unsat=66 bias=66/67
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 |      155      0 |       25 |       25
0.00/0.08	c  0.0s |       0 |       41 |        0 |      155      0 |       25 |       25
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 = 41
0.00/0.08	c #random_decision = 0
0.00/0.08	c #conflict = 0
0.00/0.08	c #restart = 0
0.00/0.08	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.08	c lower bound updated to 66
0.00/0.08	c BCD2: hardening fixes 2 literals
0.00/0.08	c BCD2: 66 <= obj <= 66
0.00/0.08	c BCD2: #cores=40, #unrelaxed=0, #relaxed=132, #hardened=2
0.00/0.08	c BCD2: #sat=1 #unsat=67 bias=67/68
0.00/0.08	c Solving starts ...
0.00/0.08	c lower bound updated to 67
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 x129 -x130
0.00/0.08	v -x131 x132 -x133 x134
0.00/0.08	c total CPU time = 0.083s
0.00/0.08	c total wall clock time = 0.083s

Verifier Data 

OK	67

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

pid=4375
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.23 2.26 2.26 4/179 4378
/proc/meminfo: memFree=28928968/32872528 swapFree=17888/1798212
[pid=4378] ppid=4375 vsize=668092 CPUtime=0 cores=0,2,4,6
/proc/4378/stat : 4378 (toysat) R 4375 4378 579 0 -1 4202496 2482 0 0 0 0 0 0 0 20 0 4 0 25045432 684126208 3353 33554432000 4194304 16246674 140737251446256 140737251445680 13880264 0 2 0 34082818 18446744073709551615 0 0 17 4 0 0 0 0 0
/proc/4378/statm: 167791 3361 441 2943 0 164685 0
[pid=4378/tid=4379] ppid=4375 vsize=686524 CPUtime=0 cores=0,2,4,6
/proc/4378/task/4379/stat : 4379 (toysat) S 4375 4378 579 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 25045433 703000576 3423 33554432000 4194304 16246674 140737251446256 139715908971760 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 2 0 0 0 0 0
[pid=4378/tid=4380] ppid=4375 vsize=690620 CPUtime=0 cores=0,2,4,6
/proc/4378/task/4380/stat : 4380 (toysat) S 4375 4378 579 0 -1 4202560 7 0 0 0 0 0 0 0 20 0 4 0 25045433 707194880 3441 33554432000 4194304 16246674 140737251446256 139715822988528 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 4 0 0 0 0 0
[pid=4378/tid=4381] ppid=4375 vsize=694716 CPUtime=0 cores=0,2,4,6
/proc/4378/task/4381/stat : 4381 (toysat) S 4375 4378 579 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 25045433 711389184 3457 33554432000 4194304 16246674 140737251446256 139715812514992 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 4378 sig 9
??? kill -4378 sig 9
??? end of watcher thread
Dumping a history of the last processes samples

Child status: 0
Real time (s): 0.0915269
CPU time (s): 0.090985
CPU user time (s): 0.049992
CPU system time (s): 0.040993
CPU usage (%): 99.4079
Max. virtual memory (cumulated for all children) (KiB): 0

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.049992
system time used= 0.040993
maximum resident set size= 82048
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 19663
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= 21
involuntary context switches= 4

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.003999 second user time and 0.005999 second system time

The end

Launcher Data 

Begin job on node123 at 2016-06-18 08:06:23
IDJOB=4102393
IDBENCH=2112
IDSOLVER=2542
FILE ID=node123/4102393-1466229983
RUNJOBID= node123-1466206081-595
PBS_JOBID= 19918154
Free space on /tmp= 71620 MiB

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

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

MD5SUM BENCH= 3fc0f05f9473baae5c6e275c75745a2b
RANDOM SEED=783944015

node123.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		: 2666.791
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	: 5333.58
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		: 2666.791
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		: 2666.791
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.56
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		: 2666.791
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.57
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		: 2666.791
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.56
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		: 2666.791
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.56
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		: 2666.791
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.56
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		: 2666.791
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:        28929332 kB
Buffers:          126664 kB
Cached:           176264 kB
SwapCached:         1648 kB
Active:          1199644 kB
Inactive:         205364 kB
Active(anon):    1103372 kB
Inactive(anon):     1152 kB
Active(file):      96272 kB
Inactive(file):   204212 kB
Unevictable:     1798212 kB
Mlocked:           17888 kB
SwapTotal:      67108856 kB
SwapFree:       67099316 kB
Dirty:             16652 kB
Writeback:             0 kB
AnonPages:       2899748 kB
Mapped:            10932 kB
Shmem:                 0 kB
Slab:             603696 kB
SReclaimable:      47348 kB
SUnreclaim:       556348 kB
KernelStack:        1448 kB
PageTables:         9712 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545120 kB
Committed_AS:    3043604 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346412 kB
VmallocChunk:   34341988032 kB
HardwareCorrupted:     0 kB
AnonHugePages:   1785856 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= 71604 MiB
End job on node123 at 2016-06-18 08:06:23