quadm (p42, negative)

Percentage Accurate: 52.0% → 85.6%

Time: 4.1s

Alternatives: 9

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.0% 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.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -6.3 \cdot 10^{-86}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq 1.4 \cdot 10^{+87}:\\ \;\;\;\;\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 -6.3e-86)
   (/ (- c) b)
   (if (<= b 1.4e+87)
     (/ (- (- 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 <= -6.3e-86) {
		tmp = -c / b;
	} else if (b <= 1.4e+87) {
		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 <= -6.3e-86)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= 1.4e+87)
		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, -6.3e-86], N[((-c) / b), $MachinePrecision], If[LessEqual[b, 1.4e+87], 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 < -6.2999999999999999e-86

   1. Initial program 18.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 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 89.1

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

   5. Applied rewrites 89.1%

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

   if -6.2999999999999999e-86 < b < 1.40000000000000008e87

   1. Initial program 68.2%

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

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

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

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

   6. Applied rewrites 68.2%

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

   if 1.40000000000000008e87 < b

   1. Initial program 53.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 90.7

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

   5. Applied rewrites 90.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)} \]
   6. 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. mul-1-neg N/A

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

      7. distribute-frac-neg N/A

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

      8. lift-/.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 90.7

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

   7. Applied rewrites 90.7%

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

4. Final simplification 81.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -6.3 \cdot 10^{-86}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq 1.4 \cdot 10^{+87}:\\ \;\;\;\;\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} \]
5. Add Preprocessing

