Quadratic roots, full range

Percentage Accurate: 52.1% → 83.8%

Time: 7.9s

Alternatives: 8

Speedup: 2.5×

Specification

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{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(Float64(4.0 * 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[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 52.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{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(Float64(4.0 * 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[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 83.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.2e+121)
   (/ (- b) a)
   (if (<= b 5.5e+31)
     (/ (- (sqrt (fma (* -4.0 c) a (* b b))) b) (* 2.0 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.2e+121) {
		tmp = -b / a;
	} else if (b <= 5.5e+31) {
		tmp = (sqrt(fma((-4.0 * c), a, (b * b))) - b) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.2e+121)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 5.5e+31)
		tmp = Float64(Float64(sqrt(fma(Float64(-4.0 * c), a, Float64(b * b))) - b) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.2e+121], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 5.5e+31], N[(N[(N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.20000000000000001e121

   1. Initial program 67.6%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(b\right)}}{a} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}} \]

      4. lower-neg.f64 96.7

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

   5. Applied rewrites 96.7%

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

   if -2.20000000000000001e121 < b < 5.50000000000000002e31

   1. Initial program 72.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-neg.f64 N/A

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

      4. unsub-neg N/A

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

      5. lower--.f64 72.7

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

      6. lift--.f64 N/A

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

      7. sub-neg N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. distribute-lft-neg-in N/A

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

      13. *-commutative N/A

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

      14. associate-*r* N/A

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

      15. lower-fma.f64 N/A

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

      16. lower-*.f64 N/A

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

      17. metadata-eval 72.7

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

   4. Applied rewrites 72.7%

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

   if 5.50000000000000002e31 < b

   1. Initial program 10.4%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(c\right)}}{b} \]

      4. lower-neg.f64 90.0

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

   5. Applied rewrites 90.0%

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

Alternative 2: 83.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{+75}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 5.5 \cdot 10^{+31}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -8e+75)
   (/ (- b) a)
   (if (<= b 5.5e+31)
     (* (/ 0.5 a) (- (sqrt (fma (* -4.0 c) a (* b b))) b))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -8e+75) {
		tmp = -b / a;
	} else if (b <= 5.5e+31) {
		tmp = (0.5 / a) * (sqrt(fma((-4.0 * c), a, (b * b))) - b);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -8e+75)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 5.5e+31)
		tmp = Float64(Float64(0.5 / a) * Float64(sqrt(fma(Float64(-4.0 * c), a, Float64(b * b))) - b));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -8e+75], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 5.5e+31], N[(N[(0.5 / a), $MachinePrecision] * N[(N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -7.99999999999999941e75

   1. Initial program 72.1%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(b\right)}}{a} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}} \]

      4. lower-neg.f64 97.2

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

   5. Applied rewrites 97.2%

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

   if -7.99999999999999941e75 < b < 5.50000000000000002e31

   1. Initial program 70.7%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 70.6

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 70.6

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

   4. Applied rewrites 70.6%

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

   if 5.50000000000000002e31 < b

   1. Initial program 10.4%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(c\right)}}{b} \]

      4. lower-neg.f64 90.0

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

   5. Applied rewrites 90.0%

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

