quad2m (problem 3.2.1, negative)

Percentage Accurate: 53.2% → 85.6%

Time: 9.0s

Alternatives: 8

Speedup: 11.2×

Specification

Math

\[\begin{array}{l} \\ \frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

C

double code(double a, double b_2, double c) {
	return (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a
end function

Java

public static double code(double a, double b_2, double c) {
	return (-b_2 - Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
}

Python

def code(a, b_2, c):
	return (-b_2 - math.sqrt(((b_2 * b_2) - (a * c)))) / a

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) - sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a;
end

Wolfram

code[a_, b$95$2_, c_] := N[(N[((-b$95$2) - N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

Initial Program: 53.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

C

double code(double a, double b_2, double c) {
	return (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a
end function

Java

public static double code(double a, double b_2, double c) {
	return (-b_2 - Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
}

Python

def code(a, b_2, c):
	return (-b_2 - math.sqrt(((b_2 * b_2) - (a * c)))) / a

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) - sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a;
end

Wolfram

code[a_, b$95$2_, c_] := N[(N[((-b$95$2) - N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

Alternative 1: 85.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -5.4 \cdot 10^{-26}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 9 \cdot 10^{+129}:\\ \;\;\;\;\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -5.4e-26)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 9e+129)
     (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* c a)))) a)
     (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2))))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5.4e-26) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 9e+129) {
		tmp = (-b_2 - sqrt(((b_2 * b_2) - (c * a)))) / a;
	} else {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-5.4d-26)) then
        tmp = ((-0.5d0) * c) / b_2
    else if (b_2 <= 9d+129) then
        tmp = (-b_2 - sqrt(((b_2 * b_2) - (c * a)))) / a
    else
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5.4e-26) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 9e+129) {
		tmp = (-b_2 - Math.sqrt(((b_2 * b_2) - (c * a)))) / a;
	} else {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -5.4e-26:
		tmp = (-0.5 * c) / b_2
	elif b_2 <= 9e+129:
		tmp = (-b_2 - math.sqrt(((b_2 * b_2) - (c * a)))) / a
	else:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -5.4e-26)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= 9e+129)
		tmp = Float64(Float64(Float64(-b_2) - sqrt(Float64(Float64(b_2 * b_2) - Float64(c * a)))) / a);
	else
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -5.4e-26)
		tmp = (-0.5 * c) / b_2;
	elseif (b_2 <= 9e+129)
		tmp = (-b_2 - sqrt(((b_2 * b_2) - (c * a)))) / a;
	else
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -5.4e-26], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[LessEqual[b$95$2, 9e+129], N[(N[((-b$95$2) - N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -5.39999999999999963e-26

   1. Initial program 16.9%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around -inf 88.0%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. associate-*r/ 88.0%

         \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   5. Simplified 88.0%

      \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   if -5.39999999999999963e-26 < b_2 < 9.0000000000000003e129

   1. Initial program 78.8%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   if 9.0000000000000003e129 < b_2

   1. Initial program 42.1%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 97.5%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 84.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -5.4 \cdot 10^{-26}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 9 \cdot 10^{+129}:\\ \;\;\;\;\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 80.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{-0.5 \cdot c}{b\_2}\\ t_1 := \sqrt{a \cdot \left(-c\right)}\\ \mathbf{if}\;b\_2 \leq -4.1 \cdot 10^{-26}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b\_2 \leq -9.5 \cdot 10^{-76}:\\ \;\;\;\;\frac{t\_1}{-a}\\ \mathbf{elif}\;b\_2 \leq -1 \cdot 10^{-93}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b\_2 \leq 1.75 \cdot 10^{-44}:\\ \;\;\;\;\frac{\left(-b\_2\right) - t\_1}{a}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (let* ((t_0 (/ (* -0.5 c) b_2)) (t_1 (sqrt (* a (- c)))))
   (if (<= b_2 -4.1e-26)
     t_0
     (if (<= b_2 -9.5e-76)
       (/ t_1 (- a))
       (if (<= b_2 -1e-93)
         t_0
         (if (<= b_2 1.75e-44)
           (/ (- (- b_2) t_1) a)
           (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2)))))))))

C

double code(double a, double b_2, double c) {
	double t_0 = (-0.5 * c) / b_2;
	double t_1 = sqrt((a * -c));
	double tmp;
	if (b_2 <= -4.1e-26) {
		tmp = t_0;
	} else if (b_2 <= -9.5e-76) {
		tmp = t_1 / -a;
	} else if (b_2 <= -1e-93) {
		tmp = t_0;
	} else if (b_2 <= 1.75e-44) {
		tmp = (-b_2 - t_1) / a;
	} else {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = ((-0.5d0) * c) / b_2
    t_1 = sqrt((a * -c))
    if (b_2 <= (-4.1d-26)) then
        tmp = t_0
    else if (b_2 <= (-9.5d-76)) then
        tmp = t_1 / -a
    else if (b_2 <= (-1d-93)) then
        tmp = t_0
    else if (b_2 <= 1.75d-44) then
        tmp = (-b_2 - t_1) / a
    else
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double t_0 = (-0.5 * c) / b_2;
	double t_1 = Math.sqrt((a * -c));
	double tmp;
	if (b_2 <= -4.1e-26) {
		tmp = t_0;
	} else if (b_2 <= -9.5e-76) {
		tmp = t_1 / -a;
	} else if (b_2 <= -1e-93) {
		tmp = t_0;
	} else if (b_2 <= 1.75e-44) {
		tmp = (-b_2 - t_1) / a;
	} else {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	}
	return tmp;
}

Python

def code(a, b_2, c):
	t_0 = (-0.5 * c) / b_2
	t_1 = math.sqrt((a * -c))
	tmp = 0
	if b_2 <= -4.1e-26:
		tmp = t_0
	elif b_2 <= -9.5e-76:
		tmp = t_1 / -a
	elif b_2 <= -1e-93:
		tmp = t_0
	elif b_2 <= 1.75e-44:
		tmp = (-b_2 - t_1) / a
	else:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	return tmp

Julia

function code(a, b_2, c)
	t_0 = Float64(Float64(-0.5 * c) / b_2)
	t_1 = sqrt(Float64(a * Float64(-c)))
	tmp = 0.0
	if (b_2 <= -4.1e-26)
		tmp = t_0;
	elseif (b_2 <= -9.5e-76)
		tmp = Float64(t_1 / Float64(-a));
	elseif (b_2 <= -1e-93)
		tmp = t_0;
	elseif (b_2 <= 1.75e-44)
		tmp = Float64(Float64(Float64(-b_2) - t_1) / a);
	else
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	t_0 = (-0.5 * c) / b_2;
	t_1 = sqrt((a * -c));
	tmp = 0.0;
	if (b_2 <= -4.1e-26)
		tmp = t_0;
	elseif (b_2 <= -9.5e-76)
		tmp = t_1 / -a;
	elseif (b_2 <= -1e-93)
		tmp = t_0;
	elseif (b_2 <= 1.75e-44)
		tmp = (-b_2 - t_1) / a;
	else
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := Block[{t$95$0 = N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(a * (-c)), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b$95$2, -4.1e-26], t$95$0, If[LessEqual[b$95$2, -9.5e-76], N[(t$95$1 / (-a)), $MachinePrecision], If[LessEqual[b$95$2, -1e-93], t$95$0, If[LessEqual[b$95$2, 1.75e-44], N[(N[((-b$95$2) - t$95$1), $MachinePrecision] / a), $MachinePrecision], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if b_2 < -4.0999999999999999e-26 or -9.49999999999999984e-76 < b_2 < -9.999999999999999e-94

   1. Initial program 16.1%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around -inf 87.6%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. associate-*r/ 87.6%

         \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   5. Simplified 87.6%

      \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   if -4.0999999999999999e-26 < b_2 < -9.49999999999999984e-76

   1. Initial program 73.3%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. prod-diff 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\mathsf{fma}\left(b\_2, b\_2, -c \cdot a\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)}}}{a} \]

      2. *-commutative 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\mathsf{fma}\left(b\_2, b\_2, -\color{blue}{a \cdot c}\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      3. fma-neg 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left(b\_2 \cdot b\_2 - a \cdot c\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      4. prod-diff 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left(\mathsf{fma}\left(b\_2, b\_2, -c \cdot a\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      5. *-commutative 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left(\mathsf{fma}\left(b\_2, b\_2, -\color{blue}{a \cdot c}\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      6. fma-neg 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left(\color{blue}{\left(b\_2 \cdot b\_2 - a \cdot c\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      7. associate-+l+ 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left(b\_2 \cdot b\_2 - a \cdot c\right) + \left(\mathsf{fma}\left(-c, a, c \cdot a\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}}{a} \]

      8. pow2 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left(\color{blue}{{b\_2}^{2}} - a \cdot c\right) + \left(\mathsf{fma}\left(-c, a, c \cdot a\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      9. *-commutative 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(-c, a, \color{blue}{a \cdot c}\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      10. fma-undefine 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\color{blue}{\left(\left(-c\right) \cdot a + a \cdot c\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      11. distribute-lft-neg-in 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\left(\color{blue}{\left(-c \cdot a\right)} + a \cdot c\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      12. *-commutative 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\left(\left(-\color{blue}{a \cdot c}\right) + a \cdot c\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      13. distribute-rgt-neg-in 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\left(\color{blue}{a \cdot \left(-c\right)} + a \cdot c\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      14. fma-define 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\color{blue}{\mathsf{fma}\left(a, -c, a \cdot c\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      15. *-commutative 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \mathsf{fma}\left(-c, a, \color{blue}{a \cdot c}\right)\right)}}{a} \]

      16. fma-undefine 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \color{blue}{\left(\left(-c\right) \cdot a + a \cdot c\right)}\right)}}{a} \]

      17. distribute-lft-neg-in 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \left(\color{blue}{\left(-c \cdot a\right)} + a \cdot c\right)\right)}}{a} \]

      18. *-commutative 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \left(\left(-\color{blue}{a \cdot c}\right) + a \cdot c\right)\right)}}{a} \]

      19. distribute-rgt-neg-in 73.3%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \left(\color{blue}{a \cdot \left(-c\right)} + a \cdot c\right)\right)}}{a} \]

   4. Applied egg-rr 73.3%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \mathsf{fma}\left(a, -c, a \cdot c\right)\right)}}}{a} \]
   5. Step-by-step derivation

      1. count-2 73.3%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \color{blue}{2 \cdot \mathsf{fma}\left(a, -c, a \cdot c\right)}}}{a} \]

   6. Simplified 73.3%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left({b\_2}^{2} - a \cdot c\right) + 2 \cdot \mathsf{fma}\left(a, -c, a \cdot c\right)}}}{a} \]

   7. Taylor expanded in c around inf 19.2%

      \[\leadsto \color{blue}{c \cdot \left(-1 \cdot \left(\frac{1}{a} \cdot \sqrt{\frac{2 \cdot \left(a + -1 \cdot a\right) - a}{c}}\right) + -1 \cdot \frac{b\_2}{a \cdot c}\right)} \]

   8. Taylor expanded in c around inf 74.1%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{1}{a} \cdot \sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}\right)} \]
   9. Step-by-step derivation

      1. mul-1-neg 74.1%

         \[\leadsto \color{blue}{-\frac{1}{a} \cdot \sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}} \]

      2. associate-*l/ 74.1%

         \[\leadsto -\color{blue}{\frac{1 \cdot \sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}}{a}} \]

      3. *-lft-identity 74.1%

         \[\leadsto -\frac{\color{blue}{\sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}}}{a} \]

      4. distribute-neg-frac2 74.1%

         \[\leadsto \color{blue}{\frac{\sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}}{-a}} \]

      5. *-commutative 74.1%

         \[\leadsto \frac{\sqrt{\color{blue}{\left(2 \cdot \left(a + -1 \cdot a\right) - a\right) \cdot c}}}{-a} \]

      6. distribute-rgt1-in 74.1%

         \[\leadsto \frac{\sqrt{\left(2 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot a\right)} - a\right) \cdot c}}{-a} \]

      7. metadata-eval 74.1%

         \[\leadsto \frac{\sqrt{\left(2 \cdot \left(\color{blue}{0} \cdot a\right) - a\right) \cdot c}}{-a} \]

      8. mul0-lft 74.1%

         \[\leadsto \frac{\sqrt{\left(2 \cdot \color{blue}{0} - a\right) \cdot c}}{-a} \]

      9. metadata-eval 74.1%

         \[\leadsto \frac{\sqrt{\left(\color{blue}{0} - a\right) \cdot c}}{-a} \]

      10. neg-sub0 74.1%

          \[\leadsto \frac{\sqrt{\color{blue}{\left(-a\right)} \cdot c}}{-a} \]

      11. distribute-lft-neg-in 74.1%

          \[\leadsto \frac{\sqrt{\color{blue}{-a \cdot c}}}{-a} \]

      12. distribute-rgt-neg-in 74.1%

          \[\leadsto \frac{\sqrt{\color{blue}{a \cdot \left(-c\right)}}}{-a} \]

   10. Simplified 74.1%

       \[\leadsto \color{blue}{\frac{\sqrt{a \cdot \left(-c\right)}}{-a}} \]

   if -9.999999999999999e-94 < b_2 < 1.7499999999999999e-44

   1. Initial program 77.3%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around 0 75.0%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{-1 \cdot \left(a \cdot c\right)}}}{a} \]
   4. Step-by-step derivation

      1. mul-1-neg 75.0%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{-a \cdot c}}}{a} \]

      2. distribute-rgt-neg-out 75.0%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{a \cdot \left(-c\right)}}}{a} \]

   5. Simplified 75.0%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{a \cdot \left(-c\right)}}}{a} \]

   if 1.7499999999999999e-44 < b_2

   1. Initial program 68.0%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 86.9%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 3: 80.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -6.4 \cdot 10^{-26}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 2.1 \cdot 10^{-47}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(-c\right)}}{-a}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -6.4e-26)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 2.1e-47)
     (/ (sqrt (* a (- c))) (- a))
     (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2))))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -6.4e-26) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 2.1e-47) {
		tmp = sqrt((a * -c)) / -a;
	} else {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-6.4d-26)) then
        tmp = ((-0.5d0) * c) / b_2
    else if (b_2 <= 2.1d-47) then
        tmp = sqrt((a * -c)) / -a
    else
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -6.4e-26) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 2.1e-47) {
		tmp = Math.sqrt((a * -c)) / -a;
	} else {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -6.4e-26:
		tmp = (-0.5 * c) / b_2
	elif b_2 <= 2.1e-47:
		tmp = math.sqrt((a * -c)) / -a
	else:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -6.4e-26)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= 2.1e-47)
		tmp = Float64(sqrt(Float64(a * Float64(-c))) / Float64(-a));
	else
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -6.4e-26)
		tmp = (-0.5 * c) / b_2;
	elseif (b_2 <= 2.1e-47)
		tmp = sqrt((a * -c)) / -a;
	else
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -6.4e-26], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[LessEqual[b$95$2, 2.1e-47], N[(N[Sqrt[N[(a * (-c)), $MachinePrecision]], $MachinePrecision] / (-a)), $MachinePrecision], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -6.4000000000000002e-26

   1. Initial program 16.9%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around -inf 88.0%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. associate-*r/ 88.0%

         \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   5. Simplified 88.0%

      \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   if -6.4000000000000002e-26 < b_2 < 2.1000000000000001e-47

   1. Initial program 73.0%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. prod-diff 72.7%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\mathsf{fma}\left(b\_2, b\_2, -c \cdot a\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)}}}{a} \]

      2. *-commutative 72.7%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\mathsf{fma}\left(b\_2, b\_2, -\color{blue}{a \cdot c}\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      3. fma-neg 72.7%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left(b\_2 \cdot b\_2 - a \cdot c\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      4. prod-diff 72.7%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left(\mathsf{fma}\left(b\_2, b\_2, -c \cdot a\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      5. *-commutative 72.7%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left(\mathsf{fma}\left(b\_2, b\_2, -\color{blue}{a \cdot c}\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      6. fma-neg 72.7%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left(\color{blue}{\left(b\_2 \cdot b\_2 - a \cdot c\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)}}{a} \]

      7. associate-+l+ 72.5%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left(b\_2 \cdot b\_2 - a \cdot c\right) + \left(\mathsf{fma}\left(-c, a, c \cdot a\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}}{a} \]

      8. pow2 72.5%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left(\color{blue}{{b\_2}^{2}} - a \cdot c\right) + \left(\mathsf{fma}\left(-c, a, c \cdot a\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      9. *-commutative 72.5%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(-c, a, \color{blue}{a \cdot c}\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      10. fma-undefine 72.7%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\color{blue}{\left(\left(-c\right) \cdot a + a \cdot c\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      11. distribute-lft-neg-in 72.7%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\left(\color{blue}{\left(-c \cdot a\right)} + a \cdot c\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      12. *-commutative 72.7%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\left(\left(-\color{blue}{a \cdot c}\right) + a \cdot c\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      13. distribute-rgt-neg-in 72.7%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\left(\color{blue}{a \cdot \left(-c\right)} + a \cdot c\right) + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      14. fma-define 72.5%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\color{blue}{\mathsf{fma}\left(a, -c, a \cdot c\right)} + \mathsf{fma}\left(-c, a, c \cdot a\right)\right)}}{a} \]

      15. *-commutative 72.5%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \mathsf{fma}\left(-c, a, \color{blue}{a \cdot c}\right)\right)}}{a} \]

      16. fma-undefine 72.7%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \color{blue}{\left(\left(-c\right) \cdot a + a \cdot c\right)}\right)}}{a} \]

      17. distribute-lft-neg-in 72.7%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \left(\color{blue}{\left(-c \cdot a\right)} + a \cdot c\right)\right)}}{a} \]

      18. *-commutative 72.7%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \left(\left(-\color{blue}{a \cdot c}\right) + a \cdot c\right)\right)}}{a} \]

      19. distribute-rgt-neg-in 72.7%

          \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \left(\color{blue}{a \cdot \left(-c\right)} + a \cdot c\right)\right)}}{a} \]

   4. Applied egg-rr 72.5%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left({b\_2}^{2} - a \cdot c\right) + \left(\mathsf{fma}\left(a, -c, a \cdot c\right) + \mathsf{fma}\left(a, -c, a \cdot c\right)\right)}}}{a} \]
   5. Step-by-step derivation

      1. count-2 72.5%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\left({b\_2}^{2} - a \cdot c\right) + \color{blue}{2 \cdot \mathsf{fma}\left(a, -c, a \cdot c\right)}}}{a} \]

   6. Simplified 72.5%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{\left({b\_2}^{2} - a \cdot c\right) + 2 \cdot \mathsf{fma}\left(a, -c, a \cdot c\right)}}}{a} \]

   7. Taylor expanded in c around inf 28.2%

      \[\leadsto \color{blue}{c \cdot \left(-1 \cdot \left(\frac{1}{a} \cdot \sqrt{\frac{2 \cdot \left(a + -1 \cdot a\right) - a}{c}}\right) + -1 \cdot \frac{b\_2}{a \cdot c}\right)} \]

   8. Taylor expanded in c around inf 70.0%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{1}{a} \cdot \sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}\right)} \]
   9. Step-by-step derivation

      1. mul-1-neg 70.0%

         \[\leadsto \color{blue}{-\frac{1}{a} \cdot \sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}} \]

      2. associate-*l/ 70.1%

         \[\leadsto -\color{blue}{\frac{1 \cdot \sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}}{a}} \]

      3. *-lft-identity 70.1%

         \[\leadsto -\frac{\color{blue}{\sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}}}{a} \]

      4. distribute-neg-frac2 70.1%

         \[\leadsto \color{blue}{\frac{\sqrt{c \cdot \left(2 \cdot \left(a + -1 \cdot a\right) - a\right)}}{-a}} \]

      5. *-commutative 70.1%

         \[\leadsto \frac{\sqrt{\color{blue}{\left(2 \cdot \left(a + -1 \cdot a\right) - a\right) \cdot c}}}{-a} \]

      6. distribute-rgt1-in 70.1%

         \[\leadsto \frac{\sqrt{\left(2 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot a\right)} - a\right) \cdot c}}{-a} \]

      7. metadata-eval 70.1%

         \[\leadsto \frac{\sqrt{\left(2 \cdot \left(\color{blue}{0} \cdot a\right) - a\right) \cdot c}}{-a} \]

      8. mul0-lft 70.1%

         \[\leadsto \frac{\sqrt{\left(2 \cdot \color{blue}{0} - a\right) \cdot c}}{-a} \]

      9. metadata-eval 70.1%

         \[\leadsto \frac{\sqrt{\left(\color{blue}{0} - a\right) \cdot c}}{-a} \]

      10. neg-sub0 70.1%

          \[\leadsto \frac{\sqrt{\color{blue}{\left(-a\right)} \cdot c}}{-a} \]

      11. distribute-lft-neg-in 70.1%

          \[\leadsto \frac{\sqrt{\color{blue}{-a \cdot c}}}{-a} \]

      12. distribute-rgt-neg-in 70.1%

          \[\leadsto \frac{\sqrt{\color{blue}{a \cdot \left(-c\right)}}}{-a} \]

   10. Simplified 70.1%

       \[\leadsto \color{blue}{\frac{\sqrt{a \cdot \left(-c\right)}}{-a}} \]

   if 2.1000000000000001e-47 < b_2

   1. Initial program 68.0%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 86.9%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 67.6% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -5 \cdot 10^{-312}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -5e-312)
   (/ (* -0.5 c) b_2)
   (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5e-312) {
		tmp = (-0.5 * c) / b_2;
	} else {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-5d-312)) then
        tmp = ((-0.5d0) * c) / b_2
    else
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5e-312) {
		tmp = (-0.5 * c) / b_2;
	} else {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -5e-312:
		tmp = (-0.5 * c) / b_2
	else:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -5e-312)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	else
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -5e-312)
		tmp = (-0.5 * c) / b_2;
	else
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -5e-312], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -5.0000000000022e-312

   1. Initial program 36.5%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around -inf 61.1%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. associate-*r/ 61.1%

         \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   5. Simplified 61.1%

      \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   if -5.0000000000022e-312 < b_2

   1. Initial program 72.5%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 61.8%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 67.4% accurate, 11.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -5 \cdot 10^{-312}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2 \cdot -2}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -5e-312) (/ (* -0.5 c) b_2) (/ (* b_2 -2.0) a)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5e-312) {
		tmp = (-0.5 * c) / b_2;
	} else {
		tmp = (b_2 * -2.0) / a;
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-5d-312)) then
        tmp = ((-0.5d0) * c) / b_2
    else
        tmp = (b_2 * (-2.0d0)) / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5e-312) {
		tmp = (-0.5 * c) / b_2;
	} else {
		tmp = (b_2 * -2.0) / a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -5e-312:
		tmp = (-0.5 * c) / b_2
	else:
		tmp = (b_2 * -2.0) / a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -5e-312)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	else
		tmp = Float64(Float64(b_2 * -2.0) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -5e-312)
		tmp = (-0.5 * c) / b_2;
	else
		tmp = (b_2 * -2.0) / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -5e-312], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], N[(N[(b$95$2 * -2.0), $MachinePrecision] / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -5.0000000000022e-312

   1. Initial program 36.5%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around -inf 61.1%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. associate-*r/ 61.1%

         \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   5. Simplified 61.1%

      \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   if -5.0000000000022e-312 < b_2

   1. Initial program 72.5%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around inf 61.4%

      \[\leadsto \frac{\color{blue}{-2 \cdot b\_2}}{a} \]
   4. Step-by-step derivation

      1. *-commutative 61.4%

         \[\leadsto \frac{\color{blue}{b\_2 \cdot -2}}{a} \]

   5. Simplified 61.4%

      \[\leadsto \frac{\color{blue}{b\_2 \cdot -2}}{a} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 47.9% accurate, 11.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -5 \cdot 10^{-312}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -5e-312) (/ (* -0.5 c) b_2) (/ (- b_2) a)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5e-312) {
		tmp = (-0.5 * c) / b_2;
	} else {
		tmp = -b_2 / a;
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-5d-312)) then
        tmp = ((-0.5d0) * c) / b_2
    else
        tmp = -b_2 / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5e-312) {
		tmp = (-0.5 * c) / b_2;
	} else {
		tmp = -b_2 / a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -5e-312:
		tmp = (-0.5 * c) / b_2
	else:
		tmp = -b_2 / a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -5e-312)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	else
		tmp = Float64(Float64(-b_2) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -5e-312)
		tmp = (-0.5 * c) / b_2;
	else
		tmp = -b_2 / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -5e-312], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], N[((-b$95$2) / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -5.0000000000022e-312

   1. Initial program 36.5%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around -inf 61.1%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. associate-*r/ 61.1%

         \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   5. Simplified 61.1%

      \[\leadsto \color{blue}{\frac{-0.5 \cdot c}{b\_2}} \]

   if -5.0000000000022e-312 < b_2

   1. Initial program 72.5%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around 0 43.9%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{-1 \cdot \left(a \cdot c\right)}}}{a} \]
   4. Step-by-step derivation

      1. mul-1-neg 43.9%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{-a \cdot c}}}{a} \]

      2. distribute-rgt-neg-out 43.9%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{a \cdot \left(-c\right)}}}{a} \]

   5. Simplified 43.9%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{a \cdot \left(-c\right)}}}{a} \]

   6. Taylor expanded in b_2 around inf 23.4%

      \[\leadsto \color{blue}{-1 \cdot \frac{b\_2}{a}} \]
   7. Step-by-step derivation

      1. mul-1-neg 23.4%

         \[\leadsto \color{blue}{-\frac{b\_2}{a}} \]

   8. Simplified 23.4%

      \[\leadsto \color{blue}{-\frac{b\_2}{a}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 43.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -5 \cdot 10^{-312}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 22.8% accurate, 11.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.7 \cdot 10^{+46}:\\ \;\;\;\;c \cdot \frac{0.5}{b\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.7e+46) (* c (/ 0.5 b_2)) (/ (- b_2) a)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.7e+46) {
		tmp = c * (0.5 / b_2);
	} else {
		tmp = -b_2 / a;
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-1.7d+46)) then
        tmp = c * (0.5d0 / b_2)
    else
        tmp = -b_2 / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.7e+46) {
		tmp = c * (0.5 / b_2);
	} else {
		tmp = -b_2 / a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.7e+46:
		tmp = c * (0.5 / b_2)
	else:
		tmp = -b_2 / a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.7e+46)
		tmp = Float64(c * Float64(0.5 / b_2));
	else
		tmp = Float64(Float64(-b_2) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.7e+46)
		tmp = c * (0.5 / b_2);
	else
		tmp = -b_2 / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -1.7e+46], N[(c * N[(0.5 / b$95$2), $MachinePrecision]), $MachinePrecision], N[((-b$95$2) / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -1.6999999999999999e46

   1. Initial program 13.4%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. clear-num 13.4%

         \[\leadsto \color{blue}{\frac{1}{\frac{a}{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}}} \]

      2. inv-pow 13.4%

         \[\leadsto \color{blue}{{\left(\frac{a}{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}\right)}^{-1}} \]

      3. add-sqr-sqrt 9.2%

         \[\leadsto {\left(\frac{a}{\color{blue}{\sqrt{-b\_2} \cdot \sqrt{-b\_2}} - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}\right)}^{-1} \]

      4. sqrt-unprod 12.4%

         \[\leadsto {\left(\frac{a}{\color{blue}{\sqrt{\left(-b\_2\right) \cdot \left(-b\_2\right)}} - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}\right)}^{-1} \]

      5. sqr-neg 12.4%

         \[\leadsto {\left(\frac{a}{\sqrt{\color{blue}{b\_2 \cdot b\_2}} - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}\right)}^{-1} \]

      6. sqrt-prod 0.0%

         \[\leadsto {\left(\frac{a}{\color{blue}{\sqrt{b\_2} \cdot \sqrt{b\_2}} - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}\right)}^{-1} \]

      7. add-sqr-sqrt 3.5%

         \[\leadsto {\left(\frac{a}{\color{blue}{b\_2} - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}\right)}^{-1} \]

      8. sub-neg 3.5%

         \[\leadsto {\left(\frac{a}{b\_2 - \sqrt{\color{blue}{b\_2 \cdot b\_2 + \left(-a \cdot c\right)}}}\right)}^{-1} \]

      9. add-sqr-sqrt 2.8%

         \[\leadsto {\left(\frac{a}{b\_2 - \sqrt{b\_2 \cdot b\_2 + \color{blue}{\sqrt{-a \cdot c} \cdot \sqrt{-a \cdot c}}}}\right)}^{-1} \]

      10. hypot-define 3.0%

          \[\leadsto {\left(\frac{a}{b\_2 - \color{blue}{\mathsf{hypot}\left(b\_2, \sqrt{-a \cdot c}\right)}}\right)}^{-1} \]

      11. distribute-rgt-neg-in 3.0%

          \[\leadsto {\left(\frac{a}{b\_2 - \mathsf{hypot}\left(b\_2, \sqrt{\color{blue}{a \cdot \left(-c\right)}}\right)}\right)}^{-1} \]

   4. Applied egg-rr 3.0%

      \[\leadsto \color{blue}{{\left(\frac{a}{b\_2 - \mathsf{hypot}\left(b\_2, \sqrt{a \cdot \left(-c\right)}\right)}\right)}^{-1}} \]
   5. Step-by-step derivation

      1. unpow-1 3.0%

         \[\leadsto \color{blue}{\frac{1}{\frac{a}{b\_2 - \mathsf{hypot}\left(b\_2, \sqrt{a \cdot \left(-c\right)}\right)}}} \]

   6. Simplified 3.0%

      \[\leadsto \color{blue}{\frac{1}{\frac{a}{b\_2 - \mathsf{hypot}\left(b\_2, \sqrt{a \cdot \left(-c\right)}\right)}}} \]

   7. Taylor expanded in a around 0 0.0%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c \cdot {\left(\sqrt{-1}\right)}^{2}}{b\_2}} \]
   8. Step-by-step derivation

      1. *-commutative 0.0%

         \[\leadsto \color{blue}{\frac{c \cdot {\left(\sqrt{-1}\right)}^{2}}{b\_2} \cdot -0.5} \]

      2. associate-/l* 0.0%

         \[\leadsto \color{blue}{\left(c \cdot \frac{{\left(\sqrt{-1}\right)}^{2}}{b\_2}\right)} \cdot -0.5 \]

      3. associate-*r* 0.0%

         \[\leadsto \color{blue}{c \cdot \left(\frac{{\left(\sqrt{-1}\right)}^{2}}{b\_2} \cdot -0.5\right)} \]

      4. *-commutative 0.0%

         \[\leadsto c \cdot \color{blue}{\left(-0.5 \cdot \frac{{\left(\sqrt{-1}\right)}^{2}}{b\_2}\right)} \]

      5. associate-*r/ 0.0%

         \[\leadsto c \cdot \color{blue}{\frac{-0.5 \cdot {\left(\sqrt{-1}\right)}^{2}}{b\_2}} \]

      6. unpow2 0.0%

         \[\leadsto c \cdot \frac{-0.5 \cdot \color{blue}{\left(\sqrt{-1} \cdot \sqrt{-1}\right)}}{b\_2} \]

      7. rem-square-sqrt 37.2%

         \[\leadsto c \cdot \frac{-0.5 \cdot \color{blue}{-1}}{b\_2} \]

      8. metadata-eval 37.2%

         \[\leadsto c \cdot \frac{\color{blue}{0.5}}{b\_2} \]

   9. Simplified 37.2%

      \[\leadsto \color{blue}{c \cdot \frac{0.5}{b\_2}} \]

   if -1.6999999999999999e46 < b_2

   1. Initial program 68.9%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Add Preprocessing

   3. Taylor expanded in b_2 around 0 49.9%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{-1 \cdot \left(a \cdot c\right)}}}{a} \]
   4. Step-by-step derivation

      1. mul-1-neg 49.9%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{-a \cdot c}}}{a} \]

      2. distribute-rgt-neg-out 49.9%

         \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{a \cdot \left(-c\right)}}}{a} \]

   5. Simplified 49.9%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{a \cdot \left(-c\right)}}}{a} \]

   6. Taylor expanded in b_2 around inf 16.2%

      \[\leadsto \color{blue}{-1 \cdot \frac{b\_2}{a}} \]
   7. Step-by-step derivation

      1. mul-1-neg 16.2%

         \[\leadsto \color{blue}{-\frac{b\_2}{a}} \]

   8. Simplified 16.2%

      \[\leadsto \color{blue}{-\frac{b\_2}{a}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 22.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.7 \cdot 10^{+46}:\\ \;\;\;\;c \cdot \frac{0.5}{b\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 14.9% accurate, 28.0× speedup

Math

\[\begin{array}{l} \\ \frac{-b\_2}{a} \end{array} \]

FPCore

(FPCore (a b_2 c) :precision binary64 (/ (- b_2) a))

C

double code(double a, double b_2, double c) {
	return -b_2 / a;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = -b_2 / a
end function

Java

public static double code(double a, double b_2, double c) {
	return -b_2 / a;
}

Python

def code(a, b_2, c):
	return -b_2 / a

Julia

function code(a, b_2, c)
	return Float64(Float64(-b_2) / a)
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = -b_2 / a;
end

Wolfram

code[a_, b$95$2_, c_] := N[((-b$95$2) / a), $MachinePrecision]

Derivation

1. Initial program 53.5%

   \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
2. Add Preprocessing

3. Taylor expanded in b_2 around 0 36.8%

   \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{-1 \cdot \left(a \cdot c\right)}}}{a} \]
4. Step-by-step derivation

   1. mul-1-neg 36.8%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{-a \cdot c}}}{a} \]

   2. distribute-rgt-neg-out 36.8%

      \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{a \cdot \left(-c\right)}}}{a} \]

