CVXPY
Maximize
  Sum(x, None, False)
Subject To
 8: power(x, 2.0) <= 1.0
Bounds
 0.0 <= x
End
----------------------------------------
AFTER COMPILATION
Minimize
 Obj: -1 x_0 -1 x_1
Subject to
 c1: -1 x_0 <= +0
 c2: -1 x_1 <= +0
 c3: +1 x_2 <= +1
 c4: +1 x_3 <= +1
 c5: +1 soc_t_4 -1 x_2 = +1
 c6: +1 soc_t_5 -1 x_2 = -1
 c7: +1 soc_t_6 -2 x_0 = +0
 c8: + [ +1 soc_t_5 * soc_t_5 +1 soc_t_6 * soc_t_6 -1 soc_t_4 * soc_t_4 ] <= +0
 c9: +1 soc_t_7 -1 x_3 = +1
 c10: +1 soc_t_8 -1 x_3 = -1
 c11: +1 soc_t_9 -2 x_1 = +0
 c12: + [ +1 soc_t_8 * soc_t_8 +1 soc_t_9 * soc_t_9 -1 soc_t_7 * soc_t_7 ] <= +0
Bounds
 x_0 free
 x_1 free
 x_2 free
 x_3 free
 soc_t_5 free
 soc_t_6 free
 soc_t_8 free
 soc_t_9 free
End
----------------------------------------
SCIP
Maximize
 Obj: +1 x_0 +1 x_1
Subject to
 8_0: + [ +1 x_0 * x_0 ] <= +1
 8_1: + [ +1 x_1 * x_1 ] <= +1
Bounds
End