Trace number 4102305

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-02OPT50 0.05799 0.05946

General information on the benchmark

Namenormalized-PB06/OPT-SMALLINT/submitted-PB05/manquinho/
primes-dimacs-cnf/normalized-aim-50-3_4-yes1-4.opb
MD5SUMae71e7f3830a7f496580905b76db98c8
Bench CategoryOPT-SMALLINT (optimisation, small integers)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark50
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 50
Optimality of the best value was proved YES
Number of variables100
Total number of constraints220
Number of constraints which are clauses218
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints2
Minimum length of a constraint2
Maximum length of a constraint3
Number of terms in the objective function 100
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 100
Number of bits of the sum of numbers in the objective function 7
Biggest number in a constraint 2
Number of bits of the biggest number in a constraint 2
Biggest sum of numbers in a constraint 100
Number of bits of the biggest sum of numbers7
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:04:41+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-4102305-1466229881.opb"]
0.00/0.01	c use --random-gen="2446821133 1969392695 1707277332 2165778375 4098723764 592504062 198651422 3412914678 2028932521 3414520134 2052339624 1330694460 2273947419 415429842 3305987336 933873783 23920646 488690176 189626964 3655543384 2474351473 573123115 1073775700 1154931012 3711808608 1006696785 1561252464 2472706321 3172221529 2795554137 1482992028 1290852038 3830871446 1897849558 2519184364 1777712444 1827944695 805668754 2075925510 2188948673 1363478797 1787120861 1544395266 1715699343 1943135923 2468172647 1062961604 1598949303 1442827274 523102156 120779666 704424021 1332499481 3445985656 2534718251 14028939 1192020050 1123731779 1804897255 2153191795 2272341720 3956538848 3265865839 2004680040 1650155807 3261435630 1449253240 3475670209 2665190446 449785173 3717072713 2626802786 2088190831 3348246340 2229723074 3738920802 3845075988 1730496950 1939072294 3380834242 2118896066 102470367 686433414 4111638012 834810295 1242589051 1048558811 341812951 3357560413 325594392 3771863478 932920304 4237272181 1829295074 1469726161 155059064 1750781325 826424556 2074330310 2130336023 717271742 1803568787 3857425683 245456837 2066826596 50583307 1433110684 1400199359 2992306392 261551239 1776845092 1663465876 2199901560 1834622 3812264694 497462400 3492797884 2918846764 1075304374 3195160166 2046612976 1707714713 1171427081 3018785392 311185525 3738794641 71686649 3813402131 4142017318 832672396 3583253547 3212266788 843061022 483052289 2915816867 1666359278 2134915266 873538747 4030009394 1268452993 183236335 464305310 3086184821 2160471463 2354997015 4063246651 1683221986 2802796389 481468344 2792138271 907319716 1264681480 791705088 2448391482 2918132719 807965143 3969322899 1471918193 277424371 2565714939 3062680504 717676383 3873293959 2223839549 614497591 1149478998 3438827006 2648349478 3982677574 1526554648 2762531838 3500576254 2827790213 1609132591 3459642953 540267966 1167899176 2104474854 1159955802 768570003 3006084034 1575411531 4044926861 2126091285 4101359234 2342814370 353014683 1758157985 3568866416 150726014 3043193040 3853179415 628562771 679874491 243097645 1046008517 1341747670 412031598 1255786298 1731377244 361763371 2032906115 1343400485 55758441 3667507242 2859126171 3967101397 1912136665 616882452 1980543754 3723961113 2224556844 1663749029 4211795933 111944298 3183886225 3629804354 3683448016 258533640 1901663262 2694252847 727689564 1966284852 249667466 1453723262 441706104 2075274597 1494095666 3475875669 591996299 2284114543 4070282158 1967836387 3527689872 4178128590 2865052806 1829401241 2309413715 1759025446 2134033200 761019195 2547454192 155875558 3977656279 1010181095 2284123644 2150613550 3340878984 1357390162 1946112298 1238055098 3854001795 1496485590 3068175321 701488951 3267084510 255 362436" option to reproduce the execution
0.00/0.01	c #vars 100
0.00/0.01	c #constraints 220
0.00/0.01	c BCD2: Hardening is enabled.
0.00/0.01	c BCD2: BiasedSearch is enabled.
0.00/0.01	c Solving starts ...
0.00/0.01	c ============================[ Search Statistics ]============================
0.00/0.01	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.01	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.01	c =============================================================================
0.00/0.01	c  0.0s |       0 |        0 |        0 |      106      0 |        0 |        0
0.00/0.02	c  0.0s |       0 |       40 |       26 |      106      0 |        2 |        6
0.00/0.02	c #cpu_time = 0.003s
0.00/0.02	c #wall_clock_time = 0.003s
0.00/0.02	c #decision = 40
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 26
0.00/0.02	c #restart = 0
0.00/0.02	o 50
0.00/0.02	c BCD2: updating upper bound: 100 -> 49
0.00/0.02	c BCD2: 0 <= obj <= 49
0.00/0.02	c BCD2: #cores=0, #unrelaxed=100, #relaxed=0, #hardened=0
0.00/0.02	c BCD2: #sat=1 #unsat=1 bias=1/2
0.00/0.02	c Solving starts ...
0.00/0.02	c ============================[ Search Statistics ]============================
0.00/0.02	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.02	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.02	c =============================================================================
0.00/0.02	c  0.0s |       0 |        0 |        0 |      106      0 |        2 |        6
0.00/0.02	c  0.0s |       0 |        6 |        0 |      106      0 |        2 |        6
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 6
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 0
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.02	c lower bound updated to 1
0.00/0.02	c BCD2: 1 <= obj <= 49
0.00/0.02	c BCD2: #cores=1, #unrelaxed=96, #relaxed=4, #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 |      106      0 |        2 |        6
0.00/0.02	c  0.0s |       0 |       12 |        3 |      106      0 |        2 |        6
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 12
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 3
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 6: cost of the new core is >=2
0.00/0.02	c lower bound updated to 2
0.00/0.02	c BCD2: 2 <= obj <= 49
0.00/0.02	c BCD2: #cores=1, #unrelaxed=94, #relaxed=6, #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 |      106      0 |        3 |        6
0.00/0.02	c  0.0s |       0 |       10 |        1 |      106      0 |        3 |        7
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 10
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: 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 <= 49
0.00/0.02	c BCD2: #cores=2, #unrelaxed=92, #relaxed=8, #hardened=0
0.00/0.02	c BCD2: #sat=1 #unsat=4 bias=4/5
0.00/0.02	c Solving starts ...
0.00/0.02	c ============================[ Search Statistics ]============================
0.00/0.02	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.02	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.02	c =============================================================================
0.00/0.02	c  0.0s |       0 |        0 |        0 |      106      0 |        3 |        7
0.00/0.02	c  0.0s |       0 |       11 |        2 |      106      0 |        3 |        7
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 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: relaxing 3 and merging with 1 cores into a new core of size 9: cost of the new core is >=3
0.00/0.02	c lower bound updated to 4
0.00/0.02	c BCD2: 4 <= obj <= 49
0.00/0.02	c BCD2: #cores=2, #unrelaxed=89, #relaxed=11, #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 |      106      0 |        4 |        7
0.00/0.02	c  0.0s |       0 |        9 |        2 |      106      0 |        4 |        8
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 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 3: cost of the new core is >=1
0.00/0.02	c lower bound updated to 5
0.00/0.02	c BCD2: 5 <= obj <= 49
0.00/0.02	c BCD2: #cores=3, #unrelaxed=86, #relaxed=14, #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 |      106      0 |        4 |        8
0.00/0.02	c  0.0s |       0 |       11 |        1 |      106      0 |        4 |        8
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 11
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: found a new core of size 5: 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 <= 49
0.00/0.02	c BCD2: #cores=4, #unrelaxed=81, #relaxed=19, #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 |      106      0 |        4 |        8
0.00/0.02	c  0.0s |       0 |        9 |        1 |      106      0 |        4 |        8
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 9
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 4 and merging with 1 cores into a new core of size 7: cost of the new core is >=2
0.00/0.02	c lower bound updated to 7
0.00/0.02	c BCD2: 7 <= obj <= 49
0.00/0.02	c BCD2: #cores=4, #unrelaxed=77, #relaxed=23, #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 |      106      0 |        5 |        8
0.00/0.02	c  0.0s |       0 |       13 |        1 |      106      0 |        5 |        9
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 13
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.02	c lower bound updated to 8
0.00/0.02	c BCD2: 8 <= obj <= 49
0.00/0.02	c BCD2: #cores=5, #unrelaxed=74, #relaxed=26, #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 |      106      0 |        5 |        9
0.00/0.02	c  0.0s |       0 |       16 |        2 |      106      0 |        5 |        9
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 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: relaxing 5 and merging with 2 cores into a new core of size 16: cost of the new core is >=5
0.00/0.02	c lower bound updated to 9
0.00/0.02	c BCD2: 9 <= obj <= 49
0.00/0.02	c BCD2: #cores=4, #unrelaxed=69, #relaxed=31, #hardened=0
0.00/0.02	c BCD2: #sat=1 #unsat=10 bias=10/11
0.00/0.02	c Solving starts ...
0.00/0.02	c ============================[ Search Statistics ]============================
0.00/0.02	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.02	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.02	c =============================================================================
0.00/0.02	c  0.0s |       0 |        0 |        0 |      106      0 |        7 |        9
0.00/0.02	c  0.0s |       0 |       13 |        2 |      106      0 |        7 |       11
0.00/0.02	c #cpu_time = 0.001s
0.00/0.02	c #wall_clock_time = 0.001s
0.00/0.02	c #decision = 13
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 2
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 2 and merging with 3 cores into a new core of size 17: cost of the new core is >=5
0.00/0.02	c lower bound updated to 10
0.00/0.02	c BCD2: 10 <= obj <= 49
0.00/0.02	c BCD2: #cores=2, #unrelaxed=67, #relaxed=33, #hardened=0
0.00/0.02	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 |      106      0 |       10 |       11
0.00/0.03	c  0.0s |       0 |       14 |        2 |      106      0 |       10 |       14
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 14
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 2
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.03	c lower bound updated to 11
0.00/0.03	c BCD2: 11 <= obj <= 49
0.00/0.03	c BCD2: #cores=3, #unrelaxed=64, #relaxed=36, #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 |      106      0 |       10 |       14
0.00/0.03	c  0.0s |       0 |       15 |        2 |      106      0 |       10 |       14
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 15
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 4 and merging with 1 cores into a new core of size 7: cost of the new core is >=2
0.00/0.03	c lower bound updated to 12
0.00/0.03	c BCD2: 12 <= obj <= 49
0.00/0.03	c BCD2: #cores=3, #unrelaxed=60, #relaxed=40, #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 |      106      0 |       11 |       14
0.00/0.03	c  0.0s |       0 |       11 |        2 |      106      0 |       11 |       15
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 = 11
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 2
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 4: cost of the new core is >=1
0.00/0.03	c lower bound updated to 13
0.00/0.03	c BCD2: 13 <= obj <= 49
0.00/0.03	c BCD2: #cores=4, #unrelaxed=56, #relaxed=44, #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 |      106      0 |       11 |       15
0.00/0.03	c  0.0s |       0 |        7 |        1 |      106      0 |       11 |       15
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 7
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 1
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 6: cost of the new core is >=2
0.00/0.03	c lower bound updated to 14
0.00/0.03	c BCD2: 14 <= obj <= 49
0.00/0.03	c BCD2: #cores=4, #unrelaxed=54, #relaxed=46, #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 |      106      0 |       12 |       15
0.00/0.03	c  0.0s |       0 |       11 |        1 |      106      0 |       12 |       16
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 = 11
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 1
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 3: cost of the new core is >=1
0.00/0.03	c lower bound updated to 15
0.00/0.03	c BCD2: 15 <= obj <= 49
0.00/0.03	c BCD2: #cores=5, #unrelaxed=51, #relaxed=49, #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 |      106      0 |       12 |       16
0.00/0.03	c  0.0s |       0 |       11 |        2 |      106      0 |       12 |       16
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 = 11
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 2
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: relaxing 3 and merging with 2 cores into a new core of size 22: cost of the new core is >=7
0.00/0.03	c lower bound updated to 16
0.00/0.03	c BCD2: 16 <= obj <= 49
0.00/0.03	c BCD2: #cores=4, #unrelaxed=48, #relaxed=52, #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 |      106      0 |       14 |       16
0.00/0.03	c  0.0s |       0 |       11 |        4 |      106      0 |       14 |       18
0.00/0.03	c #cpu_time = 0.001s
0.00/0.03	c #wall_clock_time = 0.001s
0.00/0.03	c #decision = 11
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 4
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 8: cost of the new core is >=3
0.00/0.03	c lower bound updated to 17
0.00/0.03	c BCD2: 17 <= obj <= 49
0.00/0.03	c BCD2: #cores=4, #unrelaxed=47, #relaxed=53, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=18 bias=18/19
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      106      0 |       15 |       18
0.00/0.03	c  0.0s |       0 |       13 |        2 |      106      0 |       15 |       19
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 13
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 2
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 6: cost of the new core is >=1
0.00/0.03	c lower bound updated to 18
0.00/0.03	c BCD2: 18 <= obj <= 49
0.00/0.03	c BCD2: #cores=5, #unrelaxed=41, #relaxed=59, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=19 bias=19/20
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      106      0 |       15 |       19
0.00/0.03	c  0.0s |       0 |        8 |        1 |      106      0 |       15 |       19
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 8
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 1
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 7: 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 <= 49
0.00/0.03	c BCD2: #cores=5, #unrelaxed=40, #relaxed=60, #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 |      106      0 |       16 |       19
0.00/0.03	c  0.0s |       0 |       14 |        2 |      106      0 |       16 |       20
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 14
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 2
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 5: 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 <= 49
0.00/0.03	c BCD2: #cores=6, #unrelaxed=35, #relaxed=65, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=21 bias=21/22
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |      106      0 |       16 |       20
0.00/0.03	c  0.0s |       0 |       11 |        1 |      106      0 |       16 |       20
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 = 11
0.00/0.03	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 21
0.00/0.04	c BCD2: 21 <= obj <= 49
0.00/0.04	c BCD2: #cores=7, #unrelaxed=33, #relaxed=67, #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 |      106      0 |       16 |       20
0.00/0.04	c  0.0s |       0 |       14 |        1 |      106      0 |       16 |       20
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 = 14
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 1
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 6 and merging with 2 cores into a new core of size 19: cost of the new core is >=5
0.00/0.04	c lower bound updated to 22
0.00/0.04	c BCD2: 22 <= obj <= 49
0.00/0.04	c BCD2: #cores=6, #unrelaxed=27, #relaxed=73, #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 |      106      0 |       18 |       20
0.00/0.04	c  0.0s |       0 |       12 |        1 |      106      0 |       18 |       22
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 = 12
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 1
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 9: cost of the new core is >=3
0.00/0.04	c lower bound updated to 23
0.00/0.04	c BCD2: 23 <= obj <= 49
0.00/0.04	c BCD2: #cores=6, #unrelaxed=25, #relaxed=75, #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 |      106      0 |       19 |       22
0.00/0.04	c  0.0s |       0 |       13 |        0 |      106      0 |       19 |       23
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 13
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: found a new core of size 2: cost of the new core is >=1
0.00/0.04	c lower bound updated to 24
0.00/0.04	c BCD2: 24 <= obj <= 49
0.00/0.04	c BCD2: #cores=7, #unrelaxed=23, #relaxed=77, #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 |      106      0 |       19 |       23
0.00/0.04	c  0.0s |       0 |       16 |        1 |      106      0 |       19 |       23
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 = 16
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 5: cost of the new core is >=1
0.00/0.04	c lower bound updated to 25
0.00/0.04	c BCD2: 25 <= obj <= 49
0.00/0.04	c BCD2: #cores=8, #unrelaxed=18, #relaxed=82, #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 |      106      0 |       19 |       23
0.00/0.04	c  0.0s |       0 |       23 |        4 |      106      0 |       23 |       36
0.00/0.04	c #cpu_time = 0.001s
0.00/0.04	c #wall_clock_time = 0.001s
0.00/0.04	c #decision = 23
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 4
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 2 and merging with 2 cores into a new core of size 13: cost of the new core is >=5
0.00/0.04	c lower bound updated to 26
0.00/0.04	c BCD2: 26 <= obj <= 49
0.00/0.04	c BCD2: #cores=7, #unrelaxed=16, #relaxed=84, #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 |      106      0 |       25 |       36
0.00/0.04	c  0.0s |       0 |       11 |        2 |      106      0 |       25 |       38
0.00/0.04	c #cpu_time = 0.001s
0.00/0.04	c #wall_clock_time = 0.001s
0.00/0.04	c #decision = 11
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 2
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 2 and merging with 3 cores into a new core of size 22: cost of the new core is >=8
0.00/0.04	c lower bound updated to 27
0.00/0.04	c BCD2: 27 <= obj <= 49
0.00/0.04	c BCD2: #cores=5, #unrelaxed=14, #relaxed=86, #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 |      106      0 |       28 |       38
0.00/0.04	c  0.0s |       0 |        8 |        1 |      106      0 |       28 |       41
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 = 8
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 28
0.00/0.04	c BCD2: 28 <= obj <= 49
0.00/0.04	c BCD2: #cores=6, #unrelaxed=12, #relaxed=88, #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 |      106      0 |       28 |       41
0.00/0.04	c  0.0s |       0 |        9 |        1 |      106      0 |       28 |       41
0.00/0.04	c #cpu_time = 0.001s
0.00/0.04	c #wall_clock_time = 0.001s
0.00/0.04	c #decision = 9
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 1
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 3 and merging with 1 cores into a new core of size 5: 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 <= 49
0.00/0.04	c BCD2: #cores=6, #unrelaxed=9, #relaxed=91, #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 |      106      0 |       29 |       41
0.00/0.04	c  0.0s |       0 |        8 |        1 |      106      0 |       29 |       42
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 = 8
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 30
0.00/0.04	c BCD2: 30 <= obj <= 49
0.00/0.04	c BCD2: #cores=7, #unrelaxed=7, #relaxed=93, #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 |      106      0 |       29 |       42
0.00/0.04	c  0.0s |       0 |       11 |        0 |      106      0 |       29 |       42
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 = 11
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04	c lower bound updated to 31
0.00/0.04	c BCD2: 31 <= obj <= 49
0.00/0.04	c BCD2: #cores=8, #unrelaxed=6, #relaxed=94, #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 |      106      0 |       29 |       42
0.00/0.05	c  0.0s |       0 |       14 |        2 |      106      0 |       29 |       42
0.00/0.05	c #cpu_time = 0.000s
0.00/0.05	c #wall_clock_time = 0.000s
0.00/0.05	c #decision = 14
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 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 7: cost of the new core is >=3
0.00/0.05	c lower bound updated to 32
0.00/0.05	c BCD2: 32 <= obj <= 49
0.00/0.05	c BCD2: #cores=8, #unrelaxed=4, #relaxed=96, #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 |      106      0 |       30 |       42
0.00/0.05	c  0.0s |       0 |       13 |        3 |      106      0 |       30 |       43
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 = 13
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 3
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.05	c lower bound updated to 33
0.00/0.05	c BCD2: 33 <= obj <= 49
0.00/0.05	c BCD2: #cores=8, #unrelaxed=3, #relaxed=97, #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 |      106      0 |       31 |       43
0.00/0.05	c  0.0s |       0 |       17 |        5 |      106      0 |       61 |      136
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 = 17
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 5
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 0 and merging with 2 cores into a new core of size 39: cost of the new core is >=16
0.00/0.05	c lower bound updated to 36
0.00/0.05	c BCD2: 36 <= obj <= 49
0.00/0.05	c BCD2: #cores=7, #unrelaxed=3, #relaxed=97, #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 |      106      0 |       63 |      136
0.00/0.05	c  0.0s |       0 |        8 |        3 |      106      0 |      130 |      138
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 = 8
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 lower bound updated to 50
0.00/0.05	s OPTIMUM FOUND
0.00/0.05	v -x1 x2 -x3 x4 x5 -x6 x7 -x8 x9 -x10
0.00/0.05	v x11 -x12 -x13 x14 -x15 x16 x17 -x18 x19 -x20
0.00/0.05	v -x21 x22 -x23 x24 -x25 x26 x27 -x28 x29 -x30
0.00/0.05	v -x31 x32 x33 -x34 -x35 x36 x37 -x38 -x39 x40
0.00/0.05	v -x41 x42 -x43 x44 x45 -x46 -x47 x48 x49 -x50
0.00/0.05	v -x51 x52 -x53 x54 x55 -x56 -x57 x58 x59 -x60
0.00/0.05	v -x61 x62 x63 -x64 x65 -x66 x67 -x68 -x69 x70
0.00/0.05	v x71 -x72 -x73 x74 -x75 x76 x77 -x78 -x79 x80
0.00/0.05	v -x81 x82 -x83 x84 x85 -x86 -x87 x88 -x89 x90
0.00/0.05	v -x91 x92 -x93 x94 x95 -x96 -x97 x98 x99 -x100
0.00/0.05	c total CPU time = 0.053s
0.00/0.05	c total wall clock time = 0.053s

