\frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a}\begin{array}{l}
\mathbf{if}\;b_2 \le -1.59935918986980612 \cdot 10^{99}:\\
\;\;\;\;\frac{1}{2} \cdot \frac{c}{b_2} - 2 \cdot \frac{b_2}{a}\\
\mathbf{elif}\;b_2 \le 1.1645666821487491 \cdot 10^{-186}:\\
\;\;\;\;\frac{1}{\frac{a}{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}}\\
\mathbf{elif}\;b_2 \le 6.94810397910727439 \cdot 10^{-8}:\\
\;\;\;\;\frac{\frac{a}{\frac{\left(-b_2\right) - \sqrt{b_2 \cdot b_2 - a \cdot c}}{c}}}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{2} \cdot \frac{c}{b_2}\\
\end{array}double code(double a, double b_2, double c) {
return ((-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a);
}
double code(double a, double b_2, double c) {
double VAR;
if ((b_2 <= -1.599359189869806e+99)) {
VAR = ((0.5 * (c / b_2)) - (2.0 * (b_2 / a)));
} else {
double VAR_1;
if ((b_2 <= 1.164566682148749e-186)) {
VAR_1 = (1.0 / (a / (sqrt(((b_2 * b_2) - (a * c))) - b_2)));
} else {
double VAR_2;
if ((b_2 <= 6.948103979107274e-08)) {
VAR_2 = ((a / ((-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / c)) / a);
} else {
VAR_2 = (-0.5 * (c / b_2));
}
VAR_1 = VAR_2;
}
VAR = VAR_1;
}
return VAR;
}



Bits error versus a



Bits error versus b_2



Bits error versus c
Results
if b_2 < -1.599359189869806e+99Initial program 48.1
Taylor expanded around -inf 3.8
if -1.599359189869806e+99 < b_2 < 1.164566682148749e-186Initial program 10.8
rmApplied clear-num10.9
Simplified10.9
if 1.164566682148749e-186 < b_2 < 6.948103979107274e-08Initial program 30.4
rmApplied flip-+30.5
Simplified17.1
rmApplied *-un-lft-identity17.1
Applied associate-/r*17.1
Simplified12.5
if 6.948103979107274e-08 < b_2 Initial program 56.0
Taylor expanded around inf 5.7
Final simplification8.2
herbie shell --seed 2020106 +o rules:numerics
(FPCore (a b_2 c)
:name "quad2p (problem 3.2.1, positive)"
:precision binary64
(/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))