The quadratic formula (r2)

Percentage Accurate: 51.3% → 85.3%

Time: 5.5s

Alternatives: 10

Speedup: 2.5×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 51.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.2 \cdot 10^{-96}:\\ \;\;\;\;\frac{c \cdot \mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right)}{-b}\\ \mathbf{elif}\;b \leq 3.1 \cdot 10^{+88}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(c \cdot a, -4, b \cdot b\right)}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.2e-96)
   (/ (* c (fma a (/ c (* b b)) 1.0)) (- b))
   (if (<= b 3.1e+88)
     (/ (- (- b) (sqrt (fma (* c a) -4.0 (* b b)))) (+ a a))
     (fma (/ b a) -1.0 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.2e-96) {
		tmp = (c * fma(a, (c / (b * b)), 1.0)) / -b;
	} else if (b <= 3.1e+88) {
		tmp = (-b - sqrt(fma((c * a), -4.0, (b * b)))) / (a + a);
	} else {
		tmp = fma((b / a), -1.0, (c / b));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.2e-96)
		tmp = Float64(Float64(c * fma(a, Float64(c / Float64(b * b)), 1.0)) / Float64(-b));
	elseif (b <= 3.1e+88)
		tmp = Float64(Float64(Float64(-b) - sqrt(fma(Float64(c * a), -4.0, Float64(b * b)))) / Float64(a + a));
	else
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.2e-96], N[(N[(c * N[(a * N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] / (-b)), $MachinePrecision], If[LessEqual[b, 3.1e+88], N[(N[((-b) - N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0 + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.20000000000000012e-96

   1. Initial program 12.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 72.3

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

   5. Applied rewrites 72.3%

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

   6. Taylor expanded in c around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 91.5

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

   8. Applied rewrites 91.5%

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

   if -3.20000000000000012e-96 < b < 3.1000000000000001e88

   1. Initial program 77.1%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. pow2 N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. metadata-eval N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 77.1

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

   4. Applied rewrites 77.1%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 77.1

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

   6. Applied rewrites 77.1%

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

   if 3.1000000000000001e88 < b

   1. Initial program 62.6%

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

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 92.1

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

   5. Applied rewrites 92.1%

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

4. Final simplification 86.1%

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

Alternative 2: 80.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.2e-96)
   (/ (* c (fma a (/ c (* b b)) 1.0)) (- b))
   (if (<= b 2.2e-100)
     (/ (+ b (sqrt (* -4.0 (* c a)))) (- (- a) a))
     (fma (/ b a) -1.0 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.2e-96) {
		tmp = (c * fma(a, (c / (b * b)), 1.0)) / -b;
	} else if (b <= 2.2e-100) {
		tmp = (b + sqrt((-4.0 * (c * a)))) / (-a - a);
	} else {
		tmp = fma((b / a), -1.0, (c / b));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.2e-96)
		tmp = Float64(Float64(c * fma(a, Float64(c / Float64(b * b)), 1.0)) / Float64(-b));
	elseif (b <= 2.2e-100)
		tmp = Float64(Float64(b + sqrt(Float64(-4.0 * Float64(c * a)))) / Float64(Float64(-a) - a));
	else
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.2e-96], N[(N[(c * N[(a * N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] / (-b)), $MachinePrecision], If[LessEqual[b, 2.2e-100], N[(N[(b + N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[((-a) - a), $MachinePrecision]), $MachinePrecision], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.20000000000000012e-96

   1. Initial program 12.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 72.3

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

   5. Applied rewrites 72.3%

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

   6. Taylor expanded in c around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 91.5

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

   8. Applied rewrites 91.5%

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

   if -3.20000000000000012e-96 < b < 2.19999999999999989e-100

   1. Initial program 74.9%

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

      2. *-commutative N/A

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

      3. lower-*.f64 71.1

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

   5. Applied rewrites 71.1%

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

      2. count-2-rev N/A

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

      3. lower-+.f64 71.1

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

   7. Applied rewrites 71.1%

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

   if 2.19999999999999989e-100 < b

   1. Initial program 69.8%

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

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 77.2

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

   5. Applied rewrites 77.2%

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

4. Final simplification 81.3%

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

Alternative 3: 81.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.2e-96)
   (/ c (- b))
   (if (<= b 2.2e-100)
     (/ (+ b (sqrt (* -4.0 (* c a)))) (- (- a) a))
     (fma (/ b a) -1.0 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.2e-96) {
		tmp = c / -b;
	} else if (b <= 2.2e-100) {
		tmp = (b + sqrt((-4.0 * (c * a)))) / (-a - a);
	} else {
		tmp = fma((b / a), -1.0, (c / b));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.2e-96)
		tmp = Float64(c / Float64(-b));
	elseif (b <= 2.2e-100)
		tmp = Float64(Float64(b + sqrt(Float64(-4.0 * Float64(c * a)))) / Float64(Float64(-a) - a));
	else
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.2e-96], N[(c / (-b)), $MachinePrecision], If[LessEqual[b, 2.2e-100], N[(N[(b + N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[((-a) - a), $MachinePrecision]), $MachinePrecision], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.20000000000000012e-96

   1. Initial program 12.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 91.5

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

   5. Applied rewrites 91.5%

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

   if -3.20000000000000012e-96 < b < 2.19999999999999989e-100

   1. Initial program 74.9%

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

      2. *-commutative N/A

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

      3. lower-*.f64 71.1

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

   5. Applied rewrites 71.1%

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

      2. count-2-rev N/A

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

      3. lower-+.f64 71.1

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

   7. Applied rewrites 71.1%

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

   if 2.19999999999999989e-100 < b

   1. Initial program 69.8%

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

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 77.2

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

   5. Applied rewrites 77.2%

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

4. Final simplification 81.3%

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

Alternative 4: 79.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.2 \cdot 10^{-96}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 1.6 \cdot 10^{-140}:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot c\right) \cdot -4}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.2e-96)
   (/ c (- b))
   (if (<= b 1.6e-140)
     (/ (- (sqrt (* (* a c) -4.0))) (+ a a))
     (fma (/ b a) -1.0 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.2e-96) {
		tmp = c / -b;
	} else if (b <= 1.6e-140) {
		tmp = -sqrt(((a * c) * -4.0)) / (a + a);
	} else {
		tmp = fma((b / a), -1.0, (c / b));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.2e-96)
		tmp = Float64(c / Float64(-b));
	elseif (b <= 1.6e-140)
		tmp = Float64(Float64(-sqrt(Float64(Float64(a * c) * -4.0))) / Float64(a + a));
	else
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.2e-96], N[(c / (-b)), $MachinePrecision], If[LessEqual[b, 1.6e-140], N[((-N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]) / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.20000000000000012e-96

   1. Initial program 12.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 91.5

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

   5. Applied rewrites 91.5%

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

   if -3.20000000000000012e-96 < b < 1.6000000000000001e-140

   1. Initial program 75.7%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. pow2 N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. metadata-eval N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 75.7

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

   4. Applied rewrites 75.7%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 75.7

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

   6. Applied rewrites 75.7%

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

   7. Taylor expanded in a around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

         \[\leadsto \frac{-\sqrt{a \cdot c} \cdot \sqrt{-4}}{a + a} \]

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lift-*.f64 74.0

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

   9. Applied rewrites 74.0%

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

   if 1.6000000000000001e-140 < b

   1. Initial program 69.7%

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

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 74.9

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

   5. Applied rewrites 74.9%

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

4. Final simplification 81.0%

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

Alternative 5: 71.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.26 \cdot 10^{-180}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 5.8 \cdot 10^{-119}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.26e-180)
   (/ c (- b))
   (if (<= b 5.8e-119)
     (- (sqrt (* (/ c a) -1.0)))
     (fma (/ b a) -1.0 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.26e-180) {
		tmp = c / -b;
	} else if (b <= 5.8e-119) {
		tmp = -sqrt(((c / a) * -1.0));
	} else {
		tmp = fma((b / a), -1.0, (c / b));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.26e-180)
		tmp = Float64(c / Float64(-b));
	elseif (b <= 5.8e-119)
		tmp = Float64(-sqrt(Float64(Float64(c / a) * -1.0)));
	else
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.26e-180], N[(c / (-b)), $MachinePrecision], If[LessEqual[b, 5.8e-119], (-N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]), N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.25999999999999997e-180

   1. Initial program 18.1%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 83.9

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

   5. Applied rewrites 83.9%

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

   if -1.25999999999999997e-180 < b < 5.8e-119

   1. Initial program 77.0%

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

      1. lift-neg.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. flip-- N/A

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

      9. lower-/.f64 N/A

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in a around -inf

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

   7. Applied rewrites 47.8%

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

   if 5.8e-119 < b

   1. Initial program 70.7%

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

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 76.0

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

   5. Applied rewrites 76.0%

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

4. Final simplification 74.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.26 \cdot 10^{-180}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 5.8 \cdot 10^{-119}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 71.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.26 \cdot 10^{-180}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 5.8 \cdot 10^{-119}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.26e-180)
   (/ c (- b))
   (if (<= b 5.8e-119) (- (sqrt (* (/ c a) -1.0))) (/ (- b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.26e-180) {
		tmp = c / -b;
	} else if (b <= 5.8e-119) {
		tmp = -sqrt(((c / a) * -1.0));
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-1.26d-180)) then
        tmp = c / -b
    else if (b <= 5.8d-119) then
        tmp = -sqrt(((c / a) * (-1.0d0)))
    else
        tmp = -b / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.26e-180) {
		tmp = c / -b;
	} else if (b <= 5.8e-119) {
		tmp = -Math.sqrt(((c / a) * -1.0));
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.26e-180:
		tmp = c / -b
	elif b <= 5.8e-119:
		tmp = -math.sqrt(((c / a) * -1.0))
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.26e-180)
		tmp = Float64(c / Float64(-b));
	elseif (b <= 5.8e-119)
		tmp = Float64(-sqrt(Float64(Float64(c / a) * -1.0)));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.26e-180)
		tmp = c / -b;
	elseif (b <= 5.8e-119)
		tmp = -sqrt(((c / a) * -1.0));
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.26e-180], N[(c / (-b)), $MachinePrecision], If[LessEqual[b, 5.8e-119], (-N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]), N[((-b) / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.25999999999999997e-180

   1. Initial program 18.1%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 83.9

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

   5. Applied rewrites 83.9%

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

   if -1.25999999999999997e-180 < b < 5.8e-119

   1. Initial program 77.0%

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

      1. lift-neg.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. flip-- N/A

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

      9. lower-/.f64 N/A

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in a around -inf

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

   7. Applied rewrites 47.8%

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

   if 5.8e-119 < b

   1. Initial program 70.7%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lift-neg.f64 75.9

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

   5. Applied rewrites 75.9%

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

4. Final simplification 74.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.26 \cdot 10^{-180}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 5.8 \cdot 10^{-119}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 71.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{-147}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 5.1 \cdot 10^{-174}:\\ \;\;\;\;\sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -8e-147)
   (/ c (- b))
   (if (<= b 5.1e-174) (sqrt (* (/ c a) -1.0)) (/ (- b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -8e-147) {
		tmp = c / -b;
	} else if (b <= 5.1e-174) {
		tmp = sqrt(((c / a) * -1.0));
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-8d-147)) then
        tmp = c / -b
    else if (b <= 5.1d-174) then
        tmp = sqrt(((c / a) * (-1.0d0)))
    else
        tmp = -b / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -8e-147) {
		tmp = c / -b;
	} else if (b <= 5.1e-174) {
		tmp = Math.sqrt(((c / a) * -1.0));
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -8e-147:
		tmp = c / -b
	elif b <= 5.1e-174:
		tmp = math.sqrt(((c / a) * -1.0))
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -8e-147)
		tmp = Float64(c / Float64(-b));
	elseif (b <= 5.1e-174)
		tmp = sqrt(Float64(Float64(c / a) * -1.0));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -8e-147)
		tmp = c / -b;
	elseif (b <= 5.1e-174)
		tmp = sqrt(((c / a) * -1.0));
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -8e-147], N[(c / (-b)), $MachinePrecision], If[LessEqual[b, 5.1e-174], N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision], N[((-b) / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -7.9999999999999998e-147

   1. Initial program 16.4%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 87.4

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

   5. Applied rewrites 87.4%

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

   if -7.9999999999999998e-147 < b < 5.10000000000000032e-174

   1. Initial program 74.1%

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

   3. Taylor expanded in a around -inf

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

      1. sqrt-unprod N/A

         \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]

      3. lower-*.f64 N/A

         \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]

      4. lower-/.f64 31.2

         \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]

   5. Applied rewrites 31.2%

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

   if 5.10000000000000032e-174 < b

   1. Initial program 70.2%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lift-neg.f64 71.9

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

   5. Applied rewrites 71.9%

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

4. Final simplification 71.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{-147}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 5.1 \cdot 10^{-174}:\\ \;\;\;\;\sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 67.5% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    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
    else
        tmp = -b / a
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -1.999999999999994e-310

   1. Initial program 28.2%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 72.0

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

   5. Applied rewrites 72.0%

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

   if -1.999999999999994e-310 < b

   1. Initial program 71.0%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lift-neg.f64 65.5

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

   5. Applied rewrites 65.5%

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

4. Final simplification 68.9%

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

Alternative 9: 35.1% accurate, 3.6× 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    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 / Float64(-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 49.0%

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

3. Taylor expanded in b around -inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. lower-/.f64 38.2

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

5. Applied rewrites 38.2%

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

6. Final simplification 38.2%

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

Alternative 10: 11.0% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    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 49.0%

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

3. Taylor expanded in c around 0

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

   1. *-commutative N/A

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

   2. lower-fma.f64 N/A

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

   3. lower-/.f64 N/A

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

   4. lower-/.f64 33.0

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

5. Applied rewrites 33.0%

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

6. Taylor expanded in a around inf

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

   1. lift-/.f64 8.0

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

8. Applied rewrites 8.0%

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

Developer Target 1: 69.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}\\ \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{c}{a \cdot \frac{\left(-b\right) + t\_0}{2 \cdot a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* 4.0 (* a c))))))
   (if (< b 0.0)
     (/ c (* a (/ (+ (- b) t_0) (* 2.0 a))))
     (/ (- (- b) t_0) (* 2.0 a)))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - (4.0 * (a * c))));
	double tmp;
	if (b < 0.0) {
		tmp = c / (a * ((-b + t_0) / (2.0 * a)));
	} else {
		tmp = (-b - t_0) / (2.0 * a);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((b * b) - (4.0d0 * (a * c))))
    if (b < 0.0d0) then
        tmp = c / (a * ((-b + t_0) / (2.0d0 * a)))
    else
        tmp = (-b - t_0) / (2.0d0 * a)
    end if
    code = tmp
end function

Java

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

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - (4.0 * (a * c))))
	tmp = 0
	if b < 0.0:
		tmp = c / (a * ((-b + t_0) / (2.0 * a)))
	else:
		tmp = (-b - t_0) / (2.0 * a)
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))
	tmp = 0.0
	if (b < 0.0)
		tmp = Float64(c / Float64(a * Float64(Float64(Float64(-b) + t_0) / Float64(2.0 * a))));
	else
		tmp = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = sqrt(((b * b) - (4.0 * (a * c))));
	tmp = 0.0;
	if (b < 0.0)
		tmp = c / (a * ((-b + t_0) / (2.0 * a)));
	else
		tmp = (-b - t_0) / (2.0 * a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[Less[b, 0.0], N[(c / N[(a * N[(N[((-b) + t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2025057 
(FPCore (a b c)
  :name "The quadratic formula (r2)"
  :precision binary64

  :alt
  (! :herbie-platform default (let ((d (sqrt (- (* b b) (* 4 (* a c)))))) (let ((r1 (/ (+ (- b) d) (* 2 a)))) (let ((r2 (/ (- (- b) d) (* 2 a)))) (if (< b 0) (/ c (* a r1)) r2)))))

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