Quadratic roots, full range

Percentage Accurate: 51.4% → 84.8%

Time: 7.7s

Alternatives: 9

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: 51.4% 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: 84.8% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.25e+63)
   (- (/ c b) (/ b a))
   (if (<= b 2.6e-114)
     (- (/ (sqrt (fma (* -4.0 c) a (* b b))) (* 2.0 a)) (/ b (* 2.0 a)))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e+63) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.6e-114) {
		tmp = (sqrt(fma((-4.0 * c), a, (b * b))) / (2.0 * a)) - (b / (2.0 * a));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.25e+63)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 2.6e-114)
		tmp = Float64(Float64(sqrt(fma(Float64(-4.0 * c), a, Float64(b * b))) / Float64(2.0 * a)) - Float64(b / Float64(2.0 * a)));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.25e+63], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.6e-114], N[(N[(N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision] - N[(b / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.25000000000000003e63

   1. Initial program 65.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. 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{1}{a} \cdot b\right)\right) \]

      5. 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{1}{a} \cdot b\right)\right) \]

      6. remove-double-neg N/A

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

      7. associate-*l/ N/A

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

      8. *-lft-identity N/A

         \[\leadsto \frac{c}{{b}^{2}} \cdot b + \left(\mathsf{neg}\left(\frac{\color{blue}{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 95.7

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

   5. Applied rewrites 95.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 95.7%

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

   if -1.25000000000000003e63 < b < 2.60000000000000013e-114

   1. Initial program 80.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 \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}} \]

      2. 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} \]

      3. +-commutative N/A

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

      4. 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} \]

      5. unsub-neg N/A

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

      6. div-sub N/A

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

      7. lower--.f64 N/A

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

   4. Applied rewrites 80.3%

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

   if 2.60000000000000013e-114 < b

   1. Initial program 13.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 c 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 86.2

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

   5. Applied rewrites 86.2%

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