5. Simplified 36.8%

   \[\leadsto \frac{\left(-b\_2\right) - \sqrt{\color{blue}{a \cdot \left(-c\right)}}}{a} \]

6. Taylor expanded in b_2 around inf 12.4%

   \[\leadsto \color{blue}{-1 \cdot \frac{b\_2}{a}} \]
7. Step-by-step derivation

   1. mul-1-neg 12.4%

      \[\leadsto \color{blue}{-\frac{b\_2}{a}} \]

8. Simplified 12.4%

   \[\leadsto \color{blue}{-\frac{b\_2}{a}} \]

9. Final simplification 12.4%

   \[\leadsto \frac{-b\_2}{a} \]
10. Add Preprocessing

Developer target: 99.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\left|a\right|} \cdot \sqrt{\left|c\right|}\\ t_1 := \begin{array}{l} \mathbf{if}\;\mathsf{copysign}\left(a, c\right) = a:\\ \;\;\;\;\sqrt{\left|b\_2\right| - t\_0} \cdot \sqrt{\left|b\_2\right| + t\_0}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(b\_2, t\_0\right)\\ \end{array}\\ \mathbf{if}\;b\_2 < 0:\\ \;\;\;\;\frac{c}{t\_1 - b\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2 + t\_1}{-a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (let* ((t_0 (* (sqrt (fabs a)) (sqrt (fabs c))))
        (t_1
         (if (== (copysign a c) a)
           (* (sqrt (- (fabs b_2) t_0)) (sqrt (+ (fabs b_2) t_0)))
           (hypot b_2 t_0))))
   (if (< b_2 0.0) (/ c (- t_1 b_2)) (/ (+ b_2 t_1) (- a)))))

