Xpress-MP licensed by Dash to Carmen Group products
incrementInstanceCounter:: numInstances 0

Reading Problem _xprs_                                                          
Problem Statistics
           0 (      0 spare) rows
           0 (      0 spare) structural columns
           0 (      0 spare) non-zero elements
Global Statistics
           0 entities        0 sets        0 set members

Reading Problem Prob1                                                           
Problem Statistics
           3 (     50 spare) rows
           3 (      0 spare) structural columns
           9 (    100 spare) non-zero elements
Global Statistics
           0 entities        0 sets        0 set members
Presolved problem has:      3 rows       3 cols       9 non-zeros

   Its         Obj Value      S   Ninf  Nneg        Sum Inf  Time
     0           .000000      D      0     0        .000000     0
     2         13.000000      D      0     0        .000000     0
Uncrunching matrix
     2         13.000000      D      0     0        .000000     0
Optimal solution found

Generating cuts

   Its         Obj Value    Type    Cuts Added / Deleted    Time

Cuts in the matrix         : 0
Cut elements in the matrix : 0

Cuts in the cutpool        : 0
Cut elements in the cutpool: 0

    Node       Sols   Best Solution     Best Bound  Active    Time
 *     1          1       13.000000      13.000000       0       0 *
 *** Search completed ***     Time:     0 Nodes:     1
Number of integer feasible solutions found is 1
Best integer solution found is    13.000000

The optimal solution is:
  x0 = 2
  x1 = 0
  x2 = 0.25
  objective value = 10.75
incrementInstanceCounter:: numInstances 1

Reading Problem _xprs_                                                          
Problem Statistics
           0 (      0 spare) rows
           0 (      0 spare) structural columns
           0 (      0 spare) non-zero elements
Global Statistics
           0 entities        0 sets        0 set members
Coin0001I At line 1 NAME          Prob1
Coin0001I At line 2 ROWS
Coin0001I At line 7 COLUMNS
Coin0001I At line 14 RHS
Coin0001I At line 17 ENDATA
Coin0002I Problem Prob1 has 3 rows, 3 columns and 9 elements
Coin0008I Prob1 read with 0 errors

Reading Problem Prob2                                                           
Problem Statistics
           3 (     50 spare) rows
           3 (      0 spare) structural columns
           9 (    100 spare) non-zero elements
Global Statistics
           0 entities        0 sets        0 set members
Presolved problem has:      0 rows       0 cols       0 non-zeros

   Its         Obj Value      S   Ninf  Nneg        Sum Inf  Time
     0           .000000      D      0     0        .000000     0
Uncrunching matrix
     0           .000000      D      0     0        .000000     0
Optimal solution found

Generating cuts

   Its         Obj Value    Type    Cuts Added / Deleted    Time

Cuts in the matrix         : 0
Cut elements in the matrix : 0

Cuts in the cutpool        : 0
Cut elements in the cutpool: 0

    Node       Sols   Best Solution     Best Bound  Active    Time
 *     1          1       13.000000      13.000000       0       0 *
 *** Search completed ***     Time:     0 Nodes:     1
Number of integer feasible solutions found is 1
Best integer solution found is    13.000000