It can happen that presolving removes all rows and columns of a problem. This means all constraints are removed and variables are fixed, so no further LP or MIP solving techniques (like branch-and-bound, heuristics or cutting planes) are required. The optimal solution - if the model is feasible - could already be determined using the various reductions, implications, and propagations that are performed during the presolving phase of Gurobi.