The quadratic formula (r2)

Percentage Accurate: 52.6% → 85.0%

Time: 4.3s

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: 52.6% 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.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.9e-39)
   (- (/ c b))
   (if (<= b 1.3e+31)
     (- (/ (- b) (* 2.0 a)) (/ (sqrt (fma (* -4.0 a) c (* b b))) (* 2.0 a)))
     (+ (/ (- b) a) (/ c b)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -4.89999999999999974e-39

   1. Initial program 15.9%

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

   2. Taylor expanded in b around -inf

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

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

   4. Applied rewrites 88.4%

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

   if -4.89999999999999974e-39 < b < 1.3e31

   1. Initial program 76.4%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

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

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

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

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

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

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

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

      10. div-sub N/A

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

      11. lower--.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lift-neg.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. lower-/.f64 N/A

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

   3. Applied rewrites 76.4%

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

   if 1.3e31 < b

   1. Initial program 63.8%

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

   2. Taylor expanded in c around 0

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

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

   4. Applied rewrites 93.0%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lift-neg.f64 N/A

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

      10. lift-/.f64 93.0

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

   6. Applied rewrites 93.0%

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

Alternative 2: 85.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.9e-39)
   (- (/ c b))
   (if (<= b 1.3e+31)
     (/ (- (- b) (sqrt (fma (* c a) -4.0 (* b b)))) (+ a a))
     (+ (/ (- b) a) (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.9e-39) {
		tmp = -(c / b);
	} else if (b <= 1.3e+31) {
		tmp = (-b - sqrt(fma((c * a), -4.0, (b * b)))) / (a + a);
	} else {
		tmp = (-b / a) + (c / b);
	}
	return tmp;
}

Julia

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.9e-39], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 1.3e+31], 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] + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.89999999999999974e-39

   1. Initial program 15.9%

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

   2. Taylor expanded in b around -inf

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

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

   4. Applied rewrites 88.4%

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

   if -4.89999999999999974e-39 < b < 1.3e31

   1. Initial program 76.4%

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

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

   3. Applied rewrites 76.4%

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

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

   5. Applied rewrites 76.4%

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

   if 1.3e31 < b

   1. Initial program 63.8%

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

   2. Taylor expanded in c around 0

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

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

   4. Applied rewrites 93.0%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lift-neg.f64 N/A

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

      10. lift-/.f64 93.0

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

   6. Applied rewrites 93.0%

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

