quadm (p42, negative)

Percentage Accurate: 52.9% → 85.3%

Time: 17.3s

Alternatives: 6

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.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: 85.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e-94)
   (- (/ c b))
   (if (<= b 5e+127)
     (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* c a))))) (* a 2.0))
     (/ (- b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e-94) {
		tmp = -(c / b);
	} else if (b <= 5e+127) {
		tmp = (-b - sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0);
	} else {
		tmp = -b / a;
	}
	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.8d-94)) then
        tmp = -(c / b)
    else if (b <= 5d+127) then
        tmp = (-b - sqrt(((b * b) - (4.0d0 * (c * a))))) / (a * 2.0d0)
    else
        tmp = -b / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e-94) {
		tmp = -(c / b);
	} else if (b <= 5e+127) {
		tmp = (-b - Math.sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0);
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4.8e-94:
		tmp = -(c / b)
	elif b <= 5e+127:
		tmp = (-b - math.sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0)
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.8e-94)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 5e+127)
		tmp = Float64(Float64(Float64(-b) - sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(c * a))))) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -4.8e-94)
		tmp = -(c / b);
	elseif (b <= 5e+127)
		tmp = (-b - sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0);
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.8e-94], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 5e+127], N[(N[((-b) - N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-b) / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.8e-94

   1. Initial program 17.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 17.2%

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

      2. sqr-neg 17.2%

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

      3. *-commutative 17.2%

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

      4. sqr-neg 17.2%

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

      5. associate-*r* 17.2%

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

      6. *-commutative 17.2%

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

   3. Simplified 17.2%

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

   5. Taylor expanded in b around -inf 89.0%

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

      1. mul-1-neg 89.0%

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

   7. Simplified 89.0%

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

   if -4.8e-94 < b < 5.0000000000000004e127

   1. Initial program 85.0%

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

   if 5.0000000000000004e127 < b

   1. Initial program 38.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 38.6%

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

      2. sqr-neg 38.6%

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

      3. *-commutative 38.6%

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

      4. sqr-neg 38.6%

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

      5. associate-*r* 38.6%

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

      6. *-commutative 38.6%

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

   3. Simplified 38.6%

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

   5. Taylor expanded in b around inf 100.0%

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

      1. associate-*r/ 100.0%

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

      2. mul-1-neg 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 89.4%

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

Alternative 2: 80.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := -0.5 \cdot \frac{b + \sqrt{a \cdot \left(c \cdot -4\right)}}{a}\\ \mathbf{if}\;b \leq -8.5 \cdot 10^{-116}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 10^{-88}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b \leq 1100:\\ \;\;\;\;-0.5 \cdot \frac{b + \left(b + -2 \cdot \frac{a}{\frac{b}{c}}\right)}{a}\\ \mathbf{elif}\;b \leq 12000000:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (* -0.5 (/ (+ b (sqrt (* a (* c -4.0)))) a))))
   (if (<= b -8.5e-116)
     (- (/ c b))
     (if (<= b 1e-88)
       t_0
       (if (<= b 1100.0)
         (* -0.5 (/ (+ b (+ b (* -2.0 (/ a (/ b c))))) a))
         (if (<= b 12000000.0) t_0 (- (/ c b) (/ b a))))))))

C

