Trace number 4117762

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-02OPT47 0.05599 0.0603671

General information on the benchmark

NamePB15eval/normalized-PB15eval/OPT-SMALLINT-LIN/
dt-problems/normalized-lo_10x10_007.opb.metafix.opb
MD5SUM6ba900390f34cab7ff3d92b42466908a
Bench CategoryOPT-SMALLINT-LIN (optimisation, small integers, linear constraints)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark47
Best CPU time to get the best result obtained on this benchmark0.014997
Has Objective FunctionYES
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables100
Total number of constraints58
Number of constraints which are clauses0
Number of constraints which are cardinality constraints (but not clauses)58
Number of constraints which are nor clauses,nor cardinality constraints0
Minimum length of a constraint1
Maximum length of a constraint10
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 8
Number of bits of the biggest number in a constraint 4
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-29T17:49:33+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-4117762-1467215373.opb"]
0.00/0.01	c use --random-gen="2370572259 1978491414 3919225834 3542407064 2267489429 1564158069 1733682370 624163315 3190052824 3009807036 189704788 1964024347 622905394 4150013623 3436215110 2198740344 739872231 3641749573 4087757705 2566441553 3274734595 300604584 652476959 3399826529 3710436038 4127010135 2590392986 1444702093 4243121789 4156196187 860605727 2637584904 1887051395 2142630381 3279653855 2688971104 3921739869 3410622943 460850745 862369288 1315105731 1453209582 3009171091 1338901169 3222165901 2250547681 743563451 3608490901 3808440014 3315230493 1575702248 1020625820 3556030 2126587307 2027146036 4142320326 359909829 3173617518 451985449 2162469745 4237988332 313043367 3879459913 3288639984 1269315739 300545110 3057800449 1671931059 2526741849 4257241147 278378896 1243877293 2933193356 2616074068 1263378651 353269219 325729498 1388426643 2711974596 3334339222 1879159906 2840380638 2198384178 2812419711 245430890 276120558 3591814067 288404237 2588742774 3782452544 1817539632 1101169752 184033923 1275926615 3738200003 2164260973 195747006 1469699737 3247060116 1530269988 4003778720 2823555004 1568791403 1672230631 1340860021 3208827622 4044779987 1191490957 2579015891 2864338506 2157989328 708486727 3797091589 269116508 1113144426 4046184004 4288600046 2002004796 2615607997 711722670 1253369273 3061015692 2304072909 399660602 2224163384 3112375685 2992081075 3413304351 2847792904 2115644320 4059230765 2513130732 2246780835 3869241972 1026660708 2925091150 546686721 1013928821 3372084713 1175461626 2158896771 2280247455 1367212371 2981368553 2808985564 57063048 622165571 2702120440 288945330 33292589 220636021 716608208 3669398205 1144369574 992704551 1471104228 3126392597 3265667951 3312140523 1983850235 3772606436 2435015349 4197084454 3946858927 2789407154 2249846291 1363033559 1931298188 1274606339 3638566570 1693590453 549146958 497205105 4098741914 2432748575 3952612415 1693767226 2658698753 348587832 3931783208 821026314 2926369307 3506223822 2159637718 2062934172 1906045601 2909301968 3165679393 3259414004 4133465833 1867491057 2907043888 1929931326 1384610301 2595243813 1721264926 412439993 1504834056 3219502559 3684748392 805803648 3386328751 1975929022 3982413738 4103736110 2357201638 1404379300 1126876252 4264475175 1400104327 89522199 4057053253 2233833849 2374146035 629166187 1218941399 3583688617 1678781461 549178447 2751853578 4216957484 1066692577 3209136627 3078737570 2189878538 1919083552 2924649610 3772625764 216401753 1031083596 3281839215 3991700703 2503112343 2173367263 3900736217 2050300472 2351850913 815458064 2205167933 1644480502 3808915788 2442353252 262187330 247967777 4115073388 3359759089 4261274890 2850641895 2361896553 3551427773 2004670261 1827336660 665191023 2546457470 3455040847 3135162716 255 362436" option to reproduce the execution
0.00/0.01	c #vars 100
0.00/0.01	c #constraints 58
0.00/0.01	c BCD2: Hardening is enabled.
0.00/0.01	c BCD2: BiasedSearch is enabled.
0.00/0.01	c Solving starts ...
0.00/0.01	c ============================[ Search Statistics ]============================
0.00/0.01	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.01	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.01	c =============================================================================
0.00/0.01	c  0.0s |       0 |        0 |        0 |       68      0 |        8 |        0
0.00/0.01	c  0.0s |       0 |        5 |        2 |       68      0 |        8 |        0
0.00/0.01	c #cpu_time = 0.001s
0.00/0.01	c #wall_clock_time = 0.001s
0.00/0.01	c #decision = 5
0.00/0.01	c #random_decision = 0
0.00/0.01	c #conflict = 2
0.00/0.01	c #restart = 0
0.00/0.01	o 47
0.00/0.01	c BCD2: updating upper bound: 100 -> 46
0.00/0.01	c BCD2: 0 <= obj <= 46
0.00/0.01	c BCD2: #cores=0, #unrelaxed=100, #relaxed=0, #hardened=0
0.00/0.01	c BCD2: #sat=1 #unsat=1 bias=1/2
0.00/0.01	c Solving starts ...
0.00/0.01	c ============================[ Search Statistics ]============================
0.00/0.01	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.01	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.01	c =============================================================================
0.00/0.01	c  0.0s |       0 |        0 |        0 |       68      0 |        8 |        0
0.00/0.01	c  0.0s |       0 |        0 |        0 |       68      0 |        8 |        0
0.00/0.01	c #cpu_time = 0.000s
0.00/0.01	c #wall_clock_time = 0.000s
0.00/0.01	c #decision = 0
0.00/0.01	c #random_decision = 0
0.00/0.01	c #conflict = 0
0.00/0.01	c #restart = 0
0.00/0.01	c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.01	c lower bound updated to 1
0.00/0.01	c BCD2: 1 <= obj <= 46
0.00/0.01	c BCD2: #cores=1, #unrelaxed=99, #relaxed=1, #hardened=0
0.00/0.01	c BCD2: #sat=1 #unsat=2 bias=2/3
0.00/0.01	c Solving starts ...
0.00/0.01	c ============================[ Search Statistics ]============================
0.00/0.01	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.01	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.01	c =============================================================================
0.00/0.01	c  0.0s |       0 |        0 |        0 |       68      0 |        8 |        0
0.00/0.01	c  0.0s |       0 |        6 |        1 |       68      0 |        8 |        0
0.00/0.01	c #cpu_time = 0.000s
0.00/0.01	c #wall_clock_time = 0.000s
0.00/0.01	c #decision = 6
0.00/0.01	c #random_decision = 0
0.00/0.01	c #conflict = 1
0.00/0.01	c #restart = 0
0.00/0.01	c BCD2: found a new core of size 5: cost of the new core is >=1
0.00/0.01	c lower bound updated to 2
0.00/0.01	c BCD2: 2 <= obj <= 46
0.00/0.01	c BCD2: #cores=2, #unrelaxed=94, #relaxed=6, #hardened=0
0.00/0.01	c BCD2: #sat=1 #unsat=3 bias=3/4
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 |       68      0 |        8 |        0
0.00/0.02	c  0.0s |       0 |        8 |        0 |       68      0 |        8 |        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 = 0
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 3
0.00/0.02	c BCD2: 3 <= obj <= 46
0.00/0.02	c BCD2: #cores=3, #unrelaxed=89, #relaxed=11, #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 |       68      0 |        8 |        0
0.00/0.02	c  0.0s |       0 |        6 |        1 |       68      0 |        8 |        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 = 6
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 7: cost of the new core is >=2
0.00/0.02	c lower bound updated to 4
0.00/0.02	c BCD2: 4 <= obj <= 46
0.00/0.02	c BCD2: #cores=3, #unrelaxed=87, #relaxed=13, #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 |       68      0 |        9 |        0
0.00/0.02	c  0.0s |       0 |        5 |        1 |       68      0 |        9 |        1
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 5
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 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 5
0.00/0.02	c BCD2: 5 <= obj <= 46
0.00/0.02	c BCD2: #cores=4, #unrelaxed=85, #relaxed=15, #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 |       68      0 |        9 |        1
0.00/0.02	c  0.0s |       0 |       11 |        2 |       68      0 |        9 |        1
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 5 and merging with 1 cores into a new core of size 10: cost of the new core is >=2
0.00/0.02	c lower bound updated to 6
0.00/0.02	c BCD2: 6 <= obj <= 46
0.00/0.02	c BCD2: #cores=4, #unrelaxed=80, #relaxed=20, #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 |       68      0 |       10 |        1
0.00/0.02	c  0.0s |       0 |        8 |        1 |       68      0 |       10 |        2
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 8
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 4 and merging with 1 cores into a new core of size 14: cost of the new core is >=3
0.00/0.02	c lower bound updated to 7
0.00/0.02	c BCD2: 7 <= obj <= 46
0.00/0.02	c BCD2: #cores=4, #unrelaxed=76, #relaxed=24, #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 |       68      0 |       11 |        2
0.00/0.02	c  0.0s |       0 |        6 |        1 |       68      0 |       11 |        3
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 = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 1 and merging with 2 cores into a new core of size 10: cost of the new core is >=4
0.00/0.02	c lower bound updated to 8
0.00/0.02	c BCD2: 8 <= obj <= 46
0.00/0.02	c BCD2: #cores=3, #unrelaxed=75, #relaxed=25, #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 |       68      0 |       13 |        3
0.00/0.02	c  0.0s |       0 |        9 |        1 |       68      0 |       13 |        5
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 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: found a new core of size 4: cost of the new core is >=1
0.00/0.02	c lower bound updated to 9
0.00/0.02	c BCD2: 9 <= obj <= 46
0.00/0.02	c BCD2: #cores=4, #unrelaxed=71, #relaxed=29, #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 |       68      0 |       13 |        5
0.00/0.02	c  0.0s |       0 |       10 |        1 |       68      0 |       13 |        5
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 10
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 4 and merging with 1 cores into a new core of size 8: cost of the new core is >=2
0.00/0.02	c lower bound updated to 10
0.00/0.02	c BCD2: 10 <= obj <= 46
0.00/0.02	c BCD2: #cores=4, #unrelaxed=67, #relaxed=33, #hardened=0
0.00/0.02	c BCD2: #sat=1 #unsat=11 bias=11/12
0.00/0.02	c Solving starts ...
0.00/0.02	c ============================[ Search Statistics ]============================
0.00/0.02	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.02	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.02	c =============================================================================
0.00/0.02	c  0.0s |       0 |        0 |        0 |       68      0 |       14 |        5
0.00/0.02	c  0.0s |       0 |        8 |        1 |       68      0 |       14 |        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 = 8
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 12: cost of the new core is >=5
0.00/0.02	c lower bound updated to 11
0.00/0.02	c BCD2: 11 <= obj <= 46
0.00/0.02	c BCD2: #cores=4, #unrelaxed=65, #relaxed=35, #hardened=0
0.00/0.02	c BCD2: #sat=1 #unsat=12 bias=12/13
0.00/0.02	c Solving starts ...
0.00/0.02	c ============================[ Search Statistics ]============================
0.00/0.02	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.02	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.02	c =============================================================================
0.00/0.02	c  0.0s |       0 |        0 |        0 |       68      0 |       15 |        6
0.00/0.02	c  0.0s |       0 |       13 |        0 |       68      0 |       15 |        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 = 13
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 8: cost of the new core is >=1
0.00/0.02	c lower bound updated to 12
0.00/0.02	c BCD2: 12 <= obj <= 46
0.00/0.02	c BCD2: #cores=5, #unrelaxed=57, #relaxed=43, #hardened=0
0.00/0.02	c BCD2: #sat=1 #unsat=13 bias=13/14
0.00/0.02	c Solving starts ...
0.00/0.02	c ============================[ Search Statistics ]============================
0.00/0.02	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.02	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.02	c =============================================================================
0.00/0.02	c  0.0s |       0 |        0 |        0 |       68      0 |       15 |        7
0.00/0.02	c  0.0s |       0 |       10 |        1 |       68      0 |       15 |        7
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 10
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 14: cost of the new core is >=6
0.00/0.02	c lower bound updated to 13
0.00/0.02	c BCD2: 13 <= obj <= 46
0.00/0.02	c BCD2: #cores=5, #unrelaxed=55, #relaxed=45, #hardened=0
0.00/0.02	c BCD2: #sat=1 #unsat=14 bias=14/15
0.00/0.02	c Solving starts ...
0.00/0.02	c ============================[ Search Statistics ]============================
0.00/0.02	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.02	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.02	c =============================================================================
0.00/0.02	c  0.0s |       0 |        0 |        0 |       68      0 |       16 |        7
0.00/0.02	c  0.0s |       0 |       10 |        1 |       68      0 |       16 |        8
0.00/0.02	c #cpu_time = 0.000s
0.00/0.02	c #wall_clock_time = 0.000s
0.00/0.02	c #decision = 10
0.00/0.02	c #random_decision = 0
0.00/0.02	c #conflict = 1
0.00/0.02	c #restart = 0
0.00/0.02	c BCD2: relaxing 2 and merging with 1 cores into a new core of size 10: cost of the new core is >=2
0.00/0.02	c lower bound updated to 14
0.00/0.02	c BCD2: 14 <= obj <= 46
0.00/0.02	c BCD2: #cores=5, #unrelaxed=53, #relaxed=47, #hardened=0
0.00/0.02	c BCD2: #sat=1 #unsat=15 bias=15/16
0.00/0.02	c Solving starts ...
0.00/0.02	c ============================[ Search Statistics ]============================
0.00/0.02	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.02	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.02	c =============================================================================
0.00/0.02	c  0.0s |       0 |        0 |        0 |       68      0 |       17 |        8
0.00/0.03	c  0.0s |       0 |        9 |        1 |       68      0 |       17 |        9
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 9
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 <= 46
0.00/0.03	c BCD2: #cores=6, #unrelaxed=50, #relaxed=50, #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 |       68      0 |       17 |        9
0.00/0.03	c  0.0s |       0 |       10 |        2 |       68      0 |       17 |        9
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 10
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 5: cost of the new core is >=2
0.00/0.03	c lower bound updated to 16
0.00/0.03	c BCD2: 16 <= obj <= 46
0.00/0.03	c BCD2: #cores=6, #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 |       68      0 |       18 |        9
0.00/0.03	c  0.0s |       0 |       10 |        2 |       68      0 |       18 |       10
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 10
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 7: 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 <= 46
0.00/0.03	c BCD2: #cores=6, #unrelaxed=46, #relaxed=54, #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 |       68      0 |       19 |       10
0.00/0.03	c  0.0s |       0 |        9 |        2 |       68      0 |       19 |       11
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 9
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 9: cost of the new core is >=4
0.00/0.03	c lower bound updated to 18
0.00/0.03	c BCD2: 18 <= obj <= 46
0.00/0.03	c BCD2: #cores=6, #unrelaxed=44, #relaxed=56, #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 |       68      0 |       20 |       11
0.00/0.03	c  0.0s |       0 |       10 |        1 |       68      0 |       20 |       12
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 10
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 11: cost of the new core is >=3
0.00/0.03	c lower bound updated to 19
0.00/0.03	c BCD2: 19 <= obj <= 46
0.00/0.03	c BCD2: #cores=6, #unrelaxed=43, #relaxed=57, #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 |       68      0 |       21 |       12
0.00/0.03	c  0.0s |       0 |       12 |        0 |       68      0 |       21 |       13
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 12
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 0
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 6: cost of the new core is >=1
0.00/0.03	c lower bound updated to 20
0.00/0.03	c BCD2: 20 <= obj <= 46
0.00/0.03	c BCD2: #cores=7, #unrelaxed=37, #relaxed=63, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=21 bias=21/22
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |       68      0 |       21 |       13
0.00/0.03	c  0.0s |       0 |       12 |        2 |       68      0 |       21 |       13
0.00/0.03	c #cpu_time = 0.000s
0.00/0.03	c #wall_clock_time = 0.000s
0.00/0.03	c #decision = 12
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 2 cores into a new core of size 17: cost of the new core is >=6
0.00/0.03	c lower bound updated to 21
0.00/0.03	c BCD2: 21 <= obj <= 46
0.00/0.03	c BCD2: #cores=6, #unrelaxed=35, #relaxed=65, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=22 bias=22/23
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |       68      0 |       23 |       13
0.00/0.03	c  0.0s |       0 |       27 |        1 |       68      0 |       24 |       15
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 = 27
0.00/0.03	c #random_decision = 0
0.00/0.03	c #conflict = 1
0.00/0.03	c #restart = 0
0.00/0.03	c BCD2: found a new core of size 6: cost of the new core is >=1
0.00/0.03	c lower bound updated to 22
0.00/0.03	c BCD2: 22 <= obj <= 46
0.00/0.03	c BCD2: #cores=7, #unrelaxed=29, #relaxed=71, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=23 bias=23/24
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |       68      0 |       24 |       15
0.00/0.03	c  0.0s |       0 |       20 |        2 |       68      0 |       25 |       15
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 = 20
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 1: cost of the new core is >=1
0.00/0.03	c lower bound updated to 23
0.00/0.03	c BCD2: 23 <= obj <= 46
0.00/0.03	c BCD2: #cores=8, #unrelaxed=28, #relaxed=72, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=24 bias=24/25
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |       68      0 |       25 |       15
0.00/0.03	c  0.0s |       0 |       17 |        1 |       68      0 |       25 |       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 = 17
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 5: cost of the new core is >=1
0.00/0.03	c lower bound updated to 24
0.00/0.03	c BCD2: 24 <= obj <= 46
0.00/0.03	c BCD2: #cores=9, #unrelaxed=23, #relaxed=77, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=25 bias=25/26
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |       68      0 |       25 |       15
0.00/0.03	c  0.0s |       0 |       17 |        1 |       68      0 |       25 |       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 = 17
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 7: cost of the new core is >=2
0.00/0.03	c lower bound updated to 25
0.00/0.03	c BCD2: 25 <= obj <= 46
0.00/0.03	c BCD2: #cores=9, #unrelaxed=21, #relaxed=79, #hardened=0
0.00/0.03	c BCD2: #sat=1 #unsat=26 bias=26/27
0.00/0.03	c Solving starts ...
0.00/0.03	c ============================[ Search Statistics ]============================
0.00/0.03	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.03	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.03	c =============================================================================
0.00/0.03	c  0.0s |       0 |        0 |        0 |       68      0 |       26 |       15
0.00/0.04	c  0.0s |       0 |       13 |        0 |       68      0 |       26 |       16
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 26
0.00/0.04	c BCD2: 26 <= obj <= 46
0.00/0.04	c BCD2: #cores=10, #unrelaxed=19, #relaxed=81, #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 |       68      0 |       26 |       16
0.00/0.04	c  0.0s |       0 |       17 |        1 |       68      0 |       26 |       16
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 = 17
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 3: 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 <= 46
0.00/0.04	c BCD2: #cores=11, #unrelaxed=16, #relaxed=84, #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 |       68      0 |       26 |       16
0.00/0.04	c  0.0s |       0 |       25 |        1 |       68      0 |       26 |       16
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 25
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 1
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 1 and merging with 1 cores into a new core of size 3: cost of the new core is >=2
0.00/0.04	c lower bound updated to 28
0.00/0.04	c BCD2: 28 <= obj <= 46
0.00/0.04	c BCD2: #cores=11, #unrelaxed=15, #relaxed=85, #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 |       68      0 |       27 |       17
0.00/0.04	c  0.0s |       0 |       17 |        0 |       68      0 |       27 |       18
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 17
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 29
0.00/0.04	c BCD2: 29 <= obj <= 46
0.00/0.04	c BCD2: #cores=12, #unrelaxed=13, #relaxed=87, #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 |       68      0 |       27 |       19
0.00/0.04	c  0.0s |       0 |       17 |        0 |       68      0 |       27 |       19
0.00/0.04	c #cpu_time = 0.000s
0.00/0.04	c #wall_clock_time = 0.000s
0.00/0.04	c #decision = 17
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 0
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: found a new core of size 1: cost of the new core is >=1
0.00/0.04	c lower bound updated to 30
0.00/0.04	c BCD2: 30 <= obj <= 46
0.00/0.04	c BCD2: #cores=13, #unrelaxed=12, #relaxed=88, #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 |       68      0 |       27 |       19
0.00/0.04	c  0.0s |       0 |       44 |       11 |       68      0 |       27 |       19
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 = 44
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 11
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 5: cost of the new core is >=2
0.00/0.04	c lower bound updated to 31
0.00/0.04	c BCD2: 31 <= obj <= 46
0.00/0.04	c BCD2: #cores=13, #unrelaxed=10, #relaxed=90, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=32 bias=32/33
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |       68      0 |       28 |       19
0.00/0.04	c  0.0s |       0 |       33 |       16 |       68      0 |       28 |       20
0.00/0.04	c #cpu_time = 0.002s
0.00/0.04	c #wall_clock_time = 0.002s
0.00/0.04	c #decision = 33
0.00/0.04	c #random_decision = 0
0.00/0.04	c #conflict = 16
0.00/0.04	c #restart = 0
0.00/0.04	c BCD2: relaxing 3 and merging with 6 cores into a new core of size 66: cost of the new core is >=18
0.00/0.04	c lower bound updated to 32
0.00/0.04	c BCD2: 32 <= obj <= 46
0.00/0.04	c BCD2: #cores=8, #unrelaxed=7, #relaxed=93, #hardened=0
0.00/0.04	c BCD2: #sat=1 #unsat=33 bias=33/34
0.00/0.04	c Solving starts ...
0.00/0.04	c ============================[ Search Statistics ]============================
0.00/0.04	c  Time | Restart | Decision | Conflict |      LEARNT     | Fixed    | Removed 
0.00/0.04	c       |         |          |          |    Limit     GC | Var      | Constra 
0.00/0.04	c =============================================================================
0.00/0.04	c  0.0s |       0 |        0 |        0 |       68      0 |       34 |       20
0.00/0.05	c  0.0s |       0 |       50 |       30 |       68      0 |       35 |       26
0.00/0.05	c #cpu_time = 0.004s
0.00/0.05	c #wall_clock_time = 0.004s
0.00/0.05	c #decision = 50
0.00/0.05	c #random_decision = 0
0.00/0.05	c #conflict = 30
0.00/0.05	c #restart = 0
0.00/0.05	c BCD2: relaxing 0 and merging with 3 cores into a new core of size 85: cost of the new core is >=27
0.00/0.05	c lower bound updated to 33
0.00/0.05	c BCD2: 33 <= obj <= 46
0.00/0.05	c BCD2: #cores=6, #unrelaxed=7, #relaxed=93, #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 |       68      0 |       38 |       26
0.00/0.05	c  0.0s |       0 |       51 |       20 |       75      0 |       65 |       42
0.00/0.05	c #cpu_time = 0.003s
0.00/0.05	c #wall_clock_time = 0.003s
0.00/0.05	c #decision = 51
0.00/0.05	c #random_decision = 1
0.00/0.05	c #conflict = 20
0.00/0.05	c #restart = 0
0.00/0.05	c lower bound updated to 47
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.055s
0.00/0.05	c total wall clock time = 0.055s

