quadp (p42, positive)

Percentage Accurate: 52.6% → 85.7%

Time: 33.3s

Alternatives: 9

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: 52.6% 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: 85.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.3e+99)
   (- (/ c b) (/ b a))
   (if (<= b 5.5e-62)
     (/ (- (sqrt (- (* b b) (* 4.0 (* a c)))) b) (* a 2.0))
     (* c (- (/ -1.0 b) (* a (/ c (pow b 3.0))))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.3e+99) {
		tmp = (c / b) - (b / a);
	} else if (b <= 5.5e-62) {
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = c * ((-1.0 / b) - (a * (c / pow(b, 3.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 <= (-4.3d+99)) then
        tmp = (c / b) - (b / a)
    else if (b <= 5.5d-62) then
        tmp = (sqrt(((b * b) - (4.0d0 * (a * c)))) - b) / (a * 2.0d0)
    else
        tmp = c * (((-1.0d0) / b) - (a * (c / (b ** 3.0d0))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.3e+99) {
		tmp = (c / b) - (b / a);
	} else if (b <= 5.5e-62) {
		tmp = (Math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = c * ((-1.0 / b) - (a * (c / Math.pow(b, 3.0))));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4.3e+99:
		tmp = (c / b) - (b / a)
	elif b <= 5.5e-62:
		tmp = (math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0)
	else:
		tmp = c * ((-1.0 / b) - (a * (c / math.pow(b, 3.0))))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.3e+99)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 5.5e-62)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c * Float64(Float64(-1.0 / b) - Float64(a * Float64(c / (b ^ 3.0)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -4.3e+99)
		tmp = (c / b) - (b / a);
	elseif (b <= 5.5e-62)
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	else
		tmp = c * ((-1.0 / b) - (a * (c / (b ^ 3.0))));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.3e+99], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 5.5e-62], 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 * N[(N[(-1.0 / b), $MachinePrecision] - N[(a * N[(c / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.3000000000000001e99

   1. Initial program 50.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 50.2%

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

   3. Simplified 50.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 95.3%

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

      1. mul-1-neg 95.3%

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

      2. distribute-rgt-neg-in 95.3%

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

      3. +-commutative 95.3%

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

      4. mul-1-neg 95.3%

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

      5. unsub-neg 95.3%

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

   7. Simplified 95.3%

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

   8. Taylor expanded in a around inf 95.5%

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

   if -4.3000000000000001e99 < b < 5.50000000000000022e-62

   1. Initial program 81.0%

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

   if 5.50000000000000022e-62 < b

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

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

   3. Simplified 13.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 c around 0 88.8%

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

      1. mul-1-neg 88.8%

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

      2. associate-/l* 92.5%

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

   7. Simplified 92.5%

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

4. Final simplification 88.1%

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

Alternative 2: 80.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.7e-37)
   (- (/ c b) (/ b a))
   (if (<= b 2.75e-61)
     (/ (/ (- b (sqrt (* a (* c -4.0)))) a) -2.0)
     (* c (- (/ -1.0 b) (* a (/ c (pow b 3.0))))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.7e-37) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.75e-61) {
		tmp = ((b - sqrt((a * (c * -4.0)))) / a) / -2.0;
	} else {
		tmp = c * ((-1.0 / b) - (a * (c / pow(b, 3.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.7d-37)) then
        tmp = (c / b) - (b / a)
    else if (b <= 2.75d-61) then
        tmp = ((b - sqrt((a * (c * (-4.0d0))))) / a) / (-2.0d0)
    else
        tmp = c * (((-1.0d0) / b) - (a * (c / (b ** 3.0d0))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.7e-37) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.75e-61) {
		tmp = ((b - Math.sqrt((a * (c * -4.0)))) / a) / -2.0;
	} else {
		tmp = c * ((-1.0 / b) - (a * (c / Math.pow(b, 3.0))));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -3.7e-37:
		tmp = (c / b) - (b / a)
	elif b <= 2.75e-61:
		tmp = ((b - math.sqrt((a * (c * -4.0)))) / a) / -2.0
	else:
		tmp = c * ((-1.0 / b) - (a * (c / math.pow(b, 3.0))))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.7e-37)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 2.75e-61)
		tmp = Float64(Float64(Float64(b - sqrt(Float64(a * Float64(c * -4.0)))) / a) / -2.0);
	else
		tmp = Float64(c * Float64(Float64(-1.0 / b) - Float64(a * Float64(c / (b ^ 3.0)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -3.7e-37)
		tmp = (c / b) - (b / a);
	elseif (b <= 2.75e-61)
		tmp = ((b - sqrt((a * (c * -4.0)))) / a) / -2.0;
	else
		tmp = c * ((-1.0 / b) - (a * (c / (b ^ 3.0))));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.7e-37], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.75e-61], N[(N[(N[(b - N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] / -2.0), $MachinePrecision], N[(c * N[(N[(-1.0 / b), $MachinePrecision] - N[(a * N[(c / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.7e-37

   1. Initial program 65.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 65.2%

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

   3. Simplified 65.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 91.3%

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

      1. mul-1-neg 91.3%

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

      2. distribute-rgt-neg-in 91.3%

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

      3. +-commutative 91.3%

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

      4. mul-1-neg 91.3%

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

      5. unsub-neg 91.3%

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

   7. Simplified 91.3%

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

   8. Taylor expanded in a around inf 91.6%

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

   if -3.7e-37 < b < 2.7499999999999998e-61

   1. Initial program 76.0%

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

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

   3. Simplified 76.0%

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

      1. add-cube-cbrt 74.6%

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

      2. pow3 74.7%

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

   6. Applied egg-rr 74.7%

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

   7. Taylor expanded in a around inf 65.7%

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

      1. associate-*r* 65.7%

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

   9. Simplified 65.7%

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

       1. rem-cube-cbrt 66.9%

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

       2. associate-/r* 66.9%

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

       3. *-commutative 66.9%

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

       4. *-commutative 66.9%

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

       5. associate-*r* 66.9%

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

       6. *-commutative 66.9%

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

       7. associate-*l* 66.9%

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

   11. Applied egg-rr 66.9%

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

   if 2.7499999999999998e-61 < b

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

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

   3. Simplified 13.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 c around 0 88.8%

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

      1. mul-1-neg 88.8%

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

      2. associate-/l* 92.5%

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

   7. Simplified 92.5%

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

4. Final simplification 84.0%

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

Alternative 3: 80.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{-36}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.05 \cdot 10^{-62}:\\ \;\;\;\;\frac{\frac{b - \sqrt{a \cdot \left(c \cdot -4\right)}}{a}}{-2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5e-36)
   (- (/ c b) (/ b a))
   (if (<= b 1.05e-62)
     (/ (/ (- b (sqrt (* a (* c -4.0)))) a) -2.0)
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e-36) {
		tmp = (c / b) - (b / a);
	} else if (b <= 1.05e-62) {
		tmp = ((b - sqrt((a * (c * -4.0)))) / 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 <= (-5d-36)) then
        tmp = (c / b) - (b / a)
    else if (b <= 1.05d-62) then
        tmp = ((b - sqrt((a * (c * (-4.0d0))))) / 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 <= -5e-36) {
		tmp = (c / b) - (b / a);
	} else if (b <= 1.05e-62) {
		tmp = ((b - Math.sqrt((a * (c * -4.0)))) / a) / -2.0;
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5e-36:
		tmp = (c / b) - (b / a)
	elif b <= 1.05e-62:
		tmp = ((b - math.sqrt((a * (c * -4.0)))) / a) / -2.0
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5e-36)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 1.05e-62)
		tmp = Float64(Float64(Float64(b - sqrt(Float64(a * Float64(c * -4.0)))) / 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 <= -5e-36)
		tmp = (c / b) - (b / a);
	elseif (b <= 1.05e-62)
		tmp = ((b - sqrt((a * (c * -4.0)))) / a) / -2.0;
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5e-36], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.05e-62], N[(N[(N[(b - N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] / -2.0), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.00000000000000004e-36

   1. Initial program 65.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 65.2%

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

   3. Simplified 65.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 91.3%

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

      1. mul-1-neg 91.3%

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

      2. distribute-rgt-neg-in 91.3%

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

      3. +-commutative 91.3%

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

      4. mul-1-neg 91.3%

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

      5. unsub-neg 91.3%

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

   7. Simplified 91.3%

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

   8. Taylor expanded in a around inf 91.6%

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

   if -5.00000000000000004e-36 < b < 1.05e-62

   1. Initial program 76.0%

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

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

   3. Simplified 76.0%

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

      1. add-cube-cbrt 74.6%

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

      2. pow3 74.7%

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

   6. Applied egg-rr 74.7%

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

   7. Taylor expanded in a around inf 65.7%

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

      1. associate-*r* 65.7%

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

   9. Simplified 65.7%

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

       1. rem-cube-cbrt 66.9%

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

       2. associate-/r* 66.9%

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

       3. *-commutative 66.9%

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

       4. *-commutative 66.9%

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

       5. associate-*r* 66.9%

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

       6. *-commutative 66.9%

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

       7. associate-*l* 66.9%

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

   11. Applied egg-rr 66.9%

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

   if 1.05e-62 < b

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

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

   3. Simplified 13.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 92.4%

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

      1. associate-*r/ 92.4%

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

      2. neg-mul-1 92.4%

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

   7. Simplified 92.4%

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

4. Final simplification 83.9%

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

Alternative 4: 80.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.9e-35)
   (- (/ c b) (/ b a))
   (if (<= b 7.2e-64)
     (* (/ 0.5 a) (+ b (sqrt (* c (* a -4.0)))))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-35) {
		tmp = (c / b) - (b / a);
	} else if (b <= 7.2e-64) {
		tmp = (0.5 / a) * (b + sqrt((c * (a * -4.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 <= (-2.9d-35)) then
        tmp = (c / b) - (b / a)
    else if (b <= 7.2d-64) then
        tmp = (0.5d0 / a) * (b + sqrt((c * (a * (-4.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 <= -2.9e-35) {
		tmp = (c / b) - (b / a);
	} else if (b <= 7.2e-64) {
		tmp = (0.5 / a) * (b + Math.sqrt((c * (a * -4.0))));
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2.9e-35:
		tmp = (c / b) - (b / a)
	elif b <= 7.2e-64:
		tmp = (0.5 / a) * (b + math.sqrt((c * (a * -4.0))))
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.9e-35)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 7.2e-64)
		tmp = Float64(Float64(0.5 / a) * Float64(b + sqrt(Float64(c * Float64(a * -4.0)))));
	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-35)
		tmp = (c / b) - (b / a);
	elseif (b <= 7.2e-64)
		tmp = (0.5 / a) * (b + sqrt((c * (a * -4.0))));
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.9e-35], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 7.2e-64], N[(N[(0.5 / a), $MachinePrecision] * N[(b + N[Sqrt[N[(c * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.9000000000000002e-35

   1. Initial program 65.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 65.2%

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

   3. Simplified 65.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 91.3%

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

      1. mul-1-neg 91.3%

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

      2. distribute-rgt-neg-in 91.3%

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

      3. +-commutative 91.3%

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

      4. mul-1-neg 91.3%

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

      5. unsub-neg 91.3%

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

   7. Simplified 91.3%

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

   8. Taylor expanded in a around inf 91.6%

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

   if -2.9000000000000002e-35 < b < 7.1999999999999996e-64

   1. Initial program 76.0%

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

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

   3. Simplified 76.0%

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

      1. clear-num 75.9%

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

      2. associate-/r/ 75.8%

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

      3. *-commutative 75.8%

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

      4. associate-/r* 75.8%

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

      5. metadata-eval 75.8%

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

      6. add-sqr-sqrt 44.0%

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

      7. sqrt-unprod 75.3%

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

      8. sqr-neg 75.3%

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

      9. sqrt-prod 32.3%

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

      10. add-sqr-sqrt 65.7%

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

      11. sub-neg 65.7%

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

      12. +-commutative 65.7%

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

      13. *-commutative 65.7%

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

      14. distribute-rgt-neg-in 65.7%

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

      15. fma-define 65.7%

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

      16. metadata-eval 65.7%

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

      17. pow2 65.7%

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

   6. Applied egg-rr 65.7%

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

   7. Taylor expanded in a around inf 65.4%

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

      1. associate-*r* 65.7%

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

   9. Simplified 65.4%

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

   if 7.1999999999999996e-64 < b

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

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

   3. Simplified 13.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 92.4%

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

      1. associate-*r/ 92.4%

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

      2. neg-mul-1 92.4%

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

   7. Simplified 92.4%

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

4. Final simplification 83.5%

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

Alternative 5: 67.9% accurate, 9.7× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1e-310) (- (/ c b) (/ b a)) (/ c (- b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-310) {
		tmp = (c / b) - (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 <= (-1d-310)) then
        tmp = (c / b) - (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 <= -1e-310) {
		tmp = (c / b) - (b / a);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -9.999999999999969e-311

   1. Initial program 69.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 69.7%

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

   3. Simplified 69.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 68.4%

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

      1. mul-1-neg 68.4%

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

      2. distribute-rgt-neg-in 68.4%

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

      3. +-commutative 68.4%

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

      4. mul-1-neg 68.4%

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

      5. unsub-neg 68.4%

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

   7. Simplified 68.4%

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

   8. Taylor expanded in a around inf 70.2%

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

   if -9.999999999999969e-311 < b

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

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

   3. Simplified 31.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

   5. Taylor expanded in b around inf 68.9%

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

      1. associate-*r/ 68.9%

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

      2. neg-mul-1 68.9%

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

   7. Simplified 68.9%

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

4. Final simplification 69.6%

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

Alternative 6: 67.7% accurate, 12.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 7.2e-308) (/ b (- a)) (/ c (- b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 7.2e-308) {
		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 <= 7.2d-308) 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 <= 7.2e-308) {
		tmp = b / -a;
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

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

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 7.2e-308)
		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 <= 7.2e-308)
		tmp = b / -a;
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 7.1999999999999997e-308

   1. Initial program 69.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 69.7%

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

   3. Simplified 69.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 69.6%

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

      1. associate-*r/ 69.6%

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

      2. mul-1-neg 69.6%

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

   7. Simplified 69.6%

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

   if 7.1999999999999997e-308 < b

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

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

   3. Simplified 31.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

   5. Taylor expanded in b around inf 68.9%

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

      1. associate-*r/ 68.9%

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

      2. neg-mul-1 68.9%

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

   7. Simplified 68.9%

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

4. Final simplification 69.3%

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

Alternative 7: 43.5% accurate, 12.9× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 8.5e+16) (/ b (- a)) (/ c b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 8.5e+16) {
		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 <= 8.5d+16) 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 <= 8.5e+16) {
		tmp = b / -a;
	} else {
		tmp = c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 8.5e+16:
		tmp = b / -a
	else:
		tmp = c / b
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 8.5e16

   1. Initial program 66.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 66.2%

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

   3. Simplified 66.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 51.3%

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

      1. associate-*r/ 51.3%

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

      2. mul-1-neg 51.3%

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

   7. Simplified 51.3%

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

   if 8.5e16 < b

   1. Initial program 11.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 11.2%

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

   3. Simplified 11.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 2.8%

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

      1. mul-1-neg 2.8%

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

      2. distribute-rgt-neg-in 2.8%

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

      3. +-commutative 2.8%

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

      4. mul-1-neg 2.8%

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

      5. unsub-neg 2.8%

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

   7. Simplified 2.8%

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

   8. Taylor expanded in b around 0 27.1%

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

4. Final simplification 45.2%

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

Alternative 8: 11.1% accurate, 38.7× speedup

Math

\[\begin{array}{l} \\ \frac{c}{b} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

function code(a, b, c)
	return Float64(c / b)
end

MATLAB

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

Wolfram

code[a_, b_, c_] := N[(c / b), $MachinePrecision]

Derivation

1. Initial program 52.3%

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

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

3. Simplified 52.3%

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

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

   1. mul-1-neg 38.1%

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

   2. distribute-rgt-neg-in 38.1%

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

   3. +-commutative 38.1%

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

   4. mul-1-neg 38.1%

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

   5. unsub-neg 38.1%

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

7. Simplified 38.1%

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

8. Taylor expanded in b around 0 9.1%

   \[\leadsto \color{blue}{\frac{c}{b}} \]
9. Add Preprocessing

Alternative 9: 2.5% accurate, 38.7× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return b / 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 / a
end function

Java

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

Python

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

Julia

function code(a, b, c)
	return Float64(b / a)
end

MATLAB

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

Wolfram

code[a_, b_, c_] := N[(b / a), $MachinePrecision]

Derivation

1. Initial program 52.3%

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

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

3. Simplified 52.3%

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

   1. clear-num 52.2%

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

   2. associate-/r/ 52.2%

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

   3. *-commutative 52.2%

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

   4. associate-/r* 52.2%

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

   5. metadata-eval 52.2%

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

   6. add-sqr-sqrt 37.7%

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

   7. sqrt-unprod 50.4%

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

   8. sqr-neg 50.4%

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

   9. sqrt-prod 12.9%

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

   10. add-sqr-sqrt 33.3%

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

   11. sub-neg 33.3%

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

   12. +-commutative 33.3%

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

   13. *-commutative 33.3%

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

   14. distribute-rgt-neg-in 33.3%

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

   15. fma-define 33.3%

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

   16. metadata-eval 33.3%

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

   17. pow2 33.3%

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

6. Applied egg-rr 33.3%

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

7. Taylor expanded in a around 0 2.4%

   \[\leadsto \color{blue}{\frac{b}{a}} \]
8. Add Preprocessing

Developer Target 1: 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 2024143 
(FPCore (a b c)
  :name "quadp (p42, positive)"
  :precision binary64
  :herbie-expected 10

  :alt
  (! :herbie-platform default (let ((sqtD (let ((x (* (sqrt (fabs a)) (sqrt (fabs c))))) (if (== (copysign a c) a) (* (sqrt (- (fabs (/ b 2)) x)) (sqrt (+ (fabs (/ b 2)) x))) (hypot (/ b 2) x))))) (if (< b 0) (/ (- sqtD (/ b 2)) a) (/ (- c) (+ (/ b 2) sqtD)))))

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