Here are the two positions for 0.65 and 1.25: do you think you could defeat Houdini as the defender in both cases? Chessbase doesn't interpret 1.25 as "winning", but merely as "White is better", and likewise for 0.65. In both of these positions, I think the evaluation will probably get better for Black as he manages to finish his development, which seems doable in both cases.
In the first position we can note:
1.Black is cramped, weak on the dark squares, but may have some fight left.
2.White meanwhile has doubled isolated c-pawns, but this doesn't mean much as white has more space, better development, the bishop pair, and Bf4 and the queen is threatened and the white queen and bishop converge on the terrible d6 square. White is much better I think.
Bf4,e5 doesn't work, and f4 (with the idea of e5) leads to Qb6+.
Ba3 looks worth considering, it covers the d6 square with a threat, and said threatened piece can't be blunted with e5. If there's nothing better I'd recommend Ba3 but looks best to me personally.
Ponz, I appreciate what you are saying, but to rigorously prove a position is winning, one can not just throw it into a chess engine. One must have a set of moves for one side which offer no chance of escape for the other side. It is easy to make claims about the true state of Chess without actually knowing. One can not be 100% sure of a claim without checking 100% of the variations referred to. Chess engines have various ways of *estimating* when a position is won or lost, but (perhaps I am just not informed completely about how well analyzed Houdini is) the logic (as far as I know) is missing that *logically* relates the estimates to the true state, or complete evaluation, of the game tree stemming from the position.