\frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a}\begin{array}{l}
\mathbf{if}\;b_2 \leq -8.28689118119158 \cdot 10^{-19}:\\
\;\;\;\;0.5 \cdot \frac{c}{b_2} - 2 \cdot \frac{b_2}{a}\\
\mathbf{elif}\;b_2 \leq 2.404015877236171 \cdot 10^{-136}:\\
\;\;\;\;\frac{1}{\frac{a}{\sqrt{b_2 \cdot b_2 - c \cdot a} - b_2}}\\
\mathbf{else}:\\
\;\;\;\;\frac{c}{b_2} \cdot -0.5\\
\end{array}(FPCore (a b_2 c) :precision binary64 (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))
(FPCore (a b_2 c)
:precision binary64
(if (<= b_2 -8.28689118119158e-19)
(- (* 0.5 (/ c b_2)) (* 2.0 (/ b_2 a)))
(if (<= b_2 2.404015877236171e-136)
(/ 1.0 (/ a (- (sqrt (- (* b_2 b_2) (* c a))) b_2)))
(* (/ c b_2) -0.5))))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 tmp;
if (b_2 <= -8.28689118119158e-19) {
tmp = (0.5 * (c / b_2)) - (2.0 * (b_2 / a));
} else if (b_2 <= 2.404015877236171e-136) {
tmp = 1.0 / (a / (sqrt((b_2 * b_2) - (c * a)) - b_2));
} else {
tmp = (c / b_2) * -0.5;
}
return tmp;
}



Bits error versus a



Bits error versus b_2



Bits error versus c
Results
if b_2 < -8.2868911811915804e-19Initial program 30.2
Simplified30.2
Taylor expanded around -inf 8.7
if -8.2868911811915804e-19 < b_2 < 2.40401587723617091e-136Initial program 13.4
Simplified13.4
rmApplied clear-num_binary6413.5
if 2.40401587723617091e-136 < b_2 Initial program 50.3
Simplified50.3
Taylor expanded around inf 12.1
Final simplification11.6
herbie shell --seed 2021024
(FPCore (a b_2 c)
:name "quad2p (problem 3.2.1, positive)"
:precision binary64
(/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))