CVXPY
Minimize
  Sum(x, None, False)
Subject To
 56: 0.0 <= x + y + Promote(1.0, (2,))
 61: y == 0.0
Bounds
 x free
 y free
End
----------------------------------------
AFTER COMPILATION
Minimize
  C0 + C1
Subject To
 R0: C2 = 0
 R1: C3 = 0
 R2: - C0 - C2 <= 1
 R3: - C1 - C3 <= 1
Bounds
 C0 free
 C1 free
 C2 free
 C3 free
End
----------------------------------------
GUROBI
Minimize
  x[0] + x[1]
Subject To
 56[0]: x[0] + y[0] >= -1
 56[1]: x[1] + y[1] >= -1
 61[0]: y[0] = 0
 61[1]: y[1] = 0
Bounds
 x[0] free
 x[1] free
 y[0] free
 y[1] free
End