Quadratic roots, full range

Percentage Accurate: 52.5% → 85.8%

Time: 8.4s

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.5% 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: 85.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.2e+152)
   (/ (- b) a)
   (if (<= b 5.5e-53)
     (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a))
     (/ (- c) b))))

C

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

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.2e+152:
		tmp = -b / a
	elif b <= 5.5e-53:
		tmp = (-b + math.sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.2e+152)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 5.5e-53)
		tmp = Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))) / 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.2e+152)
		tmp = -b / a;
	elseif (b <= 5.5e-53)
		tmp = (-b + sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.2e+152], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 5.5e-53], 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], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.2e152

   1. Initial program 42.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 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 100.0

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

   5. Applied rewrites 100.0%

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

   if -1.2e152 < b < 5.50000000000000023e-53

   1. Initial program 73.9%

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

   if 5.50000000000000023e-53 < b

   1. Initial program 15.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 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.5

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

   5. Applied rewrites 90.5%

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

Alternative 2: 85.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -9.5 \cdot 10^{+138}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 5.5 \cdot 10^{-53}:\\ \;\;\;\;\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 -9.5e+138)
   (/ (- b) a)
   (if (<= b 5.5e-53)
     (* (/ 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 <= -9.5e+138) {
		tmp = -b / a;
	} else if (b <= 5.5e-53) {
		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 <= -9.5e+138)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 5.5e-53)
		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, -9.5e+138], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 5.5e-53], 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 < -9.49999999999999998e138

   1. Initial program 47.8%

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

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

   5. Applied rewrites 100.0%

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

   if -9.49999999999999998e138 < b < 5.50000000000000023e-53

   1. Initial program 73.2%

      \[\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 73.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 73.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 73.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 5.50000000000000023e-53 < b

   1. Initial program 15.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 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.5

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

   5. Applied rewrites 90.5%

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

Alternative 3: 80.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.1 \cdot 10^{-39}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 5.5 \cdot 10^{-53}:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot c\right) \cdot a} - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.1e-39)
   (/ (- b) a)
   (if (<= b 5.5e-53)
     (/ (- (sqrt (* (* -4.0 c) a)) b) (* 2.0 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.1e-39) {
		tmp = -b / a;
	} else if (b <= 5.5e-53) {
		tmp = (sqrt(((-4.0 * c) * a)) - 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.1d-39)) then
        tmp = -b / a
    else if (b <= 5.5d-53) then
        tmp = (sqrt((((-4.0d0) * c) * a)) - 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.1e-39) {
		tmp = -b / a;
	} else if (b <= 5.5e-53) {
		tmp = (Math.sqrt(((-4.0 * c) * a)) - b) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.1e-39:
		tmp = -b / a
	elif b <= 5.5e-53:
		tmp = (math.sqrt(((-4.0 * c) * a)) - b) / (2.0 * a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.1e-39)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 5.5e-53)
		tmp = Float64(Float64(sqrt(Float64(Float64(-4.0 * c) * a)) - 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.1e-39)
		tmp = -b / a;
	elseif (b <= 5.5e-53)
		tmp = (sqrt(((-4.0 * c) * a)) - b) / (2.0 * a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.1e-39], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 5.5e-53], N[(N[(N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a), $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.1e-39

   1. Initial program 62.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 \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 82.2

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

   5. Applied rewrites 82.2%

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

   if -1.1e-39 < b < 5.50000000000000023e-53

   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 a 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 67.4

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

   5. Applied rewrites 67.4%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lift-/.f64 67.3

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

          \[\leadsto \frac{\frac{1}{2}}{a} \cdot \left(\sqrt{-4 \cdot \left(c \cdot a\right)} + \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{-4 \cdot \left(c \cdot a\right)} - b\right)} \]

      13. lower--.f64 67.3

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

   7. Applied rewrites 67.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. metadata-eval N/A

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

      5. associate-/r* N/A

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

      6. lift-*.f64 N/A

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

      7. div-inv N/A

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

      8. lower-/.f64 67.4

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

   9. Applied rewrites 67.4%

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

   if 5.50000000000000023e-53 < b

   1. Initial program 15.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 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.5

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

   5. Applied rewrites 90.5%

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

Alternative 4: 80.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.1 \cdot 10^{-39}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 5.5 \cdot 10^{-53}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{\left(c \cdot a\right) \cdot -4} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.1e-39)
   (/ (- b) a)
   (if (<= b 5.5e-53)
     (* (/ 0.5 a) (- (sqrt (* (* c a) -4.0)) b))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.1e-39) {
		tmp = -b / a;
	} else if (b <= 5.5e-53) {
		tmp = (0.5 / a) * (sqrt(((c * a) * -4.0)) - b);
	} 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.1d-39)) then
        tmp = -b / a
    else if (b <= 5.5d-53) then
        tmp = (0.5d0 / a) * (sqrt(((c * a) * (-4.0d0))) - b)
    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.1e-39) {
		tmp = -b / a;
	} else if (b <= 5.5e-53) {
		tmp = (0.5 / a) * (Math.sqrt(((c * a) * -4.0)) - b);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.1e-39:
		tmp = -b / a
	elif b <= 5.5e-53:
		tmp = (0.5 / a) * (math.sqrt(((c * a) * -4.0)) - b)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.1e-39)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 5.5e-53)
		tmp = Float64(Float64(0.5 / a) * Float64(sqrt(Float64(Float64(c * a) * -4.0)) - b));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.1e-39)
		tmp = -b / a;
	elseif (b <= 5.5e-53)
		tmp = (0.5 / a) * (sqrt(((c * a) * -4.0)) - b);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.1e-39], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 5.5e-53], N[(N[(0.5 / a), $MachinePrecision] * N[(N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.1e-39

   1. Initial program 62.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 \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 82.2

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

   5. Applied rewrites 82.2%

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

   if -1.1e-39 < b < 5.50000000000000023e-53

   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 a 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 67.4

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

   5. Applied rewrites 67.4%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lift-/.f64 67.3

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

          \[\leadsto \frac{\frac{1}{2}}{a} \cdot \left(\sqrt{-4 \cdot \left(c \cdot a\right)} + \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{-4 \cdot \left(c \cdot a\right)} - b\right)} \]

      13. lower--.f64 67.3

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

   7. Applied rewrites 67.3%

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

   if 5.50000000000000023e-53 < b

   1. Initial program 15.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 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.5

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

   5. Applied rewrites 90.5%

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

Alternative 5: 67.3% accurate, 1.6× speedup

Math

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

C

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

Python

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

Julia

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

Wolfram

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

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

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

   5. Applied rewrites 2.0%

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

   6. 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)} \]
   7. Step-by-step derivation

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. unsub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 51.3

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

   8. Applied rewrites 51.3%

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

   9. Taylor expanded in a around inf

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

   11. Applied rewrites 55.4%

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

   if -1.999999999999994e-310 < b

   1. Initial program 30.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 70.4

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

   5. Applied rewrites 70.4%

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