C

double code(double a, double b_2, double c) {
	double t_0 = sqrt(fabs(a)) * sqrt(fabs(c));
	double tmp;
	if (copysign(a, c) == a) {
		tmp = sqrt((fabs(b_2) - t_0)) * sqrt((fabs(b_2) + t_0));
	} else {
		tmp = hypot(b_2, t_0);
	}
	double t_1 = tmp;
	double tmp_1;
	if (b_2 < 0.0) {
		tmp_1 = c / (t_1 - b_2);
	} else {
		tmp_1 = (b_2 + t_1) / -a;
	}
	return tmp_1;
}

Java

public static double code(double a, double b_2, double c) {
	double t_0 = Math.sqrt(Math.abs(a)) * Math.sqrt(Math.abs(c));
	double tmp;
	if (Math.copySign(a, c) == a) {
		tmp = Math.sqrt((Math.abs(b_2) - t_0)) * Math.sqrt((Math.abs(b_2) + t_0));
	} else {
		tmp = Math.hypot(b_2, t_0);
	}
	double t_1 = tmp;
	double tmp_1;
	if (b_2 < 0.0) {
		tmp_1 = c / (t_1 - b_2);
	} else {
		tmp_1 = (b_2 + t_1) / -a;
	}
	return tmp_1;
}

