CBC 2.4.2 claims a feasible problem is infeasible

[mgalati]

[magala@orclus71 Dippy]$ /opt/coinor/Dip/build-O/bin/cbc PRICE_AND_CUT_subProb_BLOCK.n0.c0.p22.b0.mps

Clp3003W Analysis indicates model infeasible or unbounded
Clp0006I 0  Obj -1.04428 Primal inf 0.0442769 (1)
Clp0001I Primal infeasible - objective value -1.04428
Clp0032I PrimalInfeasible objective -1.044277 - 0 iterations time 0.002
Cuts at root node changed objective from -1.1233 to -1.1233
Probing was tried 1 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Result - Finishedproven-infeasible objective 1e+50 after 0 nodes and 0 iterations - took 0.02 seconds (total time 0.02)
Total time 0.02

Cplex says the optimal solution = -1.

[stefan]

This ticket has been migrated to GitHub and will be resolved there: ​https://github.com/coin-or/Cbc/issues/96