Alternative 2: 80.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{-86}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq 2.75 \cdot 10^{-145}:\\ \;\;\;\;\frac{b + \sqrt{-4 \cdot \left(c \cdot a\right)}}{\left(-a\right) - a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e-86)
   (/ (- c) b)
   (if (<= b 2.75e-145)
     (/ (+ b (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.8e-86) {
		tmp = -c / b;
	} else if (b <= 2.75e-145) {
		tmp = (b + 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.8d-86)) then
        tmp = -c / b
    else if (b <= 2.75d-145) then
        tmp = (b + 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.8e-86) {
		tmp = -c / b;
	} else if (b <= 2.75e-145) {
		tmp = (b + 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.8e-86:
		tmp = -c / b
	elif b <= 2.75e-145:
		tmp = (b + 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.8e-86)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= 2.75e-145)
		tmp = Float64(Float64(b + sqrt(Float64(-4.0 * Float64(c * a)))) / Float64(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.8e-86)
		tmp = -c / b;
	elseif (b <= 2.75e-145)
		tmp = (b + 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.8e-86], N[((-c) / b), $MachinePrecision], If[LessEqual[b, 2.75e-145], 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] + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.80000000000000026e-86

   1. Initial program 18.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 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 89.1

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

   5. Applied rewrites 89.1%

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

   if -4.80000000000000026e-86 < b < 2.75000000000000008e-145

   1. Initial program 63.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 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 63.3

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

   5. Applied rewrites 63.3%

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

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

   7. Applied rewrites 63.3%

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

   if 2.75000000000000008e-145 < b

   1. Initial program 61.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 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 79.4

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

   5. Applied rewrites 79.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)} \]
   6. 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. mul-1-neg N/A

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

      7. distribute-frac-neg N/A

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

      8. lift-/.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 79.4

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

   7. Applied rewrites 79.4%

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

4. Final simplification 78.9%

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

Alternative 3: 80.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{-86}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq 2.75 \cdot 10^{-145}:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot c\right) \cdot -4}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e-86)
   (/ (- c) b)
   (if (<= b 2.75e-145)
     (/ (- (sqrt (* (* a c) -4.0))) (+ a a))
     (+ (/ (- b) a) (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e-86) {
		tmp = -c / b;
	} else if (b <= 2.75e-145) {
		tmp = -sqrt(((a * c) * -4.0)) / (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.8d-86)) then
        tmp = -c / b
    else if (b <= 2.75d-145) then
        tmp = -sqrt(((a * c) * (-4.0d0))) / (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.8e-86) {
		tmp = -c / b;
	} else if (b <= 2.75e-145) {
		tmp = -Math.sqrt(((a * c) * -4.0)) / (a + a);
	} else {
		tmp = (-b / a) + (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4.8e-86:
		tmp = -c / b
	elif b <= 2.75e-145:
		tmp = -math.sqrt(((a * c) * -4.0)) / (a + a)
	else:
		tmp = (-b / a) + (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.8e-86)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= 2.75e-145)
		tmp = Float64(Float64(-sqrt(Float64(Float64(a * c) * -4.0))) / 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.8e-86)
		tmp = -c / b;
	elseif (b <= 2.75e-145)
		tmp = -sqrt(((a * c) * -4.0)) / (a + a);
	else
		tmp = (-b / a) + (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.8e-86], N[((-c) / b), $MachinePrecision], If[LessEqual[b, 2.75e-145], N[((-N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $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.80000000000000026e-86

   1. Initial program 18.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 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 89.1

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

   5. Applied rewrites 89.1%

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

   if -4.80000000000000026e-86 < b < 2.75000000000000008e-145

   1. Initial program 63.3%

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

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

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

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

   6. Applied rewrites 63.3%

      \[\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. *-commutative N/A

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

      5. lower-sqrt.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 63.0

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

   9. Applied rewrites 63.0%

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

   if 2.75000000000000008e-145 < b

   1. Initial program 61.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 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 79.4

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

   5. Applied rewrites 79.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)} \]
   6. 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. mul-1-neg N/A

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

      7. distribute-frac-neg N/A

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

      8. lift-/.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 79.4

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

   7. Applied rewrites 79.4%

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

4. Final simplification 78.9%

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

Alternative 4: 71.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\frac{-c}{a}}\\ \mathbf{if}\;b \leq -3.6 \cdot 10^{-196}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq -6.2 \cdot 10^{-282}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{-154}:\\ \;\;\;\;-t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (/ (- c) a))))
   (if (<= b -3.6e-196)
     (/ (- c) b)
     (if (<= b -6.2e-282)
       t_0
       (if (<= b 2.1e-154) (- t_0) (+ (/ (- b) a) (/ c b)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-c / a));
	double tmp;
	if (b <= -3.6e-196) {
		tmp = -c / b;
	} else if (b <= -6.2e-282) {
		tmp = t_0;
	} else if (b <= 2.1e-154) {
		tmp = -t_0;
	} 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) :: t_0
    real(8) :: tmp
    t_0 = sqrt((-c / a))
    if (b <= (-3.6d-196)) then
        tmp = -c / b
    else if (b <= (-6.2d-282)) then
        tmp = t_0
    else if (b <= 2.1d-154) then
        tmp = -t_0
    else
        tmp = (-b / a) + (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt((-c / a));
	double tmp;
	if (b <= -3.6e-196) {
		tmp = -c / b;
	} else if (b <= -6.2e-282) {
		tmp = t_0;
	} else if (b <= 2.1e-154) {
		tmp = -t_0;
	} else {
		tmp = (-b / a) + (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = math.sqrt((-c / a))
	tmp = 0
	if b <= -3.6e-196:
		tmp = -c / b
	elif b <= -6.2e-282:
		tmp = t_0
	elif b <= 2.1e-154:
		tmp = -t_0
	else:
		tmp = (-b / a) + (c / b)
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(-c) / a))
	tmp = 0.0
	if (b <= -3.6e-196)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= -6.2e-282)
		tmp = t_0;
	elseif (b <= 2.1e-154)
		tmp = Float64(-t_0);
	else
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = sqrt((-c / a));
	tmp = 0.0;
	if (b <= -3.6e-196)
		tmp = -c / b;
	elseif (b <= -6.2e-282)
		tmp = t_0;
	elseif (b <= 2.1e-154)
		tmp = -t_0;
	else
		tmp = (-b / a) + (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -3.6e-196], N[((-c) / b), $MachinePrecision], If[LessEqual[b, -6.2e-282], t$95$0, If[LessEqual[b, 2.1e-154], (-t$95$0), N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -3.6000000000000001e-196

   1. Initial program 23.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 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 81.2

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

   5. Applied rewrites 81.2%

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

   if -3.6000000000000001e-196 < b < -6.20000000000000027e-282

   1. Initial program 70.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}{\frac{-1}{2} \cdot \frac{b}{a} + \sqrt{\frac{c}{a}} \cdot \sqrt{-1}} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 70.0

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

   5. Applied rewrites 70.0%

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

   6. Taylor expanded in a around inf

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

      1. sqrt-prod N/A

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

      2. lower-sqrt.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 70.0

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

   8. Applied rewrites 70.0%

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

   if -6.20000000000000027e-282 < b < 2.09999999999999984e-154

   1. Initial program 66.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 a around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 35.5

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

   5. Applied rewrites 35.5%

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

   6. Taylor expanded in c around -inf

      \[\leadsto -1 \cdot \color{blue}{\left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right)} \]
   7. 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 60.2

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

   8. Applied rewrites 60.2%

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

   if 2.09999999999999984e-154 < b

   1. Initial program 61.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 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 79.4

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

   5. Applied rewrites 79.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)} \]
   6. 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. mul-1-neg N/A

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

      7. distribute-frac-neg N/A

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

      8. lift-/.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 79.4

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

   7. Applied rewrites 79.4%

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