Verifier Data 

OK	47

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

pid=3710
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: 1.35 1.33 1.62 4/178 3715
/proc/meminfo: memFree=28528876/32872528 swapFree=1631852/1795372
[pid=3715] ppid=3710 vsize=769468 CPUtime=0 cores=0,2,4,6
/proc/3715/stat : 3715 (toysat) R 3710 3715 1867 0 -1 4202496 2880 0 0 0 0 0 0 0 20 0 4 0 563325 787935232 3241 33554432000 4194304 16246674 140734111814912 140734111814336 13880264 0 2 0 34082818 18446744073709551615 0 0 17 2 0 0 0 0 0
/proc/3715/statm: 193135 3251 441 2943 0 190029 0
[pid=3715/tid=3717] ppid=3710 vsize=787900 CPUtime=0 cores=0,2,4,6
/proc/3715/task/3717/stat : 3717 (toysat) S 3710 3715 1867 0 -1 4202560 9 0 0 0 0 0 0 0 20 0 4 0 563326 806809600 3313 33554432000 4194304 16246674 140734111814912 140352384118000 15012391 0 0 0 34082818 18446744071580610281 0 0 -1 4 0 0 0 0 0
[pid=3715/tid=3718] ppid=3710 vsize=791996 CPUtime=0 cores=0,2,4,6
/proc/3715/task/3718/stat : 3718 (toysat) S 3710 3715 1867 0 -1 4202560 8 0 0 0 0 0 0 0 20 0 4 0 563326 811003904 3329 33554432000 4194304 16246674 140734111814912 140352373628144 14998865 0 0 0 34082818 18446744071580425449 0 0 -1 0 0 0 0 0 0
[pid=3715/tid=3719] ppid=3710 vsize=797116 CPUtime=0 cores=0,2,4,6
/proc/3715/task/3719/stat : 3719 (toysat) S 3710 3715 1867 0 -1 4202560 1 0 0 0 0 0 0 0 20 0 4 0 563326 816246784 3347 33554432000 4194304 16246674 140734111814912 140352363154608 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 3715 sig 9
??? kill -3715 sig 9
??? end of watcher thread
Dumping a history of the last processes samples

