quad2m (problem 3.2.1, negative)

Percentage Accurate: 51.5% → 84.8%

Time: 3.8s

Alternatives: 10

Speedup: 1.7×

Specification

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

C

double code(double a, double b_2, double c) {
	return (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / 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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a
end function

Java

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

Python

def code(a, b_2, c):
	return (-b_2 - math.sqrt(((b_2 * b_2) - (a * c)))) / a

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) - sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a;
end

Wolfram

code[a_, b$95$2_, c_] := N[(N[((-b$95$2) - N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

Initial Program: 51.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

C

double code(double a, double b_2, double c) {
	return (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / 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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a
end function

Java

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

Python

def code(a, b_2, c):
	return (-b_2 - math.sqrt(((b_2 * b_2) - (a * c)))) / a

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) - sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a;
end

Wolfram

code[a_, b$95$2_, c_] := N[(N[((-b$95$2) - N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

Alternative 1: 84.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -4.2 \cdot 10^{-63}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 5 \cdot 10^{+64}:\\ \;\;\;\;\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2}{a} \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -4.2e-63)
   (* -0.5 (/ c b_2))
   (if (<= b_2 5e+64)
     (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a)
     (* (/ b_2 a) -2.0))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.2e-63) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 5e+64) {
		tmp = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a;
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-4.2d-63)) then
        tmp = (-0.5d0) * (c / b_2)
    else if (b_2 <= 5d+64) then
        tmp = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a
    else
        tmp = (b_2 / a) * (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.2e-63) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 5e+64) {
		tmp = (-b_2 - Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -4.2e-63:
		tmp = -0.5 * (c / b_2)
	elif b_2 <= 5e+64:
		tmp = (-b_2 - math.sqrt(((b_2 * b_2) - (a * c)))) / a
	else:
		tmp = (b_2 / a) * -2.0
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -4.2e-63)
		tmp = Float64(-0.5 * Float64(c / b_2));
	elseif (b_2 <= 5e+64)
		tmp = Float64(Float64(Float64(-b_2) - sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a);
	else
		tmp = Float64(Float64(b_2 / a) * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -4.2e-63)
		tmp = -0.5 * (c / b_2);
	elseif (b_2 <= 5e+64)
		tmp = (-b_2 - sqrt(((b_2 * b_2) - (a * c)))) / a;
	else
		tmp = (b_2 / a) * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -4.2e-63], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 5e+64], N[(N[((-b$95$2) - N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(b$95$2 / a), $MachinePrecision] * -2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -4.2e-63

   1. Initial program 16.9%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 86.3

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

   4. Applied rewrites 86.3%

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

   if -4.2e-63 < b_2 < 5e64

   1. Initial program 77.7%

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

   if 5e64 < b_2

   1. Initial program 58.1%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 94.6

         \[\leadsto \frac{b\_2}{a} \cdot -2 \]

   4. Applied rewrites 94.6%

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

Alternative 2: 80.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -4.2 \cdot 10^{-63}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 7 \cdot 10^{+22}:\\ \;\;\;\;\frac{\left(-b\_2\right) - \sqrt{\left(-a\right) \cdot c}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2}{a} \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -4.2e-63)
   (* -0.5 (/ c b_2))
   (if (<= b_2 7e+22)
     (/ (- (- b_2) (sqrt (* (- a) c))) a)
     (* (/ b_2 a) -2.0))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.2e-63) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 7e+22) {
		tmp = (-b_2 - sqrt((-a * c))) / a;
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-4.2d-63)) then
        tmp = (-0.5d0) * (c / b_2)
    else if (b_2 <= 7d+22) then
        tmp = (-b_2 - sqrt((-a * c))) / a
    else
        tmp = (b_2 / a) * (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.2e-63) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 7e+22) {
		tmp = (-b_2 - Math.sqrt((-a * c))) / a;
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -4.2e-63:
		tmp = -0.5 * (c / b_2)
	elif b_2 <= 7e+22:
		tmp = (-b_2 - math.sqrt((-a * c))) / a
	else:
		tmp = (b_2 / a) * -2.0
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -4.2e-63)
		tmp = Float64(-0.5 * Float64(c / b_2));
	elseif (b_2 <= 7e+22)
		tmp = Float64(Float64(Float64(-b_2) - sqrt(Float64(Float64(-a) * c))) / a);
	else
		tmp = Float64(Float64(b_2 / a) * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -4.2e-63)
		tmp = -0.5 * (c / b_2);
	elseif (b_2 <= 7e+22)
		tmp = (-b_2 - sqrt((-a * c))) / a;
	else
		tmp = (b_2 / a) * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -4.2e-63], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 7e+22], N[(N[((-b$95$2) - N[Sqrt[N[((-a) * c), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(b$95$2 / a), $MachinePrecision] * -2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -4.2e-63

   1. Initial program 16.9%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 86.3

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

   4. Applied rewrites 86.3%

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

   if -4.2e-63 < b_2 < 7e22

   1. Initial program 76.3%

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

   2. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 62.2

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

   4. Applied rewrites 62.2%

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

   if 7e22 < b_2

   1. Initial program 62.7%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 92.3

         \[\leadsto \frac{b\_2}{a} \cdot -2 \]

   4. Applied rewrites 92.3%

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

Alternative 3: 79.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -4.2 \cdot 10^{-63}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 8.6 \cdot 10^{-58}:\\ \;\;\;\;\frac{-\sqrt{\left(-a\right) \cdot c}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2}{a} \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -4.2e-63)
   (* -0.5 (/ c b_2))
   (if (<= b_2 8.6e-58) (/ (- (sqrt (* (- a) c))) a) (* (/ b_2 a) -2.0))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.2e-63) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 8.6e-58) {
		tmp = -sqrt((-a * c)) / a;
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-4.2d-63)) then
        tmp = (-0.5d0) * (c / b_2)
    else if (b_2 <= 8.6d-58) then
        tmp = -sqrt((-a * c)) / a
    else
        tmp = (b_2 / a) * (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.2e-63) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 8.6e-58) {
		tmp = -Math.sqrt((-a * c)) / a;
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -4.2e-63:
		tmp = -0.5 * (c / b_2)
	elif b_2 <= 8.6e-58:
		tmp = -math.sqrt((-a * c)) / a
	else:
		tmp = (b_2 / a) * -2.0
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -4.2e-63)
		tmp = Float64(-0.5 * Float64(c / b_2));
	elseif (b_2 <= 8.6e-58)
		tmp = Float64(Float64(-sqrt(Float64(Float64(-a) * c))) / a);
	else
		tmp = Float64(Float64(b_2 / a) * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -4.2e-63)
		tmp = -0.5 * (c / b_2);
	elseif (b_2 <= 8.6e-58)
		tmp = -sqrt((-a * c)) / a;
	else
		tmp = (b_2 / a) * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -4.2e-63], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 8.6e-58], N[((-N[Sqrt[N[((-a) * c), $MachinePrecision]], $MachinePrecision]) / a), $MachinePrecision], N[(N[(b$95$2 / a), $MachinePrecision] * -2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -4.2e-63

   1. Initial program 16.9%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 86.3

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

   4. Applied rewrites 86.3%

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

   if -4.2e-63 < b_2 < 8.5999999999999999e-58

   1. Initial program 73.4%

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

   2. Taylor expanded in a around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. *-commutative N/A

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

      5. lower-sqrt.f64 N/A

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

      6. associate-*r* N/A

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

      7. mul-1-neg N/A

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

      8. lower-*.f64 N/A

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

      9. lower-neg.f64 65.3

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

   4. Applied rewrites 65.3%

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

   if 8.5999999999999999e-58 < b_2

   1. Initial program 67.9%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 87.0

         \[\leadsto \frac{b\_2}{a} \cdot -2 \]

   4. Applied rewrites 87.0%

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

Alternative 4: 69.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\frac{-c}{a}}\\ \mathbf{if}\;b\_2 \leq -1.5 \cdot 10^{-64}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq -5.4 \cdot 10^{-177}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b\_2 \leq 1.85 \cdot 10^{-286}:\\ \;\;\;\;-t\_0\\ \mathbf{elif}\;b\_2 \leq 3.5 \cdot 10^{-55}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2}{a} \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (let* ((t_0 (sqrt (/ (- c) a))))
   (if (<= b_2 -1.5e-64)
     (* -0.5 (/ c b_2))
     (if (<= b_2 -5.4e-177)
       t_0
       (if (<= b_2 1.85e-286)
         (- t_0)
         (if (<= b_2 3.5e-55) t_0 (* (/ b_2 a) -2.0)))))))