4. Final simplification 77.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -3.6 \cdot 10^{-196}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq -6.2 \cdot 10^{-282}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{-154}:\\ \;\;\;\;-\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 71.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\frac{-c}{a}}\\ \mathbf{if}\;b \leq -3.6 \cdot 10^{-196}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq -6.2 \cdot 10^{-282}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{-154}:\\ \;\;\;\;-t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (/ (- c) a))))
   (if (<= b -3.6e-196)
     (/ (- c) b)
     (if (<= b -6.2e-282) t_0 (if (<= b 2.1e-154) (- t_0) (/ (- b) a))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-c / a));
	double tmp;
	if (b <= -3.6e-196) {
		tmp = -c / b;
	} else if (b <= -6.2e-282) {
		tmp = t_0;
	} else if (b <= 2.1e-154) {
		tmp = -t_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) :: t_0
    real(8) :: tmp
    t_0 = sqrt((-c / a))
    if (b <= (-3.6d-196)) then
        tmp = -c / b
    else if (b <= (-6.2d-282)) then
        tmp = t_0
    else if (b <= 2.1d-154) then
        tmp = -t_0
    else
        tmp = -b / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt((-c / a));
	double tmp;
	if (b <= -3.6e-196) {
		tmp = -c / b;
	} else if (b <= -6.2e-282) {
		tmp = t_0;
	} else if (b <= 2.1e-154) {
		tmp = -t_0;
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = math.sqrt((-c / a))
	tmp = 0
	if b <= -3.6e-196:
		tmp = -c / b
	elif b <= -6.2e-282:
		tmp = t_0
	elif b <= 2.1e-154:
		tmp = -t_0
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(-c) / a))
	tmp = 0.0
	if (b <= -3.6e-196)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= -6.2e-282)
		tmp = t_0;
	elseif (b <= 2.1e-154)
		tmp = Float64(-t_0);
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = sqrt((-c / a));
	tmp = 0.0;
	if (b <= -3.6e-196)
		tmp = -c / b;
	elseif (b <= -6.2e-282)
		tmp = t_0;
	elseif (b <= 2.1e-154)
		tmp = -t_0;
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -3.6e-196], N[((-c) / b), $MachinePrecision], If[LessEqual[b, -6.2e-282], t$95$0, If[LessEqual[b, 2.1e-154], (-t$95$0), N[((-b) / a), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -3.6000000000000001e-196

   1. Initial program 23.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 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 81.2

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

   5. Applied rewrites 81.2%

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

   if -3.6000000000000001e-196 < b < -6.20000000000000027e-282

   1. Initial program 70.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}{\frac{-1}{2} \cdot \frac{b}{a} + \sqrt{\frac{c}{a}} \cdot \sqrt{-1}} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 70.0

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

   5. Applied rewrites 70.0%

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

   6. Taylor expanded in a around inf

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

      1. sqrt-prod N/A

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

      2. lower-sqrt.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 70.0

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

   8. Applied rewrites 70.0%

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

   if -6.20000000000000027e-282 < b < 2.09999999999999984e-154

   1. Initial program 66.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 a around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 35.5

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

   5. Applied rewrites 35.5%

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

   6. Taylor expanded in c around -inf

      \[\leadsto -1 \cdot \color{blue}{\left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right)} \]
   7. 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 60.2

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

   8. Applied rewrites 60.2%

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

   if 2.09999999999999984e-154 < b

   1. Initial program 61.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 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 78.8

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

   5. Applied rewrites 78.8%

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

4. Final simplification 77.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -3.6 \cdot 10^{-196}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq -6.2 \cdot 10^{-282}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{-154}:\\ \;\;\;\;-\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 71.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.6 \cdot 10^{-196}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq 4.5 \cdot 10^{-174}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.6e-196)
   (/ (- c) b)
   (if (<= b 4.5e-174) (sqrt (/ (- c) a)) (/ (- b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.6e-196) {
		tmp = -c / b;
	} else if (b <= 4.5e-174) {
		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 <= (-3.6d-196)) then
        tmp = -c / b
    else if (b <= 4.5d-174) 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 <= -3.6e-196) {
		tmp = -c / b;
	} else if (b <= 4.5e-174) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -3.6e-196:
		tmp = -c / b
	elif b <= 4.5e-174:
		tmp = math.sqrt((-c / a))
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.6e-196)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= 4.5e-174)
		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 <= -3.6e-196)
		tmp = -c / b;
	elseif (b <= 4.5e-174)
		tmp = sqrt((-c / a));
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.6e-196], N[((-c) / b), $MachinePrecision], If[LessEqual[b, 4.5e-174], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[((-b) / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.6000000000000001e-196

   1. Initial program 23.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 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 81.2

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

   5. Applied rewrites 81.2%

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

   if -3.6000000000000001e-196 < b < 4.49999999999999964e-174

   1. Initial program 66.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}{\frac{-1}{2} \cdot \frac{b}{a} + \sqrt{\frac{c}{a}} \cdot \sqrt{-1}} \]
   4. Step-by-step derivation

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 47.5

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

   5. Applied rewrites 47.5%

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

   6. Taylor expanded in a around inf

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

      1. sqrt-prod N/A

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

      2. lower-sqrt.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 47.5

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

   8. Applied rewrites 47.5%

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

   if 4.49999999999999964e-174 < b

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

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

   5. Applied rewrites 77.4%

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

4. Final simplification 74.0%

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

Alternative 7: 67.9% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

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

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

   5. Applied rewrites 71.5%

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

   if -4.999999999999985e-310 < b

   1. Initial program 61.5%

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

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

   5. Applied rewrites 62.7%

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

4. Final simplification 67.0%

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

Alternative 8: 35.2% 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 46.5%

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

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

5. Applied rewrites 36.1%

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

6. Final simplification 36.1%

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

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

   \[\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}{\frac{-1 \cdot b + \frac{a \cdot c}{b}}{a}} \]