Child status: 0
Real time (s): 0.0603671
CPU time (s): 0.05599
CPU user time (s): 0.034994
CPU system time (s): 0.020996
CPU usage (%): 92.7493
Max. virtual memory (cumulated for all children) (KiB): 0

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.034994
system time used= 0.020996
maximum resident set size= 56720
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 13840
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= 24
involuntary context switches= 4

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

The end

Launcher Data 

Begin job on node123 at 2016-06-29 17:49:33
IDJOB=4117762
IDBENCH=111611
IDSOLVER=2542
FILE ID=node123/4117762-1467215373
RUNJOBID= node123-1467215373-3683
PBS_JOBID= 19997595
Free space on /tmp= 71728 MiB

SOLVER NAME= toysat 2016-05-02
BENCH NAME= PB15eval/normalized-PB15eval/OPT-SMALLINT-LIN/dt-problems/normalized-lo_10x10_007.opb.metafix.opb
COMMAND LINE= toysat +RTS -H1G -MMEMLIMITm -K1G -RTS --pb --search=bcd2 BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4117762-1467215373/watcher-4117762-1467215373 -o /tmp/evaluation-result-4117762-1467215373/solver-4117762-1467215373 -C 1800 -W 1900 -M 15500 --bin-var /tmp/runsolver-exch-node123-1467215373-3683 --watchdog 1960  toysat +RTS -H1G -M15500m -K1G -RTS --pb --search=bcd2 HOME/instance-4117762-1467215373.opb

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