Verifier Data 

OK	50

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

pid=26767
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.00 2.00 2.00 3/179 26770
/proc/meminfo: memFree=30656080/32872528 swapFree=7780/7780
[pid=26770] ppid=26767 vsize=739772 CPUtime=0 cores=0,2,4,6
/proc/26770/stat : 26770 (toysat) R 26767 26770 23276 0 -1 4202496 2757 0 0 0 0 0 0 0 20 0 4 0 25032915 757526528 3629 33554432000 4194304 16246674 140736234142288 140736234141712 13880264 0 2 0 34082818 18446744073709551615 0 0 17 2 0 0 0 0 0
/proc/26770/statm: 185455 3639 441 2943 0 182349 0
[pid=26770/tid=26771] ppid=26767 vsize=757180 CPUtime=0 cores=0,2,4,6
/proc/26770/task/26771/stat : 26771 (toysat) S 26767 26770 23276 0 -1 4202560 9 0 0 0 0 0 0 0 20 0 4 0 25032915 775352320 3698 33554432000 4194304 16246674 140736234142288 140218898296048 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 4 0 0 0 0 0
[pid=26770/tid=26772] ppid=26767 vsize=761276 CPUtime=0 cores=0,2,4,6
/proc/26770/task/26772/stat : 26772 (toysat) S 26767 26770 23276 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 25032915 779546624 3717 33554432000 4194304 16246674 140736234142288 140218887806192 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 0 0 0 0 0 0
[pid=26770/tid=26773] ppid=26767 vsize=765372 CPUtime=0 cores=0,2,4,6
/proc/26770/task/26773/stat : 26773 (toysat) S 26767 26770 23276 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 25032915 783740928 3733 33554432000 4194304 16246674 140736234142288 140218803940528 14069300 0 0 0 34082818 18446744071579510697 0 0 -1 4 0 0 0 0 0

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