4. 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 33.3

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

5. Applied rewrites 33.3%

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

6. Taylor expanded in a around inf

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

   1. lift-/.f64 12.5

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

8. Applied rewrites 12.5%

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

Developer Target 1: 99.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left|\frac{b}{2}\right|\\ t_1 := \sqrt{\left|a\right|} \cdot \sqrt{\left|c\right|}\\ t_2 := \begin{array}{l} \mathbf{if}\;\mathsf{copysign}\left(a, c\right) = a:\\ \;\;\;\;\sqrt{t\_0 - t\_1} \cdot \sqrt{t\_0 + t\_1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\frac{b}{2}, t\_1\right)\\ \end{array}\\ \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{c}{t\_2 - \frac{b}{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b}{2} + t\_2}{-a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (fabs (/ b 2.0)))
        (t_1 (* (sqrt (fabs a)) (sqrt (fabs c))))
        (t_2
         (if (== (copysign a c) a)
           (* (sqrt (- t_0 t_1)) (sqrt (+ t_0 t_1)))
           (hypot (/ b 2.0) t_1))))
   (if (< b 0.0) (/ c (- t_2 (/ b 2.0))) (/ (+ (/ b 2.0) t_2) (- a)))))

C

double code(double a, double b, double c) {
	double t_0 = fabs((b / 2.0));
	double t_1 = sqrt(fabs(a)) * sqrt(fabs(c));
	double tmp;
	if (copysign(a, c) == a) {
		tmp = sqrt((t_0 - t_1)) * sqrt((t_0 + t_1));
	} else {
		tmp = hypot((b / 2.0), t_1);
	}
	double t_2 = tmp;
	double tmp_1;
	if (b < 0.0) {
		tmp_1 = c / (t_2 - (b / 2.0));
	} else {
		tmp_1 = ((b / 2.0) + t_2) / -a;
	}
	return tmp_1;
}

