CVXPY
Minimize
  power(x + -y, 2.0) + x + y
Subject To
 41: y == 0.0
Bounds
 x free
 y free
End
----------------------------------------
AFTER COMPILATION
Minimize
 Obj: +1 x_0 +1 x_1 +1 x_2
Subject to
 c1: +1 x_2 = +0
 c2: +1 soc_t_1 -1 x_0 = +1
 c3: +1 soc_t_2 -1 x_0 = -1
 c4: +1 soc_t_3 -2 x_1 +2 x_2 = +0
 c5: + [ +1 soc_t_2 * soc_t_2 +1 soc_t_3 * soc_t_3 -1 soc_t_1 * soc_t_1 ] <= +0
Bounds
 x_0 free
 x_1 free
 x_2 free
 soc_t_2 free
 soc_t_3 free
End
----------------------------------------
SCIP
Minimize
 Obj: +1 x3
Subject to
 c1: +1 x3 -1 x -1 y + [ -1 x * x +2 x * y -1 y * y ] >= +0
 41: +1 y = +0
Bounds
 x free
 y free
 x3 free
End