Alternative 3: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.9 \cdot 10^{-39}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 3.8 \cdot 10^{-70}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\left(-4 \cdot a\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.9e-39)
   (- (/ c b))
   (if (<= b 3.8e-70)
     (/ (- (- b) (sqrt (* (* -4.0 a) c))) (+ a a))
     (+ (/ (- b) a) (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.9e-39) {
		tmp = -(c / b);
	} else if (b <= 3.8e-70) {
		tmp = (-b - sqrt(((-4.0 * a) * c))) / (a + a);
	} else {
		tmp = (-b / a) + (c / b);
	}
	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 <= (-4.9d-39)) then
        tmp = -(c / b)
    else if (b <= 3.8d-70) then
        tmp = (-b - sqrt((((-4.0d0) * a) * c))) / (a + a)
    else
        tmp = (-b / a) + (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.9e-39) {
		tmp = -(c / b);
	} else if (b <= 3.8e-70) {
		tmp = (-b - Math.sqrt(((-4.0 * a) * c))) / (a + a);
	} else {
		tmp = (-b / a) + (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4.9e-39:
		tmp = -(c / b)
	elif b <= 3.8e-70:
		tmp = (-b - math.sqrt(((-4.0 * a) * c))) / (a + a)
	else:
		tmp = (-b / a) + (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.9e-39)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 3.8e-70)
		tmp = Float64(Float64(Float64(-b) - sqrt(Float64(Float64(-4.0 * a) * c))) / Float64(a + a));
	else
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -4.9e-39)
		tmp = -(c / b);
	elseif (b <= 3.8e-70)
		tmp = (-b - sqrt(((-4.0 * a) * c))) / (a + a);
	else
		tmp = (-b / a) + (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.9e-39], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 3.8e-70], N[(N[((-b) - N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.89999999999999974e-39

   1. Initial program 15.9%

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

   2. Taylor expanded in b around -inf

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

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

   4. Applied rewrites 88.4%

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

   if -4.89999999999999974e-39 < b < 3.7999999999999998e-70

   1. Initial program 72.3%

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

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

   3. Applied rewrites 72.3%

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

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

   5. Applied rewrites 72.3%

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

   6. Taylor expanded in a around inf

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

      1. lift-*.f64 N/A

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

      2. pow2 N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. metadata-eval N/A

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

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

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

      9. pow2 N/A

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

      10. sqrt-unprod N/A

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

      11. *-commutative N/A

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

      12. lift-*.f64 N/A

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

      13. lower-sqrt.f64 N/A

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

      14. lift-*.f64 N/A

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

      15. *-commutative N/A

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

      16. *-commutative N/A

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

      17. associate-*r* N/A

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

      18. lower-*.f64 N/A

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

      19. lower-*.f64 65.1

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

   8. Applied rewrites 65.1%

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

   if 3.7999999999999998e-70 < b

   1. Initial program 70.0%

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

   2. Taylor expanded in c around 0

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

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

   4. Applied rewrites 86.4%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lift-neg.f64 N/A

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

      10. lift-/.f64 86.4

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

   6. Applied rewrites 86.4%

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

Alternative 4: 80.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.9 \cdot 10^{-39}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 3.8 \cdot 10^{-70}:\\ \;\;\;\;\frac{-\sqrt{-4 \cdot \left(c \cdot a\right)}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.9e-39)
   (- (/ c b))
   (if (<= b 3.8e-70)
     (/ (- (sqrt (* -4.0 (* c a)))) (+ a a))
     (+ (/ (- b) a) (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.9e-39) {
		tmp = -(c / b);
	} else if (b <= 3.8e-70) {
		tmp = -sqrt((-4.0 * (c * a))) / (a + a);
	} else {
		tmp = (-b / a) + (c / b);
	}
	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 <= (-4.9d-39)) then
        tmp = -(c / b)
    else if (b <= 3.8d-70) then
        tmp = -sqrt(((-4.0d0) * (c * a))) / (a + a)
    else
        tmp = (-b / a) + (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.9e-39) {
		tmp = -(c / b);
	} else if (b <= 3.8e-70) {
		tmp = -Math.sqrt((-4.0 * (c * a))) / (a + a);
	} else {
		tmp = (-b / a) + (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4.9e-39:
		tmp = -(c / b)
	elif b <= 3.8e-70:
		tmp = -math.sqrt((-4.0 * (c * a))) / (a + a)
	else:
		tmp = (-b / a) + (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.9e-39)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 3.8e-70)
		tmp = Float64(Float64(-sqrt(Float64(-4.0 * Float64(c * a)))) / Float64(a + a));
	else
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -4.9e-39)
		tmp = -(c / b);
	elseif (b <= 3.8e-70)
		tmp = -sqrt((-4.0 * (c * a))) / (a + a);
	else
		tmp = (-b / a) + (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.9e-39], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 3.8e-70], N[((-N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.89999999999999974e-39

   1. Initial program 15.9%

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

   2. Taylor expanded in b around -inf

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

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

   4. Applied rewrites 88.4%

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

   if -4.89999999999999974e-39 < b < 3.7999999999999998e-70

   1. Initial program 72.3%

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

   2. Taylor expanded in a around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. *-commutative N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 64.1

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

   4. Applied rewrites 64.1%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 64.1

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

   6. Applied rewrites 64.1%

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

   if 3.7999999999999998e-70 < b

   1. Initial program 70.0%

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

   2. Taylor expanded in c around 0

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

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

   4. Applied rewrites 86.4%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lift-neg.f64 N/A

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

      10. lift-/.f64 86.4

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

   6. Applied rewrites 86.4%

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

Alternative 5: 72.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.25 \cdot 10^{-172}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 9 \cdot 10^{-144}:\\ \;\;\;\;-\sqrt{-\frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.25e-172)
   (- (/ c b))
   (if (<= b 9e-144) (- (sqrt (- (/ c a)))) (+ (/ (- b) a) (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e-172) {
		tmp = -(c / b);
	} else if (b <= 9e-144) {
		tmp = -sqrt(-(c / a));
	} else {
		tmp = (-b / a) + (c / b);
	}
	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.25d-172)) then
        tmp = -(c / b)
    else if (b <= 9d-144) then
        tmp = -sqrt(-(c / a))
    else
        tmp = (-b / a) + (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e-172) {
		tmp = -(c / b);
	} else if (b <= 9e-144) {
		tmp = -Math.sqrt(-(c / a));
	} else {
		tmp = (-b / a) + (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.25e-172:
		tmp = -(c / b)
	elif b <= 9e-144:
		tmp = -math.sqrt(-(c / a))
	else:
		tmp = (-b / a) + (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.25e-172)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 9e-144)
		tmp = Float64(-sqrt(Float64(-Float64(c / a))));
	else
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.25e-172)
		tmp = -(c / b);
	elseif (b <= 9e-144)
		tmp = -sqrt(-(c / a));
	else
		tmp = (-b / a) + (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.25e-172], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 9e-144], (-N[Sqrt[(-N[(c / a), $MachinePrecision])], $MachinePrecision]), N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.25e-172

   1. Initial program 24.4%

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

   2. Taylor expanded in b around -inf

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

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

   4. Applied rewrites 78.0%

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

   if -1.25e-172 < b < 8.9999999999999996e-144

   1. Initial program 75.2%

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

   2. Taylor expanded in a around -inf

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

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

   4. Applied rewrites 36.7%

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

   5. Taylor expanded in c around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sqrt-prod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. *-commutative N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 N/A

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

      8. lift-/.f64 36.6

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

   7. Applied rewrites 36.6%

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

   if 8.9999999999999996e-144 < b

   1. Initial program 72.7%

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

   2. Taylor expanded in c around 0

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

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

   4. Applied rewrites 81.1%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lift-neg.f64 N/A

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

      10. lift-/.f64 81.1

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

   6. Applied rewrites 81.1%

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

Alternative 6: 72.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.25 \cdot 10^{-172}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 9 \cdot 10^{-144}:\\ \;\;\;\;-\sqrt{-\frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.25e-172)
   (- (/ c b))
   (if (<= b 9e-144) (- (sqrt (- (/ c a)))) (/ (- b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e-172) {
		tmp = -(c / b);
	} else if (b <= 9e-144) {
		tmp = -sqrt(-(c / a));
	} 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.25d-172)) then
        tmp = -(c / b)
    else if (b <= 9d-144) then
        tmp = -sqrt(-(c / a))
    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.25e-172) {
		tmp = -(c / b);
	} else if (b <= 9e-144) {
		tmp = -Math.sqrt(-(c / a));
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.25e-172:
		tmp = -(c / b)
	elif b <= 9e-144:
		tmp = -math.sqrt(-(c / a))
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.25e-172)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 9e-144)
		tmp = Float64(-sqrt(Float64(-Float64(c / a))));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.25e-172)
		tmp = -(c / b);
	elseif (b <= 9e-144)
		tmp = -sqrt(-(c / a));
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.25e-172], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 9e-144], (-N[Sqrt[(-N[(c / a), $MachinePrecision])], $MachinePrecision]), N[((-b) / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.25e-172

   1. Initial program 24.4%

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

   2. Taylor expanded in b around -inf

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

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

   4. Applied rewrites 78.0%

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

   if -1.25e-172 < b < 8.9999999999999996e-144

   1. Initial program 75.2%

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

   2. Taylor expanded in a around -inf

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

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

   4. Applied rewrites 36.7%

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

   5. Taylor expanded in c around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sqrt-prod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. *-commutative N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 N/A

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

      8. lift-/.f64 36.6

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

   7. Applied rewrites 36.6%

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

   if 8.9999999999999996e-144 < b

   1. Initial program 72.7%

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

   2. Taylor expanded in a around 0

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

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

   4. Applied rewrites 80.6%

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

Alternative 7: 71.8% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.85 \cdot 10^{-184}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 3 \cdot 10^{-190}:\\ \;\;\;\;\sqrt{-\frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.85e-184)
   (- (/ c b))
   (if (<= b 3e-190) (sqrt (- (/ c a))) (/ (- b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.85e-184) {
		tmp = -(c / b);
	} else if (b <= 3e-190) {
		tmp = sqrt(-(c / a));
	} 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.85d-184)) then
        tmp = -(c / b)
    else if (b <= 3d-190) then
        tmp = sqrt(-(c / a))
    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.85e-184) {
		tmp = -(c / b);
	} else if (b <= 3e-190) {
		tmp = Math.sqrt(-(c / a));
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.85e-184:
		tmp = -(c / b)
	elif b <= 3e-190:
		tmp = math.sqrt(-(c / a))
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.85e-184)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 3e-190)
		tmp = sqrt(Float64(-Float64(c / a)));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.85e-184)
		tmp = -(c / b);
	elseif (b <= 3e-190)
		tmp = sqrt(-(c / a));
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.85e-184], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 3e-190], N[Sqrt[(-N[(c / a), $MachinePrecision])], $MachinePrecision], N[((-b) / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.8499999999999999e-184

   1. Initial program 25.1%

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

   2. Taylor expanded in b around -inf

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

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

   4. Applied rewrites 77.3%

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

   if -1.8499999999999999e-184 < b < 2.9999999999999998e-190

   1. Initial program 74.9%

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

   2. Taylor expanded in a around -inf

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

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

   4. Applied rewrites 38.4%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. lift-/.f64 38.4

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

   6. Applied rewrites 38.4%

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

   if 2.9999999999999998e-190 < b

   1. Initial program 73.0%

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

   2. Taylor expanded in a around 0

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

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

   4. Applied rewrites 76.7%

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

Alternative 8: 67.7% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.8e-260) (- (/ c b)) (/ (- b) a)))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -2.7999999999999998e-260

   1. Initial program 29.6%

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

   2. Taylor expanded in b around -inf

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

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

   4. Applied rewrites 71.3%

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

   if -2.7999999999999998e-260 < b

   1. Initial program 73.3%

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

   2. Taylor expanded in a around 0

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

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

   4. Applied rewrites 64.4%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
3. Recombined 2 regimes into one program.
4. 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(-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 52.6%

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

2. Taylor expanded in b around -inf

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

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

4. Applied rewrites 35.1%

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

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

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

2. Taylor expanded in a around 0

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

   1. lower-/.f64 N/A

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

   2. mul-1-neg N/A

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

   3. +-commutative N/A

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

   4. associate-/l* N/A

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

   5. lower-fma.f64 N/A

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

   6. lower-/.f64 N/A

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

   7. lift-neg.f64 35.1

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

4. Applied rewrites 35.1%

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

5. Taylor expanded in a around inf

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

   1. lift-/.f64 10.8

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

7. Applied rewrites 10.8%

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

Developer Target 1: 71.1% 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 2025105 
(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)))