Child status: 0
Real time (s): 0.05946
CPU time (s): 0.05799
CPU user time (s): 0.030995
CPU system time (s): 0.026995
CPU usage (%): 97.5277
Max. virtual memory (cumulated for all children) (KiB): 0

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.030995
system time used= 0.026995
maximum resident set size= 58284
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 13721
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= 20
involuntary context switches= 1

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

The end

Launcher Data 

Begin job on node151 at 2016-06-18 08:04:41
IDJOB=4102305
IDBENCH=2094
IDSOLVER=2542
FILE ID=node151/4102305-1466229881
RUNJOBID= node151-1466206051-23292
PBS_JOBID= 19918135
Free space on /tmp= 71732 MiB

SOLVER NAME= toysat 2016-05-02
BENCH NAME= PB06//final/normalized-PB06/OPT-SMALLINT/submitted-PB05/manquinho/primes-dimacs-cnf/normalized-aim-50-3_4-yes1-4.opb
COMMAND LINE= toysat +RTS -H1G -MMEMLIMITm -K1G -RTS --pb --search=bcd2 BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4102305-1466229881/watcher-4102305-1466229881 -o /tmp/evaluation-result-4102305-1466229881/solver-4102305-1466229881 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node151-1466206051-23292 --watchdog 1960  toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4102305-1466229881.opb

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

MD5SUM BENCH= ae71e7f3830a7f496580905b76db98c8
RANDOM SEED=1735191830

node151.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.103
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.20
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.103
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.103
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.103
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.55
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.103
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.103
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.103
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		: 2667.103
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:        30656748 kB
Buffers:          113252 kB
Cached:           263736 kB
SwapCached:         1996 kB
Active:          1195268 kB
Inactive:         275684 kB
Active(anon):    1094312 kB
Inactive(anon):     1788 kB
Active(file):     100956 kB
Inactive(file):   273896 kB
Unevictable:        7780 kB
Mlocked:            7780 kB
SwapTotal:      67108856 kB
SwapFree:       67099228 kB
Dirty:             16332 kB
Writeback:             0 kB
AnonPages:       1100836 kB
Mapped:            11740 kB
Shmem:                 0 kB
Slab:             604488 kB
SReclaimable:      48108 kB
SUnreclaim:       556380 kB
KernelStack:        1520 kB
PageTables:         5896 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545120 kB
Committed_AS:    1244644 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346412 kB
VmallocChunk:   34341988032 kB
HardwareCorrupted:     0 kB
AnonHugePages:      2048 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= 71716 MiB
End job on node151 at 2016-06-18 08:04:41