double code(double a, double b, double c) {
	double t_0 = -0.5 * ((b + sqrt((a * (c * -4.0)))) / a);
	double tmp;
	if (b <= -8.5e-116) {
		tmp = -(c / b);
	} else if (b <= 1e-88) {
		tmp = t_0;
	} else if (b <= 1100.0) {
		tmp = -0.5 * ((b + (b + (-2.0 * (a / (b / c))))) / a);
	} else if (b <= 12000000.0) {
		tmp = t_0;
	} else {
		tmp = (c / b) - (b / a);
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = (-0.5d0) * ((b + sqrt((a * (c * (-4.0d0))))) / a)
    if (b <= (-8.5d-116)) then
        tmp = -(c / b)
    else if (b <= 1d-88) then
        tmp = t_0
    else if (b <= 1100.0d0) then
        tmp = (-0.5d0) * ((b + (b + ((-2.0d0) * (a / (b / c))))) / a)
    else if (b <= 12000000.0d0) then
        tmp = t_0
    else
        tmp = (c / b) - (b / a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = -0.5 * ((b + Math.sqrt((a * (c * -4.0)))) / a);
	double tmp;
	if (b <= -8.5e-116) {
		tmp = -(c / b);
	} else if (b <= 1e-88) {
		tmp = t_0;
	} else if (b <= 1100.0) {
		tmp = -0.5 * ((b + (b + (-2.0 * (a / (b / c))))) / a);
	} else if (b <= 12000000.0) {
		tmp = t_0;
	} else {
		tmp = (c / b) - (b / a);
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = -0.5 * ((b + math.sqrt((a * (c * -4.0)))) / a)
	tmp = 0
	if b <= -8.5e-116:
		tmp = -(c / b)
	elif b <= 1e-88:
		tmp = t_0
	elif b <= 1100.0:
		tmp = -0.5 * ((b + (b + (-2.0 * (a / (b / c))))) / a)
	elif b <= 12000000.0:
		tmp = t_0
	else:
		tmp = (c / b) - (b / a)
	return tmp

Julia

function code(a, b, c)
	t_0 = Float64(-0.5 * Float64(Float64(b + sqrt(Float64(a * Float64(c * -4.0)))) / a))
	tmp = 0.0
	if (b <= -8.5e-116)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 1e-88)
		tmp = t_0;
	elseif (b <= 1100.0)
		tmp = Float64(-0.5 * Float64(Float64(b + Float64(b + Float64(-2.0 * Float64(a / Float64(b / c))))) / a));
	elseif (b <= 12000000.0)
		tmp = t_0;
	else
		tmp = Float64(Float64(c / b) - Float64(b / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = -0.5 * ((b + sqrt((a * (c * -4.0)))) / a);
	tmp = 0.0;
	if (b <= -8.5e-116)
		tmp = -(c / b);
	elseif (b <= 1e-88)
		tmp = t_0;
	elseif (b <= 1100.0)
		tmp = -0.5 * ((b + (b + (-2.0 * (a / (b / c))))) / a);
	elseif (b <= 12000000.0)
		tmp = t_0;
	else
		tmp = (c / b) - (b / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(-0.5 * N[(N[(b + N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -8.5e-116], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 1e-88], t$95$0, If[LessEqual[b, 1100.0], N[(-0.5 * N[(N[(b + N[(b + N[(-2.0 * N[(a / N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 12000000.0], t$95$0, N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -8.4999999999999995e-116

   1. Initial program 18.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 18.4%

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

      2. sqr-neg 18.4%

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

      3. *-commutative 18.4%

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

      4. sqr-neg 18.4%

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

      5. associate-*r* 18.4%

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

      6. *-commutative 18.4%

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

   3. Simplified 18.4%

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

   5. Taylor expanded in b around -inf 86.9%

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

      1. mul-1-neg 86.9%

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

   7. Simplified 86.9%

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

   if -8.4999999999999995e-116 < b < 9.99999999999999934e-89 or 1100 < b < 1.2e7

   1. Initial program 81.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. sub-neg 81.2%

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

      2. distribute-neg-out 81.2%

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

      3. neg-mul-1 81.2%

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

      4. times-frac 81.2%

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

      5. metadata-eval 81.2%

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

      6. sub-neg 81.2%

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

      7. +-commutative 81.2%

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

      8. *-commutative 81.2%

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

      9. distribute-lft-neg-in 81.2%

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

      10. distribute-rgt-neg-out 81.2%

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

      11. associate-*l* 81.2%

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

      12. fma-def 81.2%

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

      13. distribute-lft-neg-in 81.2%

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

      14. distribute-rgt-neg-in 81.2%

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

      15. metadata-eval 81.2%

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

   3. Simplified 81.2%

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

   5. Taylor expanded in a around inf 78.4%

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

      1. *-commutative 78.4%

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

      2. associate-*r* 78.4%

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

   7. Simplified 78.4%

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

   if 9.99999999999999934e-89 < b < 1100

   1. Initial program 90.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. sub-neg 90.6%

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

      2. distribute-neg-out 90.6%

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

      3. neg-mul-1 90.6%

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

      4. times-frac 90.6%

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

      5. metadata-eval 90.6%

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

      6. sub-neg 90.6%

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

      7. +-commutative 90.6%

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

      8. *-commutative 90.6%

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

      9. distribute-lft-neg-in 90.6%

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

      10. distribute-rgt-neg-out 90.6%

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

      11. associate-*l* 90.6%

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

      12. fma-def 90.6%

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

      13. distribute-lft-neg-in 90.6%

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

      14. distribute-rgt-neg-in 90.6%

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

      15. metadata-eval 90.6%

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

   3. Simplified 90.6%

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

   5. Taylor expanded in a around 0 64.5%

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

      1. associate-/l* 64.5%

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

   7. Simplified 64.5%

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

   if 1.2e7 < b

   1. Initial program 56.9%

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

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

      2. sqr-neg 56.9%

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

      3. *-commutative 56.9%

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

      4. sqr-neg 56.9%

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

      5. associate-*r* 56.9%

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

      6. *-commutative 56.9%

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

   3. Simplified 56.9%

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

   5. Taylor expanded in b around inf 95.8%

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

      1. +-commutative 95.8%

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

      2. mul-1-neg 95.8%

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

      3. unsub-neg 95.8%

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

   7. Simplified 95.8%

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

4. Final simplification 85.6%

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

Alternative 3: 66.6% accurate, 9.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

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

      2. sqr-neg 31.6%

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

      3. *-commutative 31.6%

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

      4. sqr-neg 31.6%

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

      5. associate-*r* 31.6%

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

      6. *-commutative 31.6%

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

   3. Simplified 31.6%

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

   5. Taylor expanded in b around -inf 69.3%

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

      1. mul-1-neg 69.3%

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

   7. Simplified 69.3%

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

   if -4.999999999999985e-310 < b

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

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

      2. sqr-neg 69.5%

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

      3. *-commutative 69.5%

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

      4. sqr-neg 69.5%

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

      5. associate-*r* 69.5%

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

      6. *-commutative 69.5%

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

   3. Simplified 69.5%

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

   5. Taylor expanded in b around inf 70.2%

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

      1. +-commutative 70.2%

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

      2. mul-1-neg 70.2%

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

      3. unsub-neg 70.2%

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

   7. Simplified 70.2%

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

4. Final simplification 69.8%

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

Alternative 4: 66.4% accurate, 12.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

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

      2. sqr-neg 31.6%

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

      3. *-commutative 31.6%

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

      4. sqr-neg 31.6%

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

      5. associate-*r* 31.6%

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

      6. *-commutative 31.6%

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

   3. Simplified 31.6%

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

   5. Taylor expanded in b around -inf 69.3%

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

      1. mul-1-neg 69.3%

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

   7. Simplified 69.3%

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

   if -4.999999999999985e-310 < b

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

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

      2. sqr-neg 69.5%

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

      3. *-commutative 69.5%

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

      4. sqr-neg 69.5%

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

      5. associate-*r* 69.5%

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

      6. *-commutative 69.5%

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

   3. Simplified 69.5%

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

   5. Taylor expanded in b around inf 69.4%

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

      1. associate-*r/ 69.4%

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

      2. mul-1-neg 69.4%

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

   7. Simplified 69.4%

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

4. Final simplification 69.3%

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

Alternative 5: 34.3% accurate, 29.0× 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(-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 50.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 50.6%

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

   2. sqr-neg 50.6%

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

   3. *-commutative 50.6%

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

   4. sqr-neg 50.6%

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

   5. associate-*r* 50.6%

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

   6. *-commutative 50.6%

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

3. Simplified 50.6%

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

5. Taylor expanded in b around -inf 35.8%

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

   1. mul-1-neg 35.8%

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

7. Simplified 35.8%

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

8. Final simplification 35.8%

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

Alternative 6: 10.6% 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 50.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. sub-neg 50.6%

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

   2. distribute-neg-out 50.6%

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

   3. neg-mul-1 50.6%

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

   4. times-frac 50.6%

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

   5. metadata-eval 50.6%

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

   6. sub-neg 50.6%

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

   7. +-commutative 50.6%

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

   8. *-commutative 50.6%

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

   9. distribute-lft-neg-in 50.6%

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

   10. distribute-rgt-neg-out 50.6%

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

   11. associate-*l* 50.6%

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

   12. fma-def 50.6%

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

   13. distribute-lft-neg-in 50.6%

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

   14. distribute-rgt-neg-in 50.6%

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

   15. metadata-eval 50.6%

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

3. Simplified 50.6%

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

5. Taylor expanded in a around 0 35.4%

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

   1. associate-/l* 36.2%

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

7. Simplified 36.2%

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

8. Taylor expanded in b around 0 12.5%

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

   1. associate-*r/ 12.5%

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

   2. associate-/l* 12.5%

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

10. Simplified 12.5%

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

11. Taylor expanded in b around 0 12.5%

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

12. Final simplification 12.5%

    \[\leadsto \frac{c}{b} \]
13. 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{c}{t\_2 - \frac{b}{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b}{2} + t\_2}{-a}\\ \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) (/ c (- t_2 (/ b 2.0))) (/ (+ (/ b 2.0) t_2) (- a)))))

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 = c / (t_2 - (b / 2.0));
	} else {
		tmp_1 = ((b / 2.0) + t_2) / -a;
	}
	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 = c / (t_2 - (b / 2.0));
	} else {
		tmp_1 = ((b / 2.0) + t_2) / -a;
	}
	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 = c / (t_2 - (b / 2.0))
	else:
		tmp_1 = ((b / 2.0) + t_2) / -a
	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(c / Float64(t_2 - Float64(b / 2.0)));
	else
		tmp_1 = Float64(Float64(Float64(b / 2.0) + t_2) / Float64(-a));
	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 = c / (t_2 - (b / 2.0));
	else
		tmp_2 = ((b / 2.0) + t_2) / -a;
	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[(c / N[(t$95$2 - N[(b / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / 2.0), $MachinePrecision] + t$95$2), $MachinePrecision] / (-a)), $MachinePrecision]]]]]

Reproduce

herbie shell --seed 2024040 
(FPCore (a b c)
  :name "quadm (p42, negative)"
  :precision binary64
  :herbie-expected 10

  :herbie-target
  (if (< b 0.0) (/ c (- (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))) (/ (+ (/ 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)))))) (- a)))

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