MD5SUM BENCH= 6ba900390f34cab7ff3d92b42466908a
RANDOM SEED=1401420682

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.387
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	: 5332.77
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.387
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.387
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		: 2666.387
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		: 2666.387
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		: 2666.387
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		: 2666.387
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.55
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.387
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:        28534428 kB
Buffers:           69644 kB
Cached:          1749952 kB
SwapCached:            0 kB
Active:           152628 kB
Inactive:        1680996 kB
Active(anon):      16360 kB
Inactive(anon):        0 kB
Active(file):     136268 kB
Inactive(file):  1680996 kB
Unevictable:     1795372 kB
Mlocked:         1631852 kB
SwapTotal:      67108856 kB
SwapFree:       67108856 kB
Dirty:             32608 kB
Writeback:             0 kB
AnonPages:       1808940 kB
Mapped:            13892 kB
Shmem:               204 kB
Slab:             577032 kB
SReclaimable:      21900 kB
SUnreclaim:       555132 kB
KernelStack:        1400 kB
PageTables:         7928 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545120 kB
Committed_AS:    1896648 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346412 kB
VmallocChunk:   34341988032 kB
HardwareCorrupted:     0 kB
AnonHugePages:    165888 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= 71700 MiB
End job on node123 at 2016-06-29 17:49:33