quad2m (problem 3.2.1, negative)

Percentage Accurate: 51.9% → 87.3%

Time: 11.6s

Alternatives: 11

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: 51.9% 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: 87.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -4.8 \cdot 10^{-22}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq -1.45 \cdot 10^{-119}:\\ \;\;\;\;\frac{\frac{\left({b\_2}^{2} - {b\_2}^{2}\right) + c \cdot a}{\mathsf{fma}\left(-1, b\_2, \sqrt{{b\_2}^{2} - c \cdot a}\right)}}{a}\\ \mathbf{elif}\;b\_2 \leq 2 \cdot 10^{+139}:\\ \;\;\;\;\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 -4.8e-22)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 -1.45e-119)
     (/
      (/
       (+ (- (pow b_2 2.0) (pow b_2 2.0)) (* c a))
       (fma -1.0 b_2 (sqrt (- (pow b_2 2.0) (* c a)))))
      a)
     (if (<= b_2 2e+139)
       (/ (- (- 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 <= -4.8e-22) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= -1.45e-119) {
		tmp = (((pow(b_2, 2.0) - pow(b_2, 2.0)) + (c * a)) / fma(-1.0, b_2, sqrt((pow(b_2, 2.0) - (c * a))))) / a;
	} else if (b_2 <= 2e+139) {
		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;
}

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -4.8e-22)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= -1.45e-119)
		tmp = Float64(Float64(Float64(Float64((b_2 ^ 2.0) - (b_2 ^ 2.0)) + Float64(c * a)) / fma(-1.0, b_2, sqrt(Float64((b_2 ^ 2.0) - Float64(c * a))))) / a);
	elseif (b_2 <= 2e+139)
		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

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -4.8e-22], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[LessEqual[b$95$2, -1.45e-119], N[(N[(N[(N[(N[Power[b$95$2, 2.0], $MachinePrecision] - N[Power[b$95$2, 2.0], $MachinePrecision]), $MachinePrecision] + N[(c * a), $MachinePrecision]), $MachinePrecision] / N[(-1.0 * b$95$2 + N[Sqrt[N[(N[Power[b$95$2, 2.0], $MachinePrecision] - N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 2e+139], 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 4 regimes

2. if b_2 < -4.80000000000000005e-22

   1. Initial program 13.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 92.7%

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

      1. associate-*r/ 92.7%

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

   5. Simplified 92.7%

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

   if -4.80000000000000005e-22 < b_2 < -1.45e-119

   1. Initial program 69.5%

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

      1. add-sqr-sqrt 68.7%

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

      2. pow2 68.7%

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

      3. pow1/2 68.7%

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

      4. sqrt-pow1 68.7%

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

      5. pow2 68.7%

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

      6. metadata-eval 68.7%

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

   4. Applied egg-rr 68.7%

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

      1. flip-- 68.9%

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

      2. pow2 68.9%

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

      3. pow-pow 69.1%

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

      4. pow2 69.1%

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

      5. metadata-eval 69.1%

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

      6. pow-pow 69.1%

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

      7. pow2 69.1%

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

      8. metadata-eval 69.1%

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

      9. pow-prod-up 69.2%

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

      10. metadata-eval 69.2%

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

      11. pow1 69.2%

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

      12. pow2 69.2%

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

   6. Applied egg-rr 69.8%

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

      1. associate--r- 99.2%

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

      2. unpow2 99.2%

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

      3. sqr-neg 99.2%

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

      4. unpow2 99.2%

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

   8. Simplified 99.2%

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

   if -1.45e-119 < b_2 < 2.00000000000000007e139

   1. Initial program 84.1%

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

   if 2.00000000000000007e139 < b_2

   1. Initial program 52.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 95.8%

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

4. Final simplification 90.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -4.8 \cdot 10^{-22}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq -1.45 \cdot 10^{-119}:\\ \;\;\;\;\frac{\frac{\left({b\_2}^{2} - {b\_2}^{2}\right) + c \cdot a}{\mathsf{fma}\left(-1, b\_2, \sqrt{{b\_2}^{2} - c \cdot a}\right)}}{a}\\ \mathbf{elif}\;b\_2 \leq 2 \cdot 10^{+139}:\\ \;\;\;\;\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: 85.8% accurate, 0.9× speedup

Math

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

   1. Initial program 16.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 90.1%

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

      1. associate-*r/ 90.1%

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

   5. Simplified 90.1%

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

   if -2.55e-65 < b_2 < 1.00000000000000003e139

   1. Initial program 83.8%

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

   if 1.00000000000000003e139 < b_2

   1. Initial program 52.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 95.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 88.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.55 \cdot 10^{-65}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 10^{+139}:\\ \;\;\;\;\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 3: 80.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.4 \cdot 10^{-64}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 2.5 \cdot 10^{-57}:\\ \;\;\;\;\frac{\left(-b\_2\right) - \sqrt{c \cdot \left(-a\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.4e-64)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 2.5e-57)
     (/ (- (- b_2) (sqrt (* 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 <= -1.4e-64) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 2.5e-57) {
		tmp = (-b_2 - sqrt((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 <= (-1.4d-64)) then
        tmp = ((-0.5d0) * c) / b_2
    else if (b_2 <= 2.5d-57) then
        tmp = (-b_2 - sqrt((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 <= -1.4e-64) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 2.5e-57) {
		tmp = (-b_2 - Math.sqrt((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 <= -1.4e-64:
		tmp = (-0.5 * c) / b_2
	elif b_2 <= 2.5e-57:
		tmp = (-b_2 - math.sqrt((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 <= -1.4e-64)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= 2.5e-57)
		tmp = Float64(Float64(Float64(-b_2) - sqrt(Float64(c * Float64(-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 <= -1.4e-64)
		tmp = (-0.5 * c) / b_2;
	elseif (b_2 <= 2.5e-57)
		tmp = (-b_2 - sqrt((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, -1.4e-64], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[LessEqual[b$95$2, 2.5e-57], N[(N[((-b$95$2) - N[Sqrt[N[(c * (-a)), $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.40000000000000002e-64

   1. Initial program 16.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 90.1%

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

      1. associate-*r/ 90.1%

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

   5. Simplified 90.1%

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

   if -1.40000000000000002e-64 < b_2 < 2.5000000000000001e-57

   1. Initial program 79.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 0 72.3%

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

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

      2. distribute-rgt-neg-out 72.3%

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

   5. Simplified 72.3%

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

   if 2.5000000000000001e-57 < b_2

   1. Initial program 69.6%

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

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

Alternative 4: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -8.4 \cdot 10^{-65}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 1.85 \cdot 10^{-57}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(-a\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 -8.4e-65)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 1.85e-57)
     (/ (sqrt (* 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 <= -8.4e-65) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 1.85e-57) {
		tmp = sqrt((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 <= (-8.4d-65)) then
        tmp = ((-0.5d0) * c) / b_2
    else if (b_2 <= 1.85d-57) then
        tmp = sqrt((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 <= -8.4e-65) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 1.85e-57) {
		tmp = Math.sqrt((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 <= -8.4e-65:
		tmp = (-0.5 * c) / b_2
	elif b_2 <= 1.85e-57:
		tmp = math.sqrt((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 <= -8.4e-65)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= 1.85e-57)
		tmp = Float64(sqrt(Float64(c * Float64(-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 <= -8.4e-65)
		tmp = (-0.5 * c) / b_2;
	elseif (b_2 <= 1.85e-57)
		tmp = sqrt((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, -8.4e-65], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[LessEqual[b$95$2, 1.85e-57], N[(N[Sqrt[N[(c * (-a)), $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 < -8.40000000000000011e-65

   1. Initial program 16.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 90.1%

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

      1. associate-*r/ 90.1%

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

   5. Simplified 90.1%

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

   if -8.40000000000000011e-65 < b_2 < 1.85e-57

   1. Initial program 79.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. prod-diff 79.0%

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

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

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

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

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

         \[\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+ 79.1%

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

      \[\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 b_2 around 0 70.6%

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

      1. mul-1-neg 70.6%

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

      2. associate-*l/ 70.6%

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

      3. *-lft-identity 70.6%

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

      4. distribute-lft1-in 70.6%

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

      5. metadata-eval 70.6%

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

      6. mul0-lft 71.0%

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

      7. metadata-eval 71.0%

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

      8. neg-sub0 71.0%

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

      9. *-commutative 71.0%

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

      10. distribute-rgt-neg-in 71.0%

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

      11. neg-sub0 71.0%

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

      12. metadata-eval 71.0%

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

      13. mul0-lft 71.0%

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

      14. metadata-eval 71.0%

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

      15. distribute-rgt1-in 71.0%

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

   9. Simplified 71.0%

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

   if 1.85e-57 < b_2

   1. Initial program 69.6%

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

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

Alternative 5: 71.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.3 \cdot 10^{-111}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 5.6 \cdot 10^{-185}:\\ \;\;\;\;-\sqrt{\frac{c}{-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 -2.3e-111)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 5.6e-185)
     (- (sqrt (/ 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 <= -2.3e-111) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 5.6e-185) {
		tmp = -sqrt((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 <= (-2.3d-111)) then
        tmp = ((-0.5d0) * c) / b_2
    else if (b_2 <= 5.6d-185) then
        tmp = -sqrt((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 <= -2.3e-111) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 5.6e-185) {
		tmp = -Math.sqrt((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 <= -2.3e-111:
		tmp = (-0.5 * c) / b_2
	elif b_2 <= 5.6e-185:
		tmp = -math.sqrt((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 <= -2.3e-111)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= 5.6e-185)
		tmp = Float64(-sqrt(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 <= -2.3e-111)
		tmp = (-0.5 * c) / b_2;
	elseif (b_2 <= 5.6e-185)
		tmp = -sqrt((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, -2.3e-111], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[LessEqual[b$95$2, 5.6e-185], (-N[Sqrt[N[(c / (-a)), $MachinePrecision]], $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 < -2.3e-111

   1. Initial program 20.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 86.2%

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

      1. associate-*r/ 86.2%

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

   5. Simplified 86.2%

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

   if -2.3e-111 < b_2 < 5.59999999999999983e-185

   1. Initial program 77.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 76.8%

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

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

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

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

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

         \[\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+ 77.0%

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

      \[\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 a around inf 32.8%

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

      1. mul-1-neg 32.8%

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

      2. distribute-rgt1-in 32.8%

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

      3. metadata-eval 32.8%

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

      4. mul0-lft 32.8%

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

      5. metadata-eval 32.8%

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

      6. neg-sub0 32.8%

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

   9. Simplified 32.8%

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

   if 5.59999999999999983e-185 < 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 c around 0 76.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. Final simplification 73.7%

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

Alternative 6: 67.8% accurate, 7.0× speedup

Math

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

   1. Initial program 31.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 71.0%

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

      1. associate-*r/ 71.0%

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

   5. Simplified 71.0%

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

   if -1.000000000000002e-309 < b_2

   1. Initial program 72.9%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -1 \cdot 10^{-309}:\\ \;\;\;\;\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 7: 23.2% accurate, 11.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -260000000000:\\ \;\;\;\;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 -260000000000.0) (* 0.5 (/ c b_2)) (/ b_2 (- a))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -260000000000.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 <= (-260000000000.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 <= -260000000000.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 <= -260000000000.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 <= -260000000000.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 <= -260000000000.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, -260000000000.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 < -2.6e11

   1. Initial program 13.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 2.4%

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

      1. associate-*r/ 2.4%

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

      2. metadata-eval 2.4%

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

   5. Simplified 2.4%

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

   6. Taylor expanded in b_2 around 0 29.5%

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

   if -2.6e11 < b_2

   1. Initial program 71.9%

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

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

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

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

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

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

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

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

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

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

          \[\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 71.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 71.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 71.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) + \color{blue}{\left(\left(-c\right) \cdot a + a \cdot c\right)}\right)}}{a} \]

      17. distribute-lft-neg-in 71.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) + \left(\color{blue}{\left(-c \cdot a\right)} + a \cdot c\right)\right)}}{a} \]

      18. *-commutative 71.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) + \left(\left(-\color{blue}{a \cdot c}\right) + a \cdot c\right)\right)}}{a} \]

      19. distribute-rgt-neg-in 71.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) + \left(\color{blue}{a \cdot \left(-c\right)} + a \cdot c\right)\right)}}{a} \]

   4. Applied egg-rr 71.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 71.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 71.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. Step-by-step derivation

      1. unpow2 71.5%

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

   8. Applied egg-rr 71.5%

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

   9. Taylor expanded in c around inf 30.7%

      \[\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)} \]
   10. Step-by-step derivation

       1. mul-1-neg 30.7%

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

       2. unsub-neg 30.7%

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

   11. Simplified 31.9%

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

   12. Taylor expanded in b_2 around inf 24.2%

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

       1. mul-1-neg 24.2%

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

       2. distribute-frac-neg 24.2%

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

   14. Simplified 24.2%

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

4. Final simplification 25.9%

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

Alternative 8: 43.2% accurate, 11.2× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.7e+14) (* 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 <= -1.7e+14) {
		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 <= (-1.7d+14)) 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 <= -1.7e+14) {
		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 <= -1.7e+14:
		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 <= -1.7e+14)
		tmp = Float64(0.5 * Float64(c / b_2));
	else
		tmp = Float64(b_2 * Float64(-2.0 / a));
	end
	return tmp
end

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -1.7e14

   1. Initial program 13.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 2.4%

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

      1. associate-*r/ 2.4%

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

      2. metadata-eval 2.4%

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

   5. Simplified 2.4%

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

   6. Taylor expanded in b_2 around 0 29.5%

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

   if -1.7e14 < b_2

   1. Initial program 71.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 52.5%

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

      1. associate-*r/ 52.5%

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

      2. metadata-eval 52.5%

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

   5. Simplified 52.5%

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

   6. Taylor expanded in c around 0 53.2%

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

4. Final simplification 45.7%

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

Alternative 9: 67.5% accurate, 11.2× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -9e-309) (/ (* -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 <= -9e-309) {
		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 <= (-9d-309)) 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 <= -9e-309) {
		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 <= -9e-309:
		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 <= -9e-309)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	else
		tmp = Float64(b_2 * Float64(-2.0 / a));
	end
	return tmp
end

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -9.0000000000000021e-309

   1. Initial program 31.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 71.0%

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

      1. associate-*r/ 71.0%

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

   5. Simplified 71.0%

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

   if -9.0000000000000021e-309 < b_2

   1. Initial program 72.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 67.6%

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

      1. associate-*r/ 67.6%

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

      2. metadata-eval 67.6%

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

   5. Simplified 67.6%

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

   6. Taylor expanded in c around 0 68.1%

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

4. Final simplification 69.5%

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

Alternative 10: 67.6% accurate, 11.2× speedup

Math

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

   1. Initial program 31.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 71.0%

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

      1. associate-*r/ 71.0%

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

   5. Simplified 71.0%

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

   if -1.000000000000002e-309 < b_2

   1. Initial program 72.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 68.4%

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

      1. *-commutative 68.4%

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

   5. Simplified 68.4%

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

4. Final simplification 69.6%

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

Alternative 11: 15.3% 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 53.5%

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

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

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

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

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

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

      \[\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+ 53.2%

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

   \[\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. Step-by-step derivation

   1. unpow2 53.2%

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

8. Applied egg-rr 53.2%

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

9. Taylor expanded in c around inf 22.4%

   \[\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)} \]
10. Step-by-step derivation

    1. mul-1-neg 22.4%

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

    2. unsub-neg 22.4%

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

11. Simplified 23.2%

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

12. Taylor expanded in b_2 around inf 17.3%

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

    1. mul-1-neg 17.3%

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

    2. distribute-frac-neg 17.3%

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

14. Simplified 17.3%

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

15. Final simplification 17.3%

    \[\leadsto \frac{b\_2}{-a} \]
16. 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 2024110 
(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))