Python

def code(a, b_2, c):
	t_0 = math.sqrt(math.fabs(a)) * math.sqrt(math.fabs(c))
	tmp = 0
	if math.copysign(a, c) == a:
		tmp = math.sqrt((math.fabs(b_2) - t_0)) * math.sqrt((math.fabs(b_2) + t_0))
	else:
		tmp = math.hypot(b_2, t_0)
	t_1 = tmp
	tmp_1 = 0
	if b_2 < 0.0:
		tmp_1 = c / (t_1 - b_2)
	else:
		tmp_1 = (b_2 + t_1) / -a
	return tmp_1

Julia

function code(a, b_2, c)
	t_0 = Float64(sqrt(abs(a)) * sqrt(abs(c)))
	tmp = 0.0
	if (copysign(a, c) == a)
		tmp = Float64(sqrt(Float64(abs(b_2) - t_0)) * sqrt(Float64(abs(b_2) + t_0)));
	else
		tmp = hypot(b_2, t_0);
	end
	t_1 = tmp
	tmp_1 = 0.0
	if (b_2 < 0.0)
		tmp_1 = Float64(c / Float64(t_1 - b_2));
	else
		tmp_1 = Float64(Float64(b_2 + t_1) / Float64(-a));
	end
	return tmp_1
end

