rmin/1 amounts to finding a feasible solution where the objective function Func is minimal with respect to the constraints store.
Success: X $>= 3, rmin(X). The minimum value of X that satisfies the constraint is 3.