C

double code(double a, double b_2, double c) {
	double t_0 = sqrt((-c / a));
	double tmp;
	if (b_2 <= -1.5e-64) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= -5.4e-177) {
		tmp = t_0;
	} else if (b_2 <= 1.85e-286) {
		tmp = -t_0;
	} else if (b_2 <= 3.5e-55) {
		tmp = t_0;
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((-c / a))
    if (b_2 <= (-1.5d-64)) then
        tmp = (-0.5d0) * (c / b_2)
    else if (b_2 <= (-5.4d-177)) then
        tmp = t_0
    else if (b_2 <= 1.85d-286) then
        tmp = -t_0
    else if (b_2 <= 3.5d-55) then
        tmp = t_0
    else
        tmp = (b_2 / a) * (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double t_0 = Math.sqrt((-c / a));
	double tmp;
	if (b_2 <= -1.5e-64) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= -5.4e-177) {
		tmp = t_0;
	} else if (b_2 <= 1.85e-286) {
		tmp = -t_0;
	} else if (b_2 <= 3.5e-55) {
		tmp = t_0;
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	t_0 = math.sqrt((-c / a))
	tmp = 0
	if b_2 <= -1.5e-64:
		tmp = -0.5 * (c / b_2)
	elif b_2 <= -5.4e-177:
		tmp = t_0
	elif b_2 <= 1.85e-286:
		tmp = -t_0
	elif b_2 <= 3.5e-55:
		tmp = t_0
	else:
		tmp = (b_2 / a) * -2.0
	return tmp

Julia

function code(a, b_2, c)
	t_0 = sqrt(Float64(Float64(-c) / a))
	tmp = 0.0
	if (b_2 <= -1.5e-64)
		tmp = Float64(-0.5 * Float64(c / b_2));
	elseif (b_2 <= -5.4e-177)
		tmp = t_0;
	elseif (b_2 <= 1.85e-286)
		tmp = Float64(-t_0);
	elseif (b_2 <= 3.5e-55)
		tmp = t_0;
	else
		tmp = Float64(Float64(b_2 / a) * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	t_0 = sqrt((-c / a));
	tmp = 0.0;
	if (b_2 <= -1.5e-64)
		tmp = -0.5 * (c / b_2);
	elseif (b_2 <= -5.4e-177)
		tmp = t_0;
	elseif (b_2 <= 1.85e-286)
		tmp = -t_0;
	elseif (b_2 <= 3.5e-55)
		tmp = t_0;
	else
		tmp = (b_2 / a) * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := Block[{t$95$0 = N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b$95$2, -1.5e-64], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, -5.4e-177], t$95$0, If[LessEqual[b$95$2, 1.85e-286], (-t$95$0), If[LessEqual[b$95$2, 3.5e-55], t$95$0, N[(N[(b$95$2 / a), $MachinePrecision] * -2.0), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if b_2 < -1.5e-64

   1. Initial program 17.0%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 86.3

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

   4. Applied rewrites 86.3%

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

   if -1.5e-64 < b_2 < -5.4000000000000004e-177 or 1.85e-286 < b_2 < 3.50000000000000025e-55

   1. Initial program 73.8%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{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 28.5

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

   4. Applied rewrites 28.5%

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

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 28.5

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

   6. Applied rewrites 28.5%

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

   if -5.4000000000000004e-177 < b_2 < 1.85e-286

   1. Initial program 72.5%

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

   2. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 72.5

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

   4. Applied rewrites 72.5%

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

   5. Taylor expanded in a around inf

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

      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. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower-neg.f64 40.5

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

   7. Applied rewrites 40.5%

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

   if 3.50000000000000025e-55 < b_2

   1. Initial program 67.8%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 87.2

         \[\leadsto \frac{b\_2}{a} \cdot -2 \]

   4. Applied rewrites 87.2%

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

Alternative 5: 68.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.5 \cdot 10^{-64}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 3.5 \cdot 10^{-55}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2}{a} \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.5e-64)
   (* -0.5 (/ c b_2))
   (if (<= b_2 3.5e-55) (sqrt (/ (- c) a)) (* (/ b_2 a) -2.0))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.5e-64) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 3.5e-55) {
		tmp = sqrt((-c / a));
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-1.5d-64)) then
        tmp = (-0.5d0) * (c / b_2)
    else if (b_2 <= 3.5d-55) then
        tmp = sqrt((-c / a))
    else
        tmp = (b_2 / a) * (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.5e-64) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 3.5e-55) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.5e-64:
		tmp = -0.5 * (c / b_2)
	elif b_2 <= 3.5e-55:
		tmp = math.sqrt((-c / a))
	else:
		tmp = (b_2 / a) * -2.0
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.5e-64)
		tmp = Float64(-0.5 * Float64(c / b_2));
	elseif (b_2 <= 3.5e-55)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(b_2 / a) * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.5e-64)
		tmp = -0.5 * (c / b_2);
	elseif (b_2 <= 3.5e-55)
		tmp = sqrt((-c / a));
	else
		tmp = (b_2 / a) * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -1.5e-64], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 3.5e-55], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(b$95$2 / a), $MachinePrecision] * -2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.5e-64

   1. Initial program 17.0%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 86.3

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

   4. Applied rewrites 86.3%

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

   if -1.5e-64 < b_2 < 3.50000000000000025e-55

   1. Initial program 73.4%

      \[\frac{\left(-b\_2\right) - \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{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 30.1

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

   4. Applied rewrites 30.1%

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

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 30.1

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

   6. Applied rewrites 30.1%

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

   if 3.50000000000000025e-55 < b_2

   1. Initial program 67.8%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 87.2

         \[\leadsto \frac{b\_2}{a} \cdot -2 \]

   4. Applied rewrites 87.2%

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

Alternative 6: 66.4% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -2e-311) (* -0.5 (/ c b_2)) (* (/ b_2 a) -2.0)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2e-311) {
		tmp = -0.5 * (c / b_2);
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-2d-311)) then
        tmp = (-0.5d0) * (c / b_2)
    else
        tmp = (b_2 / a) * (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2e-311) {
		tmp = -0.5 * (c / b_2);
	} else {
		tmp = (b_2 / a) * -2.0;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -2e-311:
		tmp = -0.5 * (c / b_2)
	else:
		tmp = (b_2 / a) * -2.0
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -2e-311)
		tmp = Float64(-0.5 * Float64(c / b_2));
	else
		tmp = Float64(Float64(b_2 / a) * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -2e-311)
		tmp = -0.5 * (c / b_2);
	else
		tmp = (b_2 / a) * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -2e-311], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision], N[(N[(b$95$2 / a), $MachinePrecision] * -2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -1.9999999999999e-311

   1. Initial program 31.8%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 66.9

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

   4. Applied rewrites 66.9%

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

   if -1.9999999999999e-311 < b_2

   1. Initial program 72.0%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 65.9

         \[\leadsto \frac{b\_2}{a} \cdot -2 \]

   4. Applied rewrites 65.9%

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

Alternative 7: 47.2% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -2e-311) (* -0.5 (/ c b_2)) (/ (- b_2) a)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2e-311) {
		tmp = -0.5 * (c / b_2);
	} else {
		tmp = -b_2 / 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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-2d-311)) then
        tmp = (-0.5d0) * (c / b_2)
    else
        tmp = -b_2 / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2e-311) {
		tmp = -0.5 * (c / b_2);
	} else {
		tmp = -b_2 / a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -2e-311:
		tmp = -0.5 * (c / b_2)
	else:
		tmp = -b_2 / a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -2e-311)
		tmp = Float64(-0.5 * Float64(c / b_2));
	else
		tmp = Float64(Float64(-b_2) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -2e-311)
		tmp = -0.5 * (c / b_2);
	else
		tmp = -b_2 / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -2e-311], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision], N[((-b$95$2) / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -1.9999999999999e-311

   1. Initial program 31.8%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 66.9

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

   4. Applied rewrites 66.9%

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

   if -1.9999999999999e-311 < b_2

   1. Initial program 72.0%

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

   2. Taylor expanded in a around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. sqrt-unprod N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 24.6

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

   4. Applied rewrites 24.6%

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

   5. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 26.8

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

   7. Applied rewrites 26.8%

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

Alternative 8: 14.6% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \frac{-b\_2}{a} \end{array} \]

FPCore

(FPCore (a b_2 c) :precision binary64 (/ (- b_2) a))

C

double code(double a, double b_2, double c) {
	return -b_2 / 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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = -b_2 / a
end function

Java

public static double code(double a, double b_2, double c) {
	return -b_2 / a;
}

Python

def code(a, b_2, c):
	return -b_2 / a

Julia

function code(a, b_2, c)
	return Float64(Float64(-b_2) / a)
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = -b_2 / a;
end

Wolfram

code[a_, b$95$2_, c_] := N[((-b$95$2) / a), $MachinePrecision]

Derivation

1. Initial program 51.5%

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

2. Taylor expanded in a around -inf

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

   1. associate-*r* N/A

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

   2. mul-1-neg N/A

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

   3. lower-*.f64 N/A

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

   4. lower-neg.f64 N/A

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

   5. lower--.f64 N/A

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

   6. lower-/.f64 N/A

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

   7. sqrt-unprod N/A

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

   8. lower-sqrt.f64 N/A

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

   9. lower-*.f64 N/A

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

   10. lower-/.f64 18.9

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

4. Applied rewrites 18.9%

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

5. Taylor expanded in b_2 around inf

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

   1. mul-1-neg N/A

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

   2. lift-neg.f64 14.6

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

7. Applied rewrites 14.6%

   \[\leadsto \frac{-b\_2}{a} \]
8. Add Preprocessing

Alternative 9: 6.4% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \frac{c}{0} \end{array} \]

FPCore

(FPCore (a b_2 c) :precision binary64 (/ c 0.0))

C

double code(double a, double b_2, double c) {
	return c / 0.0;
}

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_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = c / 0.0d0
end function

Java

public static double code(double a, double b_2, double c) {
	return c / 0.0;
}

Python

def code(a, b_2, c):
	return c / 0.0

Julia

function code(a, b_2, c)
	return Float64(c / 0.0)
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = c / 0.0;
end

Wolfram

code[a_, b$95$2_, c_] := N[(c / 0.0), $MachinePrecision]

Derivation

1. Initial program 51.5%

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

2. Taylor expanded in a around inf

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

   1. associate-*r* N/A

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

   2. mul-1-neg N/A

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

   3. lower-*.f64 N/A

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

   4. lower-neg.f64 33.9

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

4. Applied rewrites 33.9%

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

   1. lift-neg.f64 N/A

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

   2. lift--.f64 N/A

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

   3. flip-- N/A

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

   4. lower-/.f64 N/A

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

6. Applied rewrites 32.9%

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

7. Taylor expanded in a around 0

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

   1. sqr-neg-rev N/A

      \[\leadsto \frac{c}{b\_2 + -1 \cdot b\_2} \]

   2. mul-1-neg N/A

      \[\leadsto \frac{c}{b\_2 + -1 \cdot b\_2} \]

   3. flip-- N/A

      \[\leadsto \frac{c}{b\_2 + -1 \cdot b\_2} \]

   4. lower-/.f64 N/A

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

   5. distribute-rgt1-in N/A

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

   6. metadata-eval N/A

      \[\leadsto \frac{c}{0 \cdot b\_2} \]

   7. lower-*.f64 5.5

      \[\leadsto \frac{c}{0 \cdot \color{blue}{b\_2}} \]

9. Applied rewrites 5.5%

   \[\leadsto \color{blue}{\frac{c}{0 \cdot b\_2}} \]

10. Taylor expanded in b_2 around 0

    \[\leadsto \frac{c}{0} \]
11. Step-by-step derivation

12. Applied rewrites 6.4%

    \[\leadsto \frac{c}{0} \]
13. Add Preprocessing

Alternative 10: 0.0% accurate, 40.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{NaN} \end{array} \]

