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