quad2m (problem 3.2.1, negative)

Percentage Accurate: 52.3% → 86.6%

Time: 13.1s

Alternatives: 9

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: 52.3% 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: 86.6% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -9e-105)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 1e-15)
     (/ (+ b_2 (sqrt (- (* b_2 b_2) (* c a)))) (- a))
     (/ (- (- b_2) (* b_2 (sqrt (- 1.0 (* a (* c (pow b_2 -2.0))))))) a))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -9e-105) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 1e-15) {
		tmp = (b_2 + sqrt(((b_2 * b_2) - (c * a)))) / -a;
	} else {
		tmp = (-b_2 - (b_2 * sqrt((1.0 - (a * (c * pow(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 <= (-9d-105)) then
        tmp = ((-0.5d0) * c) / b_2
    else if (b_2 <= 1d-15) then
        tmp = (b_2 + sqrt(((b_2 * b_2) - (c * a)))) / -a
    else
        tmp = (-b_2 - (b_2 * sqrt((1.0d0 - (a * (c * (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 <= -9e-105) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 1e-15) {
		tmp = (b_2 + Math.sqrt(((b_2 * b_2) - (c * a)))) / -a;
	} else {
		tmp = (-b_2 - (b_2 * Math.sqrt((1.0 - (a * (c * Math.pow(b_2, -2.0))))))) / a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -9e-105:
		tmp = (-0.5 * c) / b_2
	elif b_2 <= 1e-15:
		tmp = (b_2 + math.sqrt(((b_2 * b_2) - (c * a)))) / -a
	else:
		tmp = (-b_2 - (b_2 * math.sqrt((1.0 - (a * (c * math.pow(b_2, -2.0))))))) / a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -9e-105)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= 1e-15)
		tmp = Float64(Float64(b_2 + sqrt(Float64(Float64(b_2 * b_2) - Float64(c * a)))) / Float64(-a));
	else
		tmp = Float64(Float64(Float64(-b_2) - Float64(b_2 * sqrt(Float64(1.0 - Float64(a * Float64(c * (b_2 ^ -2.0))))))) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -9e-105)
		tmp = (-0.5 * c) / b_2;
	elseif (b_2 <= 1e-15)
		tmp = (b_2 + sqrt(((b_2 * b_2) - (c * a)))) / -a;
	else
		tmp = (-b_2 - (b_2 * sqrt((1.0 - (a * (c * (b_2 ^ -2.0))))))) / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -9e-105], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[LessEqual[b$95$2, 1e-15], 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[((-b$95$2) - N[(b$95$2 * N[Sqrt[N[(1.0 - N[(a * N[(c * N[Power[b$95$2, -2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -8.9999999999999995e-105

   1. Initial program 14.6%

      \[\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.7%

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

      1. associate-*r/ 87.8%

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

   5. Simplified 87.8%

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

   if -8.9999999999999995e-105 < b_2 < 1.0000000000000001e-15

   1. Initial program 87.7%

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

   if 1.0000000000000001e-15 < b_2

   1. Initial program 67.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 67.0%

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

      1. mul-1-neg 67.0%

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

      2. unsub-neg 67.0%

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

      3. associate-/l* 67.1%

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

   5. Simplified 67.1%

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

      1. *-commutative 67.1%

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

      2. sqrt-prod 70.3%

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

      3. div-inv 70.3%

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

      4. pow-flip 70.3%

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

      5. metadata-eval 70.3%

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

      6. sqrt-pow1 97.8%

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

      7. metadata-eval 97.8%

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

      8. pow1 97.8%

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

   7. Applied egg-rr 97.8%

      \[\leadsto \frac{\left(-b\_2\right) - \color{blue}{\sqrt{1 - a \cdot \left(c \cdot {b\_2}^{-2}\right)} \cdot b\_2}}{a} \]
3. Recombined 3 regimes into one program.

4. Final simplification 91.3%

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

Alternative 2: 80.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.45 \cdot 10^{-102}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 6.4 \cdot 10^{-71} \lor \neg \left(b\_2 \leq 8.4 \cdot 10^{-22}\right) \land b\_2 \leq 2.8 \cdot 10^{-15}:\\ \;\;\;\;\frac{\left(-b\_2\right) - \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 -1.45e-102)
   (/ (* -0.5 c) b_2)
   (if (or (<= b_2 6.4e-71) (and (not (<= b_2 8.4e-22)) (<= b_2 2.8e-15)))
     (/ (- (- b_2) (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 <= -1.45e-102) {
		tmp = (-0.5 * c) / b_2;
	} else if ((b_2 <= 6.4e-71) || (!(b_2 <= 8.4e-22) && (b_2 <= 2.8e-15))) {
		tmp = (-b_2 - 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 <= (-1.45d-102)) then
        tmp = ((-0.5d0) * c) / b_2
    else if ((b_2 <= 6.4d-71) .or. (.not. (b_2 <= 8.4d-22)) .and. (b_2 <= 2.8d-15)) then
        tmp = (-b_2 - 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 <= -1.45e-102) {
		tmp = (-0.5 * c) / b_2;
	} else if ((b_2 <= 6.4e-71) || (!(b_2 <= 8.4e-22) && (b_2 <= 2.8e-15))) {
		tmp = (-b_2 - 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 <= -1.45e-102:
		tmp = (-0.5 * c) / b_2
	elif (b_2 <= 6.4e-71) or (not (b_2 <= 8.4e-22) and (b_2 <= 2.8e-15)):
		tmp = (-b_2 - 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 <= -1.45e-102)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif ((b_2 <= 6.4e-71) || (!(b_2 <= 8.4e-22) && (b_2 <= 2.8e-15)))
		tmp = Float64(Float64(Float64(-b_2) - sqrt(Float64(a * Float64(-c)))) / 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 <= -1.45e-102)
		tmp = (-0.5 * c) / b_2;
	elseif ((b_2 <= 6.4e-71) || (~((b_2 <= 8.4e-22)) && (b_2 <= 2.8e-15)))
		tmp = (-b_2 - 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, -1.45e-102], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[Or[LessEqual[b$95$2, 6.4e-71], And[N[Not[LessEqual[b$95$2, 8.4e-22]], $MachinePrecision], LessEqual[b$95$2, 2.8e-15]]], N[(N[((-b$95$2) - N[Sqrt[N[(a * (-c)), $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 < -1.44999999999999993e-102

   1. Initial program 14.6%

      \[\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.7%

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

      1. associate-*r/ 87.8%

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

   5. Simplified 87.8%

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

   if -1.44999999999999993e-102 < b_2 < 6.3999999999999998e-71 or 8.40000000000000031e-22 < b_2 < 2.80000000000000014e-15

   1. Initial program 87.8%

      \[\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 82.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 82.8%

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

      2. distribute-rgt-neg-out 82.8%

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

   5. Simplified 82.8%

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

   if 6.3999999999999998e-71 < b_2 < 8.40000000000000031e-22 or 2.80000000000000014e-15 < b_2

   1. Initial program 68.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 90.8%

      \[\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 87.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.45 \cdot 10^{-102}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 6.4 \cdot 10^{-71} \lor \neg \left(b\_2 \leq 8.4 \cdot 10^{-22}\right) \land b\_2 \leq 2.8 \cdot 10^{-15}:\\ \;\;\;\;\frac{\left(-b\_2\right) - \sqrt{a \cdot \left(-c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a} + 0.5 \cdot \frac{c}{b\_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 85.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1 \cdot 10^{-102}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 6.5 \cdot 10^{+98}:\\ \;\;\;\;\frac{b\_2 + \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 -1e-102)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 6.5e+98)
     (/ (+ 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 <= -1e-102) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 6.5e+98) {
		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 <= (-1d-102)) then
        tmp = ((-0.5d0) * c) / b_2
    else if (b_2 <= 6.5d+98) 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 <= -1e-102) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 6.5e+98) {
		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 <= -1e-102:
		tmp = (-0.5 * c) / b_2
	elif b_2 <= 6.5e+98:
		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 <= -1e-102)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= 6.5e+98)
		tmp = Float64(Float64(b_2 + sqrt(Float64(Float64(b_2 * b_2) - Float64(c * a)))) / 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 <= -1e-102)
		tmp = (-0.5 * c) / b_2;
	elseif (b_2 <= 6.5e+98)
		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, -1e-102], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[LessEqual[b$95$2, 6.5e+98], 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 < -9.99999999999999933e-103

   1. Initial program 14.6%

      \[\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.7%

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

      1. associate-*r/ 87.8%

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

   5. Simplified 87.8%

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

   if -9.99999999999999933e-103 < b_2 < 6.4999999999999999e98

   1. Initial program 88.5%

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

   if 6.4999999999999999e98 < b_2

   1. Initial program 54.7%

      \[\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 96.8%

      \[\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 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -1 \cdot 10^{-102}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 6.5 \cdot 10^{+98}:\\ \;\;\;\;\frac{b\_2 + \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 4: 67.6% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\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-310)
   (/ (* -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-310) {
		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-310)) 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-310) {
		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-310:
		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-310)
		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-310)
		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-310], 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 < -4.999999999999985e-310

   1. Initial program 29.6%

      \[\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 71.4%

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

      1. associate-*r/ 71.4%

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

   5. Simplified 71.4%

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

   if -4.999999999999985e-310 < b_2

   1. Initial program 75.2%

      \[\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 67.9%

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

4. Final simplification 69.5%

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

Alternative 5: 23.0% accurate, 11.2× speedup

Math

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

FPCore

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

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -20000000000.0) {
		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 <= (-20000000000.0d0)) 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 <= -20000000000.0) {
		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 <= -20000000000.0:
		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 <= -20000000000.0)
		tmp = Float64(0.5 * Float64(c / b_2));
	else
		tmp = Float64(b_2 / Float64(-a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -20000000000.0)
		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, -20000000000.0], N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision], N[(b$95$2 / (-a)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -2e10

   1. Initial program 11.6%

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

   3. Taylor expanded in a around 0 2.4%

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

      1. associate-/l* 2.5%

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

   5. Simplified 2.5%

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

   6. Taylor expanded in b_2 around 0 27.5%

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

   if -2e10 < b_2

   1. Initial program 72.8%

      \[\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 49.1%

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

      1. mul-1-neg 49.1%

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

      2. unsub-neg 49.1%

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

      3. associate-/l* 49.1%

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

   5. Simplified 49.1%

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

      1. add-sqr-sqrt 49.1%

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

      2. rem-sqrt-square 49.1%

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

      3. sqrt-prod 50.8%

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

      4. sqrt-pow1 64.8%

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

      5. metadata-eval 64.8%

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

      6. pow1 64.8%

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

      7. div-inv 63.4%

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

      8. pow-flip 63.5%

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

      9. metadata-eval 63.5%

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

   7. Applied egg-rr 63.5%

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

   8. Taylor expanded in b_2 around inf 22.7%

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

      1. mul-1-neg 22.7%

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

   10. Simplified 22.7%

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

4. Final simplification 24.2%

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

Alternative 6: 47.3% accurate, 11.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -9.2 \cdot 10^{-307}:\\ \;\;\;\;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 -9.2e-307) (* c (/ -0.5 b_2)) (/ b_2 (- a))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -9.2e-307) {
		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 <= (-9.2d-307)) 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 <= -9.2e-307) {
		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 <= -9.2e-307:
		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 <= -9.2e-307)
		tmp = Float64(c * Float64(-0.5 / b_2));
	else
		tmp = Float64(b_2 / Float64(-a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -9.2e-307)
		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, -9.2e-307], 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 < -9.1999999999999996e-307

   1. Initial program 29.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. pow1/2 29.0%

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

      2. pow-to-exp 23.2%

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

      3. pow2 23.2%

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

   4. Applied egg-rr 23.2%

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

   5. Taylor expanded in b_2 around -inf 72.0%

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

      1. associate-*r/ 72.0%

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

      2. *-rgt-identity 72.0%

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

      3. times-frac 71.8%

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

      4. /-rgt-identity 71.8%

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

   7. Simplified 71.8%

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

   if -9.1999999999999996e-307 < b_2

   1. Initial program 75.4%

      \[\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 56.1%

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

      1. mul-1-neg 56.1%

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

      2. unsub-neg 56.1%

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

      3. associate-/l* 56.2%

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

   5. Simplified 56.2%

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

      1. add-sqr-sqrt 56.2%

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

      2. rem-sqrt-square 56.2%

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

      3. sqrt-prod 58.3%

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

      4. sqrt-pow1 76.8%

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

      5. metadata-eval 76.8%

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

      6. pow1 76.8%

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

      7. div-inv 75.4%

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

      8. pow-flip 75.5%

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

      9. metadata-eval 75.5%

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

   7. Applied egg-rr 75.5%

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

   8. Taylor expanded in b_2 around inf 28.2%

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

      1. mul-1-neg 28.2%

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

   10. Simplified 28.2%

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

4. Final simplification 48.1%

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

Alternative 7: 47.4% accurate, 11.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.2 \cdot 10^{-306}:\\ \;\;\;\;\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 -1.2e-306) (/ (* -0.5 c) b_2) (/ b_2 (- a))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.2e-306) {
		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 <= (-1.2d-306)) 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 <= -1.2e-306) {
		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 <= -1.2e-306:
		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 <= -1.2e-306)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	else
		tmp = Float64(b_2 / Float64(-a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.2e-306)
		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, -1.2e-306], 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 < -1.2e-306

   1. Initial program 29.0%

      \[\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 72.0%

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

      1. associate-*r/ 72.0%

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

   5. Simplified 72.0%

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

   if -1.2e-306 < b_2

   1. Initial program 75.4%

      \[\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 56.1%

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

      1. mul-1-neg 56.1%

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

      2. unsub-neg 56.1%

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

      3. associate-/l* 56.2%

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

   5. Simplified 56.2%

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

      1. add-sqr-sqrt 56.2%

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

      2. rem-sqrt-square 56.2%

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

      3. sqrt-prod 58.3%

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

      4. sqrt-pow1 76.8%

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

      5. metadata-eval 76.8%

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

      6. pow1 76.8%

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

      7. div-inv 75.4%

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

      8. pow-flip 75.5%

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

      9. metadata-eval 75.5%

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

   7. Applied egg-rr 75.5%

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

   8. Taylor expanded in b_2 around inf 28.2%

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

      1. mul-1-neg 28.2%

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

   10. Simplified 28.2%

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

4. Final simplification 48.2%

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

Alternative 8: 67.4% accurate, 11.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -9.2 \cdot 10^{-307}:\\ \;\;\;\;\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 -9.2e-307) (/ (* -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 <= -9.2e-307) {
		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 <= (-9.2d-307)) 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 <= -9.2e-307) {
		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 <= -9.2e-307:
		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 <= -9.2e-307)
		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 <= -9.2e-307)
		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, -9.2e-307], 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 < -9.1999999999999996e-307

   1. Initial program 29.0%

      \[\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 72.0%

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

      1. associate-*r/ 72.0%

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

   5. Simplified 72.0%

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

   if -9.1999999999999996e-307 < b_2

   1. Initial program 75.4%

      \[\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 66.4%

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

      1. *-commutative 66.4%

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

   5. Simplified 66.4%

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

4. Final simplification 69.0%

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

Alternative 9: 15.0% 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(b_2 / Float64(-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 54.2%

   \[\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 37.6%

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

   1. mul-1-neg 37.6%

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

   2. unsub-neg 37.6%

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

   3. associate-/l* 37.7%

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

5. Simplified 37.7%

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

   1. add-sqr-sqrt 37.7%

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

   2. rem-sqrt-square 37.7%

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

   3. sqrt-prod 39.6%

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

   4. sqrt-pow1 55.3%

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

   5. metadata-eval 55.3%

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

   6. pow1 55.3%

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

   7. div-inv 54.3%

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

   8. pow-flip 54.4%

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

   9. metadata-eval 54.4%

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

7. Applied egg-rr 54.4%

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

8. Taylor expanded in b_2 around inf 16.6%

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

   1. mul-1-neg 16.6%

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

10. Simplified 16.6%

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

11. Final simplification 16.6%

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

Developer target: 99.6% 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 2024095 
(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))