FPCore

(FPCore (a b_2 c) :precision binary64 NAN)

C

double code(double a, double b_2, double c) {
	return (double) NAN;
}

Java

public static double code(double a, double b_2, double c) {
	return Double.NaN;
}

Python

def code(a, b_2, c):
	return math.nan

Julia

function code(a, b_2, c)
	return NaN
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = NaN;
end

Wolfram

code[a_, b$95$2_, c_] := Indeterminate

Derivation

1. Initial program 51.5%

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

2. Taylor expanded in a around inf

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

   1. associate-*r* N/A

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

   2. mul-1-neg N/A

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

   3. lower-*.f64 N/A

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

   4. lower-neg.f64 33.9

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

4. Applied rewrites 33.9%

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

   1. lift-neg.f64 N/A

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

   2. lift--.f64 N/A

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

   3. flip-- N/A

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

   4. lower-/.f64 N/A

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

6. Applied rewrites 32.9%

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

7. Taylor expanded in a around 0

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

   1. sqr-neg-rev N/A

      \[\leadsto \frac{c}{b\_2 + -1 \cdot b\_2} \]

   2. mul-1-neg N/A

      \[\leadsto \frac{c}{b\_2 + -1 \cdot b\_2} \]

   3. flip-- N/A

      \[\leadsto \frac{c}{b\_2 + -1 \cdot b\_2} \]

   4. lower-/.f64 N/A

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

   5. distribute-rgt1-in N/A

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

   6. metadata-eval N/A

      \[\leadsto \frac{c}{0 \cdot b\_2} \]

   7. lower-*.f64 5.5

      \[\leadsto \frac{c}{0 \cdot \color{blue}{b\_2}} \]

9. Applied rewrites 5.5%

   \[\leadsto \color{blue}{\frac{c}{0 \cdot b\_2}} \]

10. Taylor expanded in b_2 around 0

    \[\leadsto \mathsf{NAN}\left(\right) \]
11. Step-by-step derivation

    1. lower-NAN.f64 0.0

       \[\leadsto \mathsf{NaN} \]

12. Applied rewrites 0.0%

    \[\leadsto \mathsf{NaN} \]
13. Add Preprocessing

Reproduce

herbie shell --seed 2025101 
(FPCore (a b_2 c)
  :name "quad2m (problem 3.2.1, negative)"
  :precision binary64
  :herbie-expected 10
  (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))