Java

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

Python

def code(a, b, c):
	t_0 = math.fabs((b / 2.0))
	t_1 = math.sqrt(math.fabs(a)) * math.sqrt(math.fabs(c))
	tmp = 0
	if math.copysign(a, c) == a:
		tmp = math.sqrt((t_0 - t_1)) * math.sqrt((t_0 + t_1))
	else:
		tmp = math.hypot((b / 2.0), t_1)
	t_2 = tmp
	tmp_1 = 0
	if b < 0.0:
		tmp_1 = c / (t_2 - (b / 2.0))
	else:
		tmp_1 = ((b / 2.0) + t_2) / -a
	return tmp_1

Julia

function code(a, b, c)
	t_0 = abs(Float64(b / 2.0))
	t_1 = Float64(sqrt(abs(a)) * sqrt(abs(c)))
	tmp = 0.0
	if (copysign(a, c) == a)
		tmp = Float64(sqrt(Float64(t_0 - t_1)) * sqrt(Float64(t_0 + t_1)));
	else
		tmp = hypot(Float64(b / 2.0), t_1);
	end
	t_2 = tmp
	tmp_1 = 0.0
	if (b < 0.0)
		tmp_1 = Float64(c / Float64(t_2 - Float64(b / 2.0)));
	else
		tmp_1 = Float64(Float64(Float64(b / 2.0) + t_2) / Float64(-a));
	end
	return tmp_1
end

MATLAB

function tmp_3 = code(a, b, c)
	t_0 = abs((b / 2.0));
	t_1 = sqrt(abs(a)) * sqrt(abs(c));
	tmp = 0.0;
	if ((sign(c) * abs(a)) == a)
		tmp = sqrt((t_0 - t_1)) * sqrt((t_0 + t_1));
	else
		tmp = hypot((b / 2.0), t_1);
	end
	t_2 = tmp;
	tmp_2 = 0.0;
	if (b < 0.0)
		tmp_2 = c / (t_2 - (b / 2.0));
	else
		tmp_2 = ((b / 2.0) + t_2) / -a;
	end
	tmp_3 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Abs[N[(b / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[Abs[a], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[c], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = If[Equal[N[With[{TMP1 = Abs[a], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], a], N[(N[Sqrt[N[(t$95$0 - t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(b / 2.0), $MachinePrecision] ^ 2 + t$95$1 ^ 2], $MachinePrecision]]}, If[Less[b, 0.0], N[(c / N[(t$95$2 - N[(b / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / 2.0), $MachinePrecision] + t$95$2), $MachinePrecision] / (-a)), $MachinePrecision]]]]]

Reproduce

herbie shell --seed 2025037 
(FPCore (a b c)
  :name "quadm (p42, negative)"
  :precision binary64
  :herbie-expected 10

  :alt
  (! :herbie-platform default (let ((sqtD (let ((x (* (sqrt (fabs a)) (sqrt (fabs c))))) (if (== (copysign a c) a) (* (sqrt (- (fabs (/ b 2)) x)) (sqrt (+ (fabs (/ b 2)) x))) (hypot (/ b 2) x))))) (if (< b 0) (/ c (- sqtD (/ b 2))) (/ (+ (/ b 2) sqtD) (- a)))))

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