quad2p (problem 3.2.1, positive)

Percentage Accurate: 53.2% → 86.0%

Time: 5.8s

Alternatives: 8

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: 53.2% 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: 86.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.36e+100)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 2.9e-52)
     (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a)
     (/ (* c -0.5) b_2))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.36e+100) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 2.9e-52) {
		tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	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.36d+100)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= 2.9d-52) then
        tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
    else
        tmp = (c * (-0.5d0)) / b_2
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.36e+100) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 2.9e-52) {
		tmp = (-b_2 + Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.36e+100:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= 2.9e-52:
		tmp = (-b_2 + math.sqrt(((b_2 * b_2) - (a * c)))) / a
	else:
		tmp = (c * -0.5) / b_2
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.36e+100)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 2.9e-52)
		tmp = Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a);
	else
		tmp = Float64(Float64(c * -0.5) / b_2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.36e+100)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 2.9e-52)
		tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
	else
		tmp = (c * -0.5) / b_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -1.36e+100], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 2.9e-52], 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[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.35999999999999994e100

   1. Initial program 54.3%

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

   3. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 92.3

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

   5. Applied rewrites 92.3%

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

   if -1.35999999999999994e100 < b_2 < 2.9000000000000002e-52

   1. Initial program 84.1%

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

   if 2.9000000000000002e-52 < b_2

   1. Initial program 8.5%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 94.0

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

   5. Applied rewrites 94.0%

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

   7. Applied rewrites 94.0%

      \[\leadsto \frac{c \cdot -0.5}{\color{blue}{b\_2}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 89.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.36 \cdot 10^{+100}:\\ \;\;\;\;\frac{-2 \cdot b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 2.9 \cdot 10^{-52}:\\ \;\;\;\;\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b\_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 80.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -4.8e-61)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 2.1e-52)
     (/ (+ (- b_2) (sqrt (* (- c) a))) a)
     (/ (* c -0.5) b_2))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.8e-61) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 2.1e-52) {
		tmp = (-b_2 + sqrt((-c * a))) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	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.8d-61)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= 2.1d-52) then
        tmp = (-b_2 + sqrt((-c * a))) / a
    else
        tmp = (c * (-0.5d0)) / b_2
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.8e-61) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 2.1e-52) {
		tmp = (-b_2 + Math.sqrt((-c * a))) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -4.8e-61:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= 2.1e-52:
		tmp = (-b_2 + math.sqrt((-c * a))) / a
	else:
		tmp = (c * -0.5) / b_2
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -4.8e-61)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 2.1e-52)
		tmp = Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(-c) * a))) / a);
	else
		tmp = Float64(Float64(c * -0.5) / b_2);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -4.8e-61)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 2.1e-52)
		tmp = (-b_2 + sqrt((-c * a))) / a;
	else
		tmp = (c * -0.5) / b_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -4.8e-61], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 2.1e-52], N[(N[((-b$95$2) + N[Sqrt[N[((-c) * a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -4.8000000000000002e-61

   1. Initial program 70.1%

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

   3. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 88.3

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

   5. Applied rewrites 88.3%

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

   if -4.8000000000000002e-61 < b_2 < 2.0999999999999999e-52

   1. Initial program 80.0%

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

   3. Taylor expanded in a around inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      3. distribute-lft-neg-in N/A

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 75.5

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

   5. Applied rewrites 75.5%

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

   if 2.0999999999999999e-52 < b_2

   1. Initial program 8.5%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 94.0

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

   5. Applied rewrites 94.0%

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

   7. Applied rewrites 94.0%

      \[\leadsto \frac{c \cdot -0.5}{\color{blue}{b\_2}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 86.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -4.8 \cdot 10^{-61}:\\ \;\;\;\;\frac{-2 \cdot b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 2.1 \cdot 10^{-52}:\\ \;\;\;\;\frac{\left(-b\_2\right) + \sqrt{\left(-c\right) \cdot a}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b\_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 67.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \frac{c}{b\_2}, \frac{b\_2}{a} \cdot -2\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -5e-310)
   (fma 0.5 (/ c b_2) (* (/ b_2 a) -2.0))
   (/ (* c -0.5) b_2)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5e-310) {
		tmp = fma(0.5, (c / b_2), ((b_2 / a) * -2.0));
	} else {
		tmp = (c * -0.5) / b_2;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -4.999999999999985e-310

   1. Initial program 72.8%

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

   3. Taylor expanded in b_2 around -inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. unpow2 N/A

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

      7. associate-/r* N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. mul-1-neg N/A

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

      14. lower-neg.f64 69.2

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

   5. Applied rewrites 69.2%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 69.5%

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

   if -4.999999999999985e-310 < b_2

   1. Initial program 30.9%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 68.2

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

   5. Applied rewrites 68.2%

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

   7. Applied rewrites 68.2%

      \[\leadsto \frac{c \cdot -0.5}{\color{blue}{b\_2}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 68.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \frac{c}{b\_2}, \frac{b\_2}{a} \cdot -2\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b\_2}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 67.3% accurate, 1.7× speedup

Math

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

FPCore

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

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 6.5e-305) {
		tmp = (-2.0 * b_2) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	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 <= 6.5d-305) then
        tmp = ((-2.0d0) * b_2) / a
    else
        tmp = (c * (-0.5d0)) / b_2
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < 6.49999999999999991e-305

   1. Initial program 73.0%

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

   3. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 68.2

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

   5. Applied rewrites 68.2%

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

   if 6.49999999999999991e-305 < b_2

   1. Initial program 30.5%

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

   3. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 68.6

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

   5. Applied rewrites 68.6%

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

   7. Applied rewrites 68.6%

      \[\leadsto \frac{c \cdot -0.5}{\color{blue}{b\_2}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 68.5%

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

Alternative 5: 34.4% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \frac{c \cdot -0.5}{b\_2} \end{array} \]

FPCore

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

C

double code(double a, double b_2, double c) {
	return (c * -0.5) / b_2;
}

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.5d0)) / b_2
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 49.2%

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

3. Taylor expanded in a around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 39.3

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

5. Applied rewrites 39.3%

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

7. Applied rewrites 39.3%

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

8. Final simplification 39.3%

   \[\leadsto \frac{c \cdot -0.5}{b\_2} \]
9. Add Preprocessing

Alternative 6: 34.4% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \frac{c}{b\_2} \cdot -0.5 \end{array} \]

FPCore

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

C

double code(double a, double b_2, double c) {
	return (c / b_2) * -0.5;
}

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 / b_2) * (-0.5d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 49.2%

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

3. Taylor expanded in a around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 39.3

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

5. Applied rewrites 39.3%

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

6. Final simplification 39.3%

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

Alternative 7: 34.3% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \frac{-0.5}{b\_2} \cdot c \end{array} \]

FPCore

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

C

double code(double a, double b_2, double c) {
	return (-0.5 / b_2) * c;
}

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 = ((-0.5d0) / b_2) * c
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 49.2%

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

3. Taylor expanded in a around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 39.3

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

5. Applied rewrites 39.3%

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

7. Applied rewrites 39.3%

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

9. Applied rewrites 39.2%

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

10. Final simplification 39.2%

    \[\leadsto \frac{-0.5}{b\_2} \cdot c \]
11. Add Preprocessing

Alternative 8: 11.3% accurate, 40.0× speedup

Math

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

FPCore

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

C

double code(double a, double b_2, double c) {
	return 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 = 0.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 49.2%

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

3. Taylor expanded in a around inf

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

   3. distribute-lft-neg-in N/A

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 32.3

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

5. Applied rewrites 32.3%

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

   1. lift-/.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. div-add N/A

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

   4. frac-add N/A

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

   5. lower-/.f64 N/A

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

7. Applied rewrites 20.5%

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

8. Taylor expanded in a around 0

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

   1. distribute-rgt1-in N/A

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

   2. metadata-eval N/A

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

   3. mul0-lft N/A

      \[\leadsto \frac{\color{blue}{0}}{a} \]

   4. div0 12.5

      \[\leadsto \color{blue}{0} \]

10. Applied rewrites 12.5%

    \[\leadsto \color{blue}{0} \]
11. Add Preprocessing

Developer Target 1: 99.7% accurate, 0.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025010 
(FPCore (a b_2 c)
  :name "quad2p (problem 3.2.1, positive)"
  :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_2 0) (/ (- sqtD b_2) a) (/ (- c) (+ b_2 sqtD)))))

  (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))