quadp (p42, positive)

Percentage Accurate: 52.7% → 86.0%

Time: 15.6s

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.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 86.0% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -7.5e+160)
   (/ (- b) a)
   (if (<= b 9e-68)
     (/ (- (sqrt (fma a (* c -4.0) (* b b))) b) (* a 2.0))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -7.5e+160) {
		tmp = -b / a;
	} else if (b <= 9e-68) {
		tmp = (sqrt(fma(a, (c * -4.0), (b * b))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -7.5e+160)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 9e-68)
		tmp = Float64(Float64(sqrt(fma(a, Float64(c * -4.0), Float64(b * b))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -7.5e+160], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 9e-68], N[(N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -7.50000000000000028e160

   1. Initial program 35.6%

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

   2. Taylor expanded in b around -inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
   3. 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} \]

   4. Simplified 100.0%

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

   if -7.50000000000000028e160 < b < 8.99999999999999998e-68

   1. Initial program 87.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. +-lft-identity 87.0%

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

      2. metadata-eval 87.0%

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

      3. associate--r- 87.0%

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

      4. sub0-neg 87.0%

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

      5. distribute-frac-neg 87.0%

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

      6. distribute-neg-out 87.0%

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

      7. remove-double-neg 87.0%

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

      8. sub-neg 87.0%

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

      9. sub0-neg 87.0%

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

      10. distribute-frac-neg 87.0%

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

   3. Simplified 87.0%

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

   if 8.99999999999999998e-68 < b

   1. Initial program 17.4%

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

   2. Taylor expanded in b around inf 87.9%

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

      1. associate-*r/ 87.9%

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

      2. neg-mul-1 87.9%

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

   4. Simplified 87.9%

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

4. Final simplification 89.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -7.5 \cdot 10^{+160}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 9 \cdot 10^{-68}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(a, c \cdot -4, b \cdot b\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 2: 86.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -7.5e+160)
   (/ (- b) a)
   (if (<= b 1e-67)
     (/ (- (sqrt (- (* b b) (* 4.0 (* a c)))) b) (* a 2.0))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -7.5e+160) {
		tmp = -b / a;
	} else if (b <= 1e-67) {
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-7.5d+160)) then
        tmp = -b / a
    else if (b <= 1d-67) then
        tmp = (sqrt(((b * b) - (4.0d0 * (a * c)))) - b) / (a * 2.0d0)
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -7.5e+160) {
		tmp = -b / a;
	} else if (b <= 1e-67) {
		tmp = (Math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -7.5e+160:
		tmp = -b / a
	elif b <= 1e-67:
		tmp = (math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0)
	else:
		tmp = -c / b
	return tmp

Julia

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

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -7.5e+160)
		tmp = -b / a;
	elseif (b <= 1e-67)
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -7.50000000000000028e160

   1. Initial program 35.6%

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

   2. Taylor expanded in b around -inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
   3. 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} \]

   4. Simplified 100.0%

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

   if -7.50000000000000028e160 < b < 9.99999999999999943e-68

   1. Initial program 87.0%

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

   if 9.99999999999999943e-68 < b

   1. Initial program 17.4%

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

   2. Taylor expanded in b around inf 87.9%

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

      1. associate-*r/ 87.9%

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

      2. neg-mul-1 87.9%

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

   4. Simplified 87.9%

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

4. Final simplification 89.1%

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

Alternative 3: 80.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.4 \cdot 10^{-22}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.4 \cdot 10^{-69}:\\ \;\;\;\;\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 -1.4e-22)
   (- (/ c b) (/ b a))
   (if (<= b 2.4e-69)
     (* (/ -0.5 a) (- b (sqrt (* c (* a -4.0)))))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.4e-22) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.4e-69) {
		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 <= (-1.4d-22)) then
        tmp = (c / b) - (b / a)
    else if (b <= 2.4d-69) 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 <= -1.4e-22) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.4e-69) {
		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 <= -1.4e-22:
		tmp = (c / b) - (b / a)
	elif b <= 2.4e-69:
		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 <= -1.4e-22)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 2.4e-69)
		tmp = Float64(Float64(-0.5 / a) * Float64(b - sqrt(Float64(c * Float64(a * -4.0)))));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.4e-22)
		tmp = (c / b) - (b / a);
	elseif (b <= 2.4e-69)
		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, -1.4e-22], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.4e-69], 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 < -1.39999999999999997e-22

   1. Initial program 66.9%

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

   2. Taylor expanded in b around -inf 91.4%

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

   if -1.39999999999999997e-22 < b < 2.4000000000000001e-69

   1. Initial program 83.9%

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

   2. Taylor expanded in b around 0 79.1%

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

      1. *-commutative 79.1%

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

      2. associate-*r* 79.1%

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

   4. Simplified 79.1%

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

      1. frac-2neg 79.1%

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

      2. div-inv 78.9%

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

      3. distribute-neg-in 78.9%

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

      4. add-sqr-sqrt 41.4%

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

      5. sqrt-unprod 77.5%

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

      6. sqr-neg 77.5%

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

      7. unpow2 77.5%

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

      8. unpow2 77.5%

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

      9. sqrt-prod 36.7%

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

      10. add-sqr-sqrt 76.3%

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

      11. sub-neg 76.3%

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

      12. add-sqr-sqrt 39.7%

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

      13. sqrt-unprod 77.3%

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

      14. sqr-neg 77.3%

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

      15. unpow2 77.3%

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

      16. unpow2 77.3%

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

      17. sqrt-prod 37.5%

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

      18. add-sqr-sqrt 78.9%

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

      19. *-commutative 78.9%

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

      20. distribute-rgt-neg-in 78.9%

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

   6. Applied egg-rr 78.9%

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

      1. *-commutative 78.9%

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

      2. *-commutative 78.9%

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

      3. associate-/r* 78.9%

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

      4. metadata-eval 78.9%

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

      5. associate-*r* 78.9%

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

      6. *-commutative 78.9%

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

      7. associate-*l* 78.9%

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

   8. Simplified 78.9%

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

   if 2.4000000000000001e-69 < b

   1. Initial program 17.4%

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

   2. Taylor expanded in b around inf 87.9%

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

      1. associate-*r/ 87.9%

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

      2. neg-mul-1 87.9%

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

   4. Simplified 87.9%

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