MATLAB

function tmp_3 = code(a, b_2, c)
	t_0 = sqrt(abs(a)) * sqrt(abs(c));
	tmp = 0.0;
	if ((sign(c) * abs(a)) == a)
		tmp = sqrt((abs(b_2) - t_0)) * sqrt((abs(b_2) + t_0));
	else
		tmp = hypot(b_2, t_0);
	end
	t_1 = tmp;
	tmp_2 = 0.0;
	if (b_2 < 0.0)
		tmp_2 = c / (t_1 - b_2);
	else
		tmp_2 = (b_2 + t_1) / -a;
	end
	tmp_3 = tmp_2;
end

Wolfram

code[a_, b$95$2_, c_] := Block[{t$95$0 = N[(N[Sqrt[N[Abs[a], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[c], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = If[Equal[N[With[{TMP1 = Abs[a], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], a], N[(N[Sqrt[N[(N[Abs[b$95$2], $MachinePrecision] - t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[Abs[b$95$2], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[b$95$2 ^ 2 + t$95$0 ^ 2], $MachinePrecision]]}, If[Less[b$95$2, 0.0], N[(c / N[(t$95$1 - b$95$2), $MachinePrecision]), $MachinePrecision], N[(N[(b$95$2 + t$95$1), $MachinePrecision] / (-a)), $MachinePrecision]]]]

Reproduce

herbie shell --seed 2024107 
(FPCore (a b_2 c)
  :name "quad2m (problem 3.2.1, negative)"
  :precision binary64
  :herbie-expected 10

  :alt
  (if (< b_2 0.0) (/ c (- (if (== (copysign a c) a) (* (sqrt (- (fabs b_2) (* (sqrt (fabs a)) (sqrt (fabs c))))) (sqrt (+ (fabs b_2) (* (sqrt (fabs a)) (sqrt (fabs c)))))) (hypot b_2 (* (sqrt (fabs a)) (sqrt (fabs c))))) b_2)) (/ (+ b_2 (if (== (copysign a c) a) (* (sqrt (- (fabs b_2) (* (sqrt (fabs a)) (sqrt (fabs c))))) (sqrt (+ (fabs b_2) (* (sqrt (fabs a)) (sqrt (fabs c)))))) (hypot b_2 (* (sqrt (fabs a)) (sqrt (fabs c)))))) (- a)))

  (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))