Hi,

in the below problem I defined two constraints for which it is trivial to show analytically that they cannot be satisfied at the same time. However, the code takes lots of time and does not give back a clear unfeasibility certificate. **Why is this?** For other problems where I cannot show infeasibility analytically, the same code with other constraints works perfect.

Any help is appreciated.

```
using JuMP, EAGO
m = Model(EAGO.Optimizer)
# Define bounded variables
@variable(m, 10^(-6)<=c0<=10)
@variable(m, 10^(-6)<=c1<=10)
@variable(m, 1<=z0<=10)
@variable(m, 1<=z1<=10)
@variable(m, 10^(-6)<=v<=100)
# Define nonlinear constraints
@NLconstraint(m, e4, (18 * c1 - v^2 * (1 + z1 ) ) * (18 * c1 - v^2 * z1 ) <= -1 )
@NLconstraint(m, e5, (-18 * c1 + v^2 * (1 + z1 ))<= -1 )
# Define nonlinear objective
@NLobjective(m, Max, 0)
# Solve the optimization problem
optimize!(m)
```