Alternative 6: 67.1% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.1e-303) (/ (- b) a) (/ (- c) b)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.1e-303

   1. Initial program 68.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 \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 54.8

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

   5. Applied rewrites 54.8%

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

   if 2.1e-303 < b

   1. Initial program 30.8%

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

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

   5. Applied rewrites 70.9%

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

Alternative 7: 42.9% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 0.095000000000000001

   1. Initial program 67.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 \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 39.1

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

   5. Applied rewrites 39.1%

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

   if 0.095000000000000001 < b

   1. Initial program 12.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 94.8

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

   5. Applied rewrites 94.8%

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

   6. 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)} \]
   7. Step-by-step derivation

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. unsub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 2.3

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

   8. Applied rewrites 2.3%

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

   9. Taylor expanded in a around inf

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

   11. Applied rewrites 22.9%

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

Alternative 8: 10.9% 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 48.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 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 39.4

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

5. Applied rewrites 39.4%

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

6. 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)} \]
7. Step-by-step derivation

   1. associate-*r* N/A

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

   2. mul-1-neg N/A

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

   3. lower-*.f64 N/A

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

   4. lower-neg.f64 N/A

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

   5. +-commutative N/A

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

   6. mul-1-neg N/A

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

   7. unsub-neg N/A

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

   8. lower--.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. lower-/.f64 N/A

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

   11. unpow2 N/A

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

   12. lower-*.f64 24.3

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

8. Applied rewrites 24.3%

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

9. Taylor expanded in a around inf

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

11. Applied rewrites 10.0%

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

Reproduce

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