Alternative 3: 78.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.1e-36)
   (/ (- b) a)
   (if (<= b 1.65e+27)
     (/ (- (sqrt (* (* c a) -4.0)) b) (* 2.0 a))
     (/ (* (fma c (/ a (* b b)) 1.0) c) (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.1e-36) {
		tmp = -b / a;
	} else if (b <= 1.65e+27) {
		tmp = (sqrt(((c * a) * -4.0)) - b) / (2.0 * a);
	} else {
		tmp = (fma(c, (a / (b * b)), 1.0) * c) / -b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.1e-36)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 1.65e+27)
		tmp = Float64(Float64(sqrt(Float64(Float64(c * a) * -4.0)) - b) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(fma(c, Float64(a / Float64(b * b)), 1.0) * c) / Float64(-b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.1e-36], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 1.65e+27], N[(N[(N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(c * N[(a / N[(b * b), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * c), $MachinePrecision] / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.09999999999999991e-36

   1. Initial program 74.9%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(b\right)}}{a} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}} \]

      4. lower-neg.f64 89.0

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

   5. Applied rewrites 89.0%

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

   if -2.09999999999999991e-36 < b < 1.6499999999999999e27

   1. Initial program 68.3%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-neg.f64 N/A

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

      4. unsub-neg N/A

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

      5. lower--.f64 68.3

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

      6. lift--.f64 N/A

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

      7. sub-neg N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. distribute-lft-neg-in N/A

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

      13. *-commutative N/A

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

      14. associate-*r* N/A

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

      15. lower-fma.f64 N/A

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

      16. lower-*.f64 N/A

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

      17. metadata-eval 68.3

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

   4. Applied rewrites 68.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 66.3

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

   7. Applied rewrites 66.3%

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

   if 1.6499999999999999e27 < b

   1. Initial program 12.6%

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

   3. Taylor expanded in a around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

         \[\leadsto \color{blue}{-1 \cdot \frac{c}{b} - \frac{a \cdot {c}^{2}}{{b}^{3}}} \]

      3. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{-1 \cdot c}{b}} - \frac{a \cdot {c}^{2}}{{b}^{3}} \]

      4. unpow3 N/A

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

      5. unpow2 N/A

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

      6. associate-/r* N/A

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

      7. div-sub N/A

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

      8. unsub-neg N/A

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

      9. mul-1-neg N/A

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

      10. distribute-lft-out N/A

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

      11. associate-/l* N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 N/A

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

      14. lower-/.f64 N/A

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

   5. Applied rewrites 83.0%

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

   6. Taylor expanded in a around 0

      \[\leadsto -\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b} \]
   7. Step-by-step derivation

   8. Applied rewrites 88.6%

      \[\leadsto -\frac{\mathsf{fma}\left(\frac{a}{b}, \frac{c}{b}, 1\right) \cdot c}{b} \]
   9. Step-by-step derivation

   10. Applied rewrites 88.6%

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

4. Final simplification 79.9%

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

Alternative 4: 78.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.1e-36)
   (/ (- b) a)
   (if (<= b 1.65e+27)
     (/ (- (sqrt (* (* c a) -4.0)) b) (* 2.0 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.1e-36) {
		tmp = -b / a;
	} else if (b <= 1.65e+27) {
		tmp = (sqrt(((c * a) * -4.0)) - b) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(a, b, c):
	tmp = 0
	if b <= -2.1e-36:
		tmp = -b / a
	elif b <= 1.65e+27:
		tmp = (math.sqrt(((c * a) * -4.0)) - b) / (2.0 * a)
	else:
		tmp = -c / b
	return tmp

Julia

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.1e-36], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 1.65e+27], N[(N[(N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.09999999999999991e-36

   1. Initial program 74.9%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(b\right)}}{a} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}} \]

      4. lower-neg.f64 89.0

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

   5. Applied rewrites 89.0%

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

   if -2.09999999999999991e-36 < b < 1.6499999999999999e27

   1. Initial program 68.3%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-neg.f64 N/A

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

      4. unsub-neg N/A

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

      5. lower--.f64 68.3

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

      6. lift--.f64 N/A

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

      7. sub-neg N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. distribute-lft-neg-in N/A

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

      13. *-commutative N/A

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

      14. associate-*r* N/A

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

      15. lower-fma.f64 N/A

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

      16. lower-*.f64 N/A

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

      17. metadata-eval 68.3

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

   4. Applied rewrites 68.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 66.3

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

   7. Applied rewrites 66.3%

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

   if 1.6499999999999999e27 < b

   1. Initial program 12.6%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(c\right)}}{b} \]

      4. lower-neg.f64 88.5

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

   5. Applied rewrites 88.5%

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

4. Final simplification 79.9%

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

Alternative 5: 68.3% accurate, 1.6× speedup

Math

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

C

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

Python

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

Julia

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