Alternative 2: 84.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.25e+63)
   (- (/ c b) (/ b a))
   (if (<= b 2.6e-114)
     (/ (- (sqrt (- (* b b) (* (* a 4.0) c))) b) (* 2.0 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e+63) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.6e-114) {
		tmp = (sqrt(((b * b) - ((a * 4.0) * c))) - 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 <= (-1.25d+63)) then
        tmp = (c / b) - (b / a)
    else if (b <= 2.6d-114) then
        tmp = (sqrt(((b * b) - ((a * 4.0d0) * c))) - 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 <= -1.25e+63) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.6e-114) {
		tmp = (Math.sqrt(((b * b) - ((a * 4.0) * c))) - b) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.25e+63:
		tmp = (c / b) - (b / a)
	elif b <= 2.6e-114:
		tmp = (math.sqrt(((b * b) - ((a * 4.0) * c))) - b) / (2.0 * a)
	else:
		tmp = -c / b
	return tmp

Julia

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.25e+63], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.6e-114], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(a * 4.0), $MachinePrecision] * c), $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 < -1.25000000000000003e63

   1. Initial program 65.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. 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{1}{a} \cdot b\right)\right) \]

      5. 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{1}{a} \cdot b\right)\right) \]

      6. remove-double-neg N/A

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

      7. associate-*l/ N/A

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

      8. *-lft-identity N/A

         \[\leadsto \frac{c}{{b}^{2}} \cdot b + \left(\mathsf{neg}\left(\frac{\color{blue}{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 95.7

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

   5. Applied rewrites 95.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 95.7%

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

   if -1.25000000000000003e63 < b < 2.60000000000000013e-114

   1. Initial program 80.3%

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

   if 2.60000000000000013e-114 < b

   1. Initial program 13.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 c 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 86.2

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

   5. Applied rewrites 86.2%

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

4. Final simplification 86.5%

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

Alternative 3: 84.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.25e+63)
   (- (/ c b) (/ b a))
   (if (<= b 2.6e-114)
     (* (- (sqrt (fma (* -4.0 c) a (* b b))) b) (/ 0.5 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e+63) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.6e-114) {
		tmp = (sqrt(fma((-4.0 * c), a, (b * b))) - b) * (0.5 / a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.25e+63)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 2.6e-114)
		tmp = Float64(Float64(sqrt(fma(Float64(-4.0 * c), a, Float64(b * b))) - b) * Float64(0.5 / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.25e+63], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.6e-114], N[(N[(N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.25000000000000003e63

   1. Initial program 65.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. 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{1}{a} \cdot b\right)\right) \]

      5. 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{1}{a} \cdot b\right)\right) \]

      6. remove-double-neg N/A

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

      7. associate-*l/ N/A

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

      8. *-lft-identity N/A

         \[\leadsto \frac{c}{{b}^{2}} \cdot b + \left(\mathsf{neg}\left(\frac{\color{blue}{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 95.7

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

   5. Applied rewrites 95.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 95.7%

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

   if -1.25000000000000003e63 < b < 2.60000000000000013e-114

   1. Initial program 80.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 \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 80.2

         \[\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 80.2

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

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

   if 2.60000000000000013e-114 < b

   1. Initial program 13.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 c 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 86.2

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

   5. Applied rewrites 86.2%

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

4. Final simplification 86.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.25 \cdot 10^{+63}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-114}:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 80.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5.4 \cdot 10^{-32}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-114}:\\ \;\;\;\;\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 -5.4e-32)
   (- (/ c b) (/ b a))
   (if (<= b 2.6e-114)
     (/ (- (sqrt (* (* c a) -4.0)) b) (* 2.0 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.4e-32) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.6e-114) {
		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 <= (-5.4d-32)) then
        tmp = (c / b) - (b / a)
    else if (b <= 2.6d-114) 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 <= -5.4e-32) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.6e-114) {
		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 <= -5.4e-32:
		tmp = (c / b) - (b / a)
	elif b <= 2.6e-114:
		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 <= -5.4e-32)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 2.6e-114)
		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 <= -5.4e-32)
		tmp = (c / b) - (b / a);
	elseif (b <= 2.6e-114)
		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, -5.4e-32], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.6e-114], 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 < -5.39999999999999962e-32

   1. Initial program 70.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. 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{1}{a} \cdot b\right)\right) \]

      5. 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{1}{a} \cdot b\right)\right) \]

      6. remove-double-neg N/A

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

      7. associate-*l/ N/A

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

      8. *-lft-identity N/A

         \[\leadsto \frac{c}{{b}^{2}} \cdot b + \left(\mathsf{neg}\left(\frac{\color{blue}{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 92.3

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

   5. Applied rewrites 92.3%

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

   7. Applied rewrites 92.3%

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

   if -5.39999999999999962e-32 < b < 2.60000000000000013e-114

   1. Initial program 77.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 c around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 70.1

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

   5. Applied rewrites 70.1%

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

   if 2.60000000000000013e-114 < b

   1. Initial program 13.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 c 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 86.2

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

   5. Applied rewrites 86.2%

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

4. Final simplification 83.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5.4 \cdot 10^{-32}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-114}:\\ \;\;\;\;\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: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5.4 \cdot 10^{-32}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-114}:\\ \;\;\;\;\left(\sqrt{\left(c \cdot a\right) \cdot -4} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5.4e-32)
   (- (/ c b) (/ b a))
   (if (<= b 2.6e-114)
     (* (- (sqrt (* (* c a) -4.0)) b) (/ 0.5 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.4e-32) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.6e-114) {
		tmp = (sqrt(((c * a) * -4.0)) - b) * (0.5 / 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 <= (-5.4d-32)) then
        tmp = (c / b) - (b / a)
    else if (b <= 2.6d-114) then
        tmp = (sqrt(((c * a) * (-4.0d0))) - b) * (0.5d0 / 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 <= -5.4e-32) {
		tmp = (c / b) - (b / a);
	} else if (b <= 2.6e-114) {
		tmp = (Math.sqrt(((c * a) * -4.0)) - b) * (0.5 / a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5.4e-32:
		tmp = (c / b) - (b / a)
	elif b <= 2.6e-114:
		tmp = (math.sqrt(((c * a) * -4.0)) - b) * (0.5 / a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5.4e-32)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 2.6e-114)
		tmp = Float64(Float64(sqrt(Float64(Float64(c * a) * -4.0)) - b) * Float64(0.5 / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5.4e-32)
		tmp = (c / b) - (b / a);
	elseif (b <= 2.6e-114)
		tmp = (sqrt(((c * a) * -4.0)) - b) * (0.5 / a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5.4e-32], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.6e-114], N[(N[(N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.39999999999999962e-32

   1. Initial program 70.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. 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{1}{a} \cdot b\right)\right) \]

      5. 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{1}{a} \cdot b\right)\right) \]

      6. remove-double-neg N/A

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

      7. associate-*l/ N/A

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

      8. *-lft-identity N/A

         \[\leadsto \frac{c}{{b}^{2}} \cdot b + \left(\mathsf{neg}\left(\frac{\color{blue}{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 92.3

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

   5. Applied rewrites 92.3%

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

   7. Applied rewrites 92.3%

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

   if -5.39999999999999962e-32 < b < 2.60000000000000013e-114

   1. Initial program 77.6%

      \[\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 77.5

         \[\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 77.5

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

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

   5. Taylor expanded in c around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 70.1

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

   7. Applied rewrites 70.1%

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

   if 2.60000000000000013e-114 < b

   1. Initial program 13.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 c 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 86.2

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

   5. Applied rewrites 86.2%

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

4. Final simplification 83.6%

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

Alternative 6: 68.4% accurate, 1.6× 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 75.5%

      \[\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. 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{1}{a} \cdot b\right)\right) \]

      5. 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{1}{a} \cdot b\right)\right) \]

      6. remove-double-neg N/A

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

      7. associate-*l/ N/A

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

      8. *-lft-identity N/A

         \[\leadsto \frac{c}{{b}^{2}} \cdot b + \left(\mathsf{neg}\left(\frac{\color{blue}{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 66.2

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

   5. Applied rewrites 66.2%

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

   7. Applied rewrites 66.3%

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

   if -3.999999999999988e-310 < b

   1. Initial program 24.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 c 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 71.4

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

   5. Applied rewrites 71.4%

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

Alternative 7: 68.2% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 1.45e-256) (/ (- b) a) (/ (- c) b)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.44999999999999986e-256

   1. Initial program 75.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 63.5

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

   5. Applied rewrites 63.5%

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

   if 1.44999999999999986e-256 < b

   1. Initial program 21.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 c 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 74.9

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

   5. Applied rewrites 74.9%

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

Alternative 8: 43.1% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.02000000000000003e36

   1. Initial program 67.7%

      \[\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 48.4

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

   5. Applied rewrites 48.4%

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

   if 1.02000000000000003e36 < b

   1. Initial program 7.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 \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. 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{1}{a} \cdot b\right)\right) \]

      5. 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{1}{a} \cdot b\right)\right) \]

      6. remove-double-neg N/A

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

      7. associate-*l/ N/A

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

      8. *-lft-identity N/A

         \[\leadsto \frac{c}{{b}^{2}} \cdot b + \left(\mathsf{neg}\left(\frac{\color{blue}{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 3.0

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

   5. Applied rewrites 3.0%

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

   6. Taylor expanded in c around inf

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

   8. Applied rewrites 19.7%

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

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

   \[\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. 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{1}{a} \cdot b\right)\right) \]

   5. 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{1}{a} \cdot b\right)\right) \]

   6. remove-double-neg N/A

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

   7. associate-*l/ N/A

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

   8. *-lft-identity N/A

      \[\leadsto \frac{c}{{b}^{2}} \cdot b + \left(\mathsf{neg}\left(\frac{\color{blue}{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 35.4

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

5. Applied rewrites 35.4%

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

6. Taylor expanded in c around inf

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

8. Applied rewrites 7.6%

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

Reproduce

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