4. Final simplification 86.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.4 \cdot 10^{-22}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.4 \cdot 10^{-69}:\\ \;\;\;\;\frac{-0.5}{a} \cdot \left(b - \sqrt{c \cdot \left(a \cdot -4\right)}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 4: 80.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.1e-23)
   (- (/ c b) (/ b a))
   (if (<= b 1.12e-66)
     (/ (- (sqrt (* c (* a -4.0))) b) (* a 2.0))
     (/ (- c) b))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -2.1000000000000001e-23

   1. Initial program 66.9%

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

   2. Taylor expanded in b around -inf 91.4%

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

   if -2.1000000000000001e-23 < b < 1.12000000000000004e-66

   1. Initial program 83.9%

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

   2. Taylor expanded in b around 0 79.1%

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

      1. *-commutative 79.1%

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

      2. associate-*r* 79.1%

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

   4. Simplified 79.1%

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

      1. +-commutative 79.1%

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

      2. unsub-neg 79.1%

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

   6. Applied egg-rr 79.1%

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

      1. associate-*r* 79.1%

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

      2. *-commutative 79.1%

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

      3. associate-*l* 79.1%

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

   8. Simplified 79.1%

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

   if 1.12000000000000004e-66 < b

   1. Initial program 17.4%

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

   2. Taylor expanded in b around inf 87.9%

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

      1. associate-*r/ 87.9%

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

      2. neg-mul-1 87.9%

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

   4. Simplified 87.9%

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

4. Final simplification 86.3%

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

Alternative 5: 67.3% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4 \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 -4e-310) (- (/ c b) (/ b a)) (/ (- c) b)))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4e-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 < -3.999999999999988e-310

   1. Initial program 72.2%

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

   2. Taylor expanded in b around -inf 63.9%

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

   if -3.999999999999988e-310 < b

   1. Initial program 34.8%

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

   2. Taylor expanded in b around inf 69.3%

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

      1. associate-*r/ 69.3%

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

      2. neg-mul-1 69.3%

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

   4. Simplified 69.3%

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

4. Final simplification 66.8%

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

Alternative 6: 42.7% accurate, 12.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 8200000000.0) (/ (- b) a) (/ c b)))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 8.2e9

   1. Initial program 71.6%

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

   2. Taylor expanded in b around -inf 45.1%

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

      1. associate-*r/ 45.1%

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

      2. mul-1-neg 45.1%

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

   4. Simplified 45.1%

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

   if 8.2e9 < b

   1. Initial program 14.4%

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

   2. Taylor expanded in b around -inf 2.5%

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

   3. Taylor expanded in b around 0 31.1%

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

4. Final simplification 40.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 8200000000:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b}\\ \end{array} \]

Alternative 7: 67.1% accurate, 12.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -3.999999999999988e-310

   1. Initial program 72.2%

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

   2. Taylor expanded in b around -inf 63.5%

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

      1. associate-*r/ 63.5%

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

      2. mul-1-neg 63.5%

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

   4. Simplified 63.5%

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

   if -3.999999999999988e-310 < b

   1. Initial program 34.8%

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

   2. Taylor expanded in b around inf 69.3%

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

      1. associate-*r/ 69.3%

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

      2. neg-mul-1 69.3%

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

   4. Simplified 69.3%

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

4. Final simplification 66.6%

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

Alternative 8: 2.6% 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 51.9%

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

3. Applied egg-rr 22.6%

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

   1. associate--r- 22.7%

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

   2. expm1-def 32.8%

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

   3. expm1-log1p 33.8%

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

   4. associate-+r+ 33.8%

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

   5. fma-udef 33.8%

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

   6. associate-+r+ 33.8%

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

   7. +-commutative 33.8%

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

   8. *-rgt-identity 33.8%

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

   9. distribute-rgt-in 33.8%

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

   10. *-lft-identity 33.8%

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

5. Simplified 33.8%

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

6. Taylor expanded in b around -inf 2.8%

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

7. Final simplification 2.8%

   \[\leadsto \frac{b}{a} \]

Alternative 9: 10.9% 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 51.9%

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

2. Taylor expanded in b around -inf 28.9%

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

3. Taylor expanded in b around 0 12.7%

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

4. Final simplification 12.7%

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

Developer target: 99.7% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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