Wolfram

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

   1. Initial program 76.9%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-in N/A

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

      3. distribute-neg-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. mul-1-neg N/A

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

      7. distribute-lft-neg-out N/A

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

      8. remove-double-neg N/A

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

      9. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{c}{{b}^{2}}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right)} \]

      10. unpow2 N/A

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

      11. associate-/r* N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{c}{b}}{b}}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right) \]

      12. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{c}{b}}{b}}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right) \]

      13. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\frac{c}{b}}}{b}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right) \]

      14. distribute-frac-neg N/A

          \[\leadsto \mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}}\right) \]

      15. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}}\right) \]

      16. lower-neg.f64 62.8

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

   5. Applied rewrites 62.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \frac{-b}{a}\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 62.9%

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

   if -4.999999999999985e-310 < b

   1. Initial program 34.2%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(c\right)}}{b} \]

      4. lower-neg.f64 58.7

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

   5. Applied rewrites 58.7%

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

Alternative 6: 68.2% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

   1. Initial program 76.9%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(b\right)}}{a} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}} \]

      4. lower-neg.f64 62.9

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

   5. Applied rewrites 62.9%

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

   if -4.999999999999985e-310 < b

   1. Initial program 34.2%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(c\right)}}{b} \]

      4. lower-neg.f64 58.7

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

   5. Applied rewrites 58.7%

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

Alternative 7: 42.6% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.08e67

   1. Initial program 68.3%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(b\right)}}{a} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}} \]

      4. lower-neg.f64 40.8

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

   5. Applied rewrites 40.8%

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

   if 1.08e67 < b

   1. Initial program 9.9%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-in N/A

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

      3. distribute-neg-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. mul-1-neg N/A

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

      7. distribute-lft-neg-out N/A

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

      8. remove-double-neg N/A

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

      9. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{c}{{b}^{2}}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right)} \]

      10. unpow2 N/A

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

      11. associate-/r* N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{c}{b}}{b}}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right) \]

      12. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{c}{b}}{b}}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right) \]

      13. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\frac{c}{b}}}{b}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right) \]

      14. distribute-frac-neg N/A

          \[\leadsto \mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}}\right) \]

      15. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}}\right) \]

      16. lower-neg.f64 2.7

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

   5. Applied rewrites 2.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \frac{-b}{a}\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 2.7%

      \[\leadsto \mathsf{fma}\left(\frac{c}{b \cdot b}, b, \frac{-b}{a}\right) \]
   8. Step-by-step derivation

   9. Applied rewrites 2.2%

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

   10. Taylor expanded in a around inf

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

   12. Applied rewrites 30.4%

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

Alternative 8: 11.1% accurate, 4.2× 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 55.0%

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

3. Taylor expanded in b around -inf

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

   1. mul-1-neg N/A

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

   2. distribute-rgt-in N/A

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

   3. distribute-neg-in N/A

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

   4. associate-*l/ N/A

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

   5. *-lft-identity N/A

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

   6. mul-1-neg N/A

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

   7. distribute-lft-neg-out N/A

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

   8. remove-double-neg N/A

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

   9. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{c}{{b}^{2}}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right)} \]

   10. unpow2 N/A

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

   11. associate-/r* N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{c}{b}}{b}}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right) \]

   12. lower-/.f64 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{\frac{c}{b}}{b}}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right) \]

   13. lower-/.f64 N/A

       \[\leadsto \mathsf{fma}\left(\frac{\color{blue}{\frac{c}{b}}}{b}, b, \mathsf{neg}\left(\frac{b}{a}\right)\right) \]

   14. distribute-frac-neg N/A

       \[\leadsto \mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}}\right) \]

   15. lower-/.f64 N/A

       \[\leadsto \mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \color{blue}{\frac{\mathsf{neg}\left(b\right)}{a}}\right) \]

   16. lower-neg.f64 31.8

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

5. Applied rewrites 31.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\frac{c}{b}}{b}, b, \frac{-b}{a}\right)} \]
6. Step-by-step derivation

7. Applied rewrites 31.7%

   \[\leadsto \mathsf{fma}\left(\frac{c}{b \cdot b}, b, \frac{-b}{a}\right) \]
8. Step-by-step derivation

9. Applied rewrites 2.0%

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

10. Taylor expanded in a around inf

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

12. Applied rewrites 9.1%

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

Reproduce

herbie shell --seed 2024288 
(FPCore (a b c)
  :name "Quadratic roots, full range"
  :precision binary64
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))