quadp (p42, positive)

Percentage Accurate: 51.9% → 86.1%

Time: 13.2s

Alternatives: 7

Speedup: 12.9×

Specification

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - (4.0d0 * (a * c))))) / (2.0d0 * a)
end function

Java

public static double code(double a, double b, double c) {
	return (-b + Math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}

Python

def code(a, b, c):
	return (-b + math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a)

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))) / Float64(2.0 * a))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-b + sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 51.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - (4.0d0 * (a * c))))) / (2.0d0 * a)
end function

Java

public static double code(double a, double b, double c) {
	return (-b + Math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}

Python

def code(a, b, c):
	return (-b + math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a)

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))) / Float64(2.0 * a))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-b + sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 86.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1 \cdot 10^{+154}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 8.5 \cdot 10^{-95}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1e+154)
   (/ b (- a))
   (if (<= b 8.5e-95)
     (/ (- (sqrt (fma b b (* c (* a -4.0)))) b) (* a 2.0))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e+154) {
		tmp = b / -a;
	} else if (b <= 8.5e-95) {
		tmp = (sqrt(fma(b, b, (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1e+154)
		tmp = Float64(b / Float64(-a));
	elseif (b <= 8.5e-95)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1e+154], N[(b / (-a)), $MachinePrecision], If[LessEqual[b, 8.5e-95], N[(N[(N[Sqrt[N[(b * b + N[(c * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.00000000000000004e154

   1. Initial program 42.8%

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

      1. *-commutative 42.8%

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

   3. Simplified 42.8%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around -inf 99.7%

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

      1. associate-*r/ 99.7%

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

      2. mul-1-neg 99.7%

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

   7. Simplified 99.7%

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

   if -1.00000000000000004e154 < b < 8.4999999999999995e-95

   1. Initial program 83.5%

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

      1. *-commutative 83.5%

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

      2. +-commutative 83.5%

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

      3. unsub-neg 83.5%

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

      4. fma-neg 83.5%

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

      5. *-commutative 83.5%

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

      6. associate-*r* 83.6%

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

      7. distribute-lft-neg-in 83.6%

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

      8. *-commutative 83.6%

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

      9. distribute-rgt-neg-in 83.6%

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

      10. associate-*r* 83.6%

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

      11. metadata-eval 83.6%

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

   3. Simplified 83.6%

      \[\leadsto \color{blue}{\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(-4 \cdot a\right)\right)} - b}{a \cdot 2}} \]
   4. Add Preprocessing

   if 8.4999999999999995e-95 < b

   1. Initial program 19.1%

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

      1. *-commutative 19.1%

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

   3. Simplified 19.1%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 86.6%

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

      1. associate-*r/ 86.6%

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

      2. neg-mul-1 86.6%

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

   7. Simplified 86.6%

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

4. Final simplification 87.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1 \cdot 10^{+154}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 8.5 \cdot 10^{-95}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 86.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4 \cdot 10^{+154}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 3 \cdot 10^{-98}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4e+154)
   (/ b (- a))
   (if (<= b 3e-98)
     (/ (- (sqrt (- (* b b) (* 4.0 (* a c)))) b) (* a 2.0))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4e+154) {
		tmp = b / -a;
	} else if (b <= 3e-98) {
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-4d+154)) then
        tmp = b / -a
    else if (b <= 3d-98) then
        tmp = (sqrt(((b * b) - (4.0d0 * (a * c)))) - b) / (a * 2.0d0)
    else
        tmp = c / -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -4e+154) {
		tmp = b / -a;
	} else if (b <= 3e-98) {
		tmp = (Math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4e+154:
		tmp = b / -a
	elif b <= 3e-98:
		tmp = (math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0)
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4e+154)
		tmp = Float64(b / Float64(-a));
	elseif (b <= 3e-98)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -4e+154)
		tmp = b / -a;
	elseif (b <= 3e-98)
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4e+154], N[(b / (-a)), $MachinePrecision], If[LessEqual[b, 3e-98], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.00000000000000015e154

   1. Initial program 42.8%

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

      1. *-commutative 42.8%

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

   3. Simplified 42.8%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around -inf 99.7%

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

      1. associate-*r/ 99.7%

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

      2. mul-1-neg 99.7%

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

   7. Simplified 99.7%

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

   if -4.00000000000000015e154 < b < 3e-98

   1. Initial program 83.5%

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

   if 3e-98 < b

   1. Initial program 19.1%

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

      1. *-commutative 19.1%

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

   3. Simplified 19.1%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 86.6%

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

      1. associate-*r/ 86.6%

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

      2. neg-mul-1 86.6%

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

   7. Simplified 86.6%

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

4. Final simplification 87.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4 \cdot 10^{+154}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 3 \cdot 10^{-98}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 81.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.2 \cdot 10^{-66}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 7 \cdot 10^{-109}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.2e-66)
   (/ b (- a))
   (if (<= b 7e-109) (/ (- (sqrt (* a (* c -4.0))) b) (* a 2.0)) (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.2e-66) {
		tmp = b / -a;
	} else if (b <= 7e-109) {
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-1.2d-66)) then
        tmp = b / -a
    else if (b <= 7d-109) then
        tmp = (sqrt((a * (c * (-4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = c / -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.2e-66) {
		tmp = b / -a;
	} else if (b <= 7e-109) {
		tmp = (Math.sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.2e-66:
		tmp = b / -a
	elif b <= 7e-109:
		tmp = (math.sqrt((a * (c * -4.0))) - b) / (a * 2.0)
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.2e-66)
		tmp = Float64(b / Float64(-a));
	elseif (b <= 7e-109)
		tmp = Float64(Float64(sqrt(Float64(a * Float64(c * -4.0))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.2e-66)
		tmp = b / -a;
	elseif (b <= 7e-109)
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.2e-66], N[(b / (-a)), $MachinePrecision], If[LessEqual[b, 7e-109], N[(N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.20000000000000013e-66

   1. Initial program 72.2%

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

      1. *-commutative 72.2%

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

   3. Simplified 72.2%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around -inf 85.9%

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

      1. associate-*r/ 85.9%

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

      2. mul-1-neg 85.9%

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

   7. Simplified 85.9%

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

   if -1.20000000000000013e-66 < b < 7e-109

   1. Initial program 74.7%

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

      1. *-commutative 74.7%

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

      2. +-commutative 74.7%

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

      3. unsub-neg 74.7%

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

      4. fma-neg 74.7%

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

      5. *-commutative 74.7%

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

      6. associate-*r* 74.8%

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

      7. distribute-lft-neg-in 74.8%

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

      8. *-commutative 74.8%

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

      9. distribute-rgt-neg-in 74.8%

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

      10. associate-*r* 74.8%

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

      11. metadata-eval 74.8%

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

   3. Simplified 74.8%

      \[\leadsto \color{blue}{\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(-4 \cdot a\right)\right)} - b}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in a around inf 74.8%

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

      1. unpow2 74.8%

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

      2. *-un-lft-identity 74.8%

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

      3. times-frac 74.8%

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

   7. Applied egg-rr 74.8%

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

   8. Taylor expanded in a around inf 69.5%

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

      1. associate-*r* 69.6%

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

      2. *-commutative 69.6%

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

      3. associate-*r* 69.6%

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

      4. *-commutative 69.6%

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

   10. Simplified 69.6%

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

   if 7e-109 < b

   1. Initial program 19.1%

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

      1. *-commutative 19.1%

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

   3. Simplified 19.1%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 86.6%

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

      1. associate-*r/ 86.6%

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

      2. neg-mul-1 86.6%

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

   7. Simplified 86.6%

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

4. Final simplification 82.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.2 \cdot 10^{-66}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 7 \cdot 10^{-109}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2 \cdot 10^{-64}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{elif}\;b \leq 4.6 \cdot 10^{-100}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{c \cdot \left(a \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2e-64)
   (/ b (- a))
   (if (<= b 4.6e-100)
     (* (/ 0.5 a) (- (sqrt (* c (* a -4.0))) b))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e-64) {
		tmp = b / -a;
	} else if (b <= 4.6e-100) {
		tmp = (0.5 / a) * (sqrt((c * (a * -4.0))) - b);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-2d-64)) then
        tmp = b / -a
    else if (b <= 4.6d-100) then
        tmp = (0.5d0 / a) * (sqrt((c * (a * (-4.0d0)))) - b)
    else
        tmp = c / -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e-64) {
		tmp = b / -a;
	} else if (b <= 4.6e-100) {
		tmp = (0.5 / a) * (Math.sqrt((c * (a * -4.0))) - b);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2e-64:
		tmp = b / -a
	elif b <= 4.6e-100:
		tmp = (0.5 / a) * (math.sqrt((c * (a * -4.0))) - b)
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2e-64)
		tmp = Float64(b / Float64(-a));
	elseif (b <= 4.6e-100)
		tmp = Float64(Float64(0.5 / a) * Float64(sqrt(Float64(c * Float64(a * -4.0))) - b));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2e-64)
		tmp = b / -a;
	elseif (b <= 4.6e-100)
		tmp = (0.5 / a) * (sqrt((c * (a * -4.0))) - b);
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2e-64], N[(b / (-a)), $MachinePrecision], If[LessEqual[b, 4.6e-100], N[(N[(0.5 / a), $MachinePrecision] * N[(N[Sqrt[N[(c * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.99999999999999993e-64

   1. Initial program 72.2%

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

      1. *-commutative 72.2%

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

   3. Simplified 72.2%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around -inf 85.9%

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

      1. associate-*r/ 85.9%

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

      2. mul-1-neg 85.9%

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

   7. Simplified 85.9%

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

   if -1.99999999999999993e-64 < b < 4.59999999999999989e-100

   1. Initial program 74.7%

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

      1. *-commutative 74.7%

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

      2. +-commutative 74.7%

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

      3. unsub-neg 74.7%

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

      4. fma-neg 74.7%

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

      5. *-commutative 74.7%

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

      6. associate-*r* 74.8%

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

      7. distribute-lft-neg-in 74.8%

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

      8. *-commutative 74.8%

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

      9. distribute-rgt-neg-in 74.8%

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

      10. associate-*r* 74.8%

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

      11. metadata-eval 74.8%

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

   3. Simplified 74.8%

      \[\leadsto \color{blue}{\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(-4 \cdot a\right)\right)} - b}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in a around inf 74.8%

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

      1. unpow2 74.8%

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

      2. *-un-lft-identity 74.8%

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

      3. times-frac 74.8%

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

   7. Applied egg-rr 74.8%

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

   8. Taylor expanded in a around inf 69.5%

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

      1. associate-*r* 69.6%

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

      2. *-commutative 69.6%

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

      3. associate-*r* 69.6%

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

      4. *-commutative 69.6%

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

   10. Simplified 69.6%

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

       1. div-sub 69.6%

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

       2. sub-neg 69.6%

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

       3. div-inv 69.5%

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

       4. metadata-eval 69.5%

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

       5. div-inv 69.5%

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

       6. clear-num 69.5%

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

       7. div-inv 69.5%

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

       8. metadata-eval 69.5%

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

       9. div-inv 69.5%

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

       10. clear-num 69.5%

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

   12. Applied egg-rr 69.5%

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

       1. distribute-lft-neg-in 69.5%

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

       2. distribute-rgt-in 69.5%

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

       3. sub-neg 69.5%

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

       4. associate-*r* 69.4%

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

       5. *-commutative 69.4%

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

       6. rem-square-sqrt 0.0%

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

       7. unpow2 0.0%

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

       8. associate-*l* 0.0%

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

       9. unpow2 0.0%

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

       10. rem-square-sqrt 69.5%

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

   14. Simplified 69.5%

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

   if 4.59999999999999989e-100 < b

   1. Initial program 19.1%

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

      1. *-commutative 19.1%

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

   3. Simplified 19.1%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 86.6%

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

      1. associate-*r/ 86.6%

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

      2. neg-mul-1 86.6%

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

   7. Simplified 86.6%

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

4. Final simplification 82.0%

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

Alternative 5: 67.7% accurate, 12.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.9 \cdot 10^{-303}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.9e-303) (/ b (- a)) (/ c (- b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.9e-303) {
		tmp = b / -a;
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= 2.9d-303) then
        tmp = b / -a
    else
        tmp = c / -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.9e-303) {
		tmp = b / -a;
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 2.9e-303:
		tmp = b / -a
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 2.9e-303)
		tmp = Float64(b / Float64(-a));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 2.9e-303)
		tmp = b / -a;
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 2.9e-303], N[(b / (-a)), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 2.90000000000000014e-303

   1. Initial program 75.1%

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

      1. *-commutative 75.1%

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

   3. Simplified 75.1%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around -inf 63.2%

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

      1. associate-*r/ 63.2%

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

      2. mul-1-neg 63.2%

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

   7. Simplified 63.2%

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

   if 2.90000000000000014e-303 < b

   1. Initial program 27.4%

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

      1. *-commutative 27.4%

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

   3. Simplified 27.4%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around inf 72.5%

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

      1. associate-*r/ 72.5%

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

      2. neg-mul-1 72.5%

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

   7. Simplified 72.5%

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

4. Final simplification 67.6%

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

Alternative 6: 44.3% accurate, 12.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.3 \cdot 10^{-307}:\\ \;\;\;\;\frac{b}{-a}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (if (<= b -3.3e-307) (/ b (- a)) 0.0))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.3e-307) {
		tmp = b / -a;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-3.3d-307)) then
        tmp = b / -a
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.3e-307) {
		tmp = b / -a;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -3.3e-307:
		tmp = b / -a
	else:
		tmp = 0.0
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.3e-307)
		tmp = Float64(b / Float64(-a));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -3.3e-307)
		tmp = b / -a;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.3e-307], N[(b / (-a)), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if b < -3.3e-307

   1. Initial program 74.7%

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

      1. *-commutative 74.7%

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

   3. Simplified 74.7%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   5. Taylor expanded in b around -inf 64.1%

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

      1. associate-*r/ 64.1%

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

      2. mul-1-neg 64.1%

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

   7. Simplified 64.1%

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

   if -3.3e-307 < b

   1. Initial program 28.6%

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

      1. *-commutative 28.6%

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

   3. Simplified 28.6%

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
   4. Add Preprocessing

   6. Applied egg-rr 27.9%

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

      1. fma-define 22.9%

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

      2. distribute-lft-neg-in 22.9%

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

      3. metadata-eval 22.9%

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

   8. Simplified 22.9%

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

   9. Taylor expanded in c around 0 12.1%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{b}{a} + 0.5 \cdot \frac{b}{a}} \]
   10. Step-by-step derivation

       1. distribute-rgt-out 12.1%

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

       2. metadata-eval 12.1%

          \[\leadsto \frac{b}{a} \cdot \color{blue}{0} \]

       3. mul0-rgt 18.9%

          \[\leadsto \color{blue}{0} \]

   11. Simplified 18.9%

       \[\leadsto \color{blue}{0} \]
3. Recombined 2 regimes into one program.

4. Final simplification 42.4%

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

Alternative 7: 11.7% accurate, 116.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 0.0)

C

double code(double a, double b, double c) {
	return 0.0;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = 0.0d0
end function

Java

public static double code(double a, double b, double c) {
	return 0.0;
}

Python

def code(a, b, c):
	return 0.0

Julia

function code(a, b, c)
	return 0.0
end

MATLAB

function tmp = code(a, b, c)
	tmp = 0.0;
end

Wolfram

code[a_, b_, c_] := 0.0

Derivation

1. Initial program 52.5%

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

   1. *-commutative 52.5%

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

3. Simplified 52.5%

   \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
4. Add Preprocessing

6. Applied egg-rr 47.9%

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

   1. fma-define 45.5%

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

   2. distribute-lft-neg-in 45.5%

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

   3. metadata-eval 45.5%

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

8. Simplified 45.5%

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

9. Taylor expanded in c around 0 7.0%

   \[\leadsto \color{blue}{-0.5 \cdot \frac{b}{a} + 0.5 \cdot \frac{b}{a}} \]
10. Step-by-step derivation

    1. distribute-rgt-out 7.0%

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

    2. metadata-eval 7.0%

       \[\leadsto \frac{b}{a} \cdot \color{blue}{0} \]

    3. mul0-rgt 10.4%

       \[\leadsto \color{blue}{0} \]

11. Simplified 10.4%

    \[\leadsto \color{blue}{0} \]
12. Add Preprocessing

Developer target: 99.7% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024108 
(FPCore (a b c)
  :name "quadp (p42, positive)"
  :precision binary64
  :herbie-expected 10

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

  (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))