quad2m (problem 3.2.1, negative)

Percentage Accurate: 52.1% → 85.3%

Time: 2.9s

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: 52.1% 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: 85.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -4.8e-57)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 2e+152)
     (/ (+ b_2 (sqrt (- (* b_2 b_2) (* a c)))) (- a))
     (fma (/ c b_2) 0.5 (* (/ b_2 a) -2.0)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.8e-57) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 2e+152) {
		tmp = (b_2 + sqrt(((b_2 * b_2) - (a * c)))) / -a;
	} else {
		tmp = fma((c / b_2), 0.5, ((b_2 / a) * -2.0));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -4.80000000000000012e-57

   1. Initial program 13.6%

      \[\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}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 88.2

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

   5. Applied rewrites 88.2%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot c}{b\_2} \]

      5. lower-/.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-*.f64 88.2

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

   7. Applied rewrites 88.2%

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

   if -4.80000000000000012e-57 < b_2 < 2.0000000000000001e152

   1. Initial program 85.7%

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

   if 2.0000000000000001e152 < b_2

   1. Initial program 34.3%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 94.9

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

   5. Applied rewrites 94.9%

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

4. Final simplification 87.9%

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

Alternative 2: 79.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.9 \cdot 10^{-139}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 4.8 \cdot 10^{-105}:\\ \;\;\;\;\frac{b\_2 + \sqrt{\left(-a\right) \cdot c}}{-a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{c}{b\_2}, 0.5, \frac{b\_2}{a} \cdot -2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.9e-139)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 4.8e-105)
     (/ (+ b_2 (sqrt (* (- a) c))) (- a))
     (fma (/ c b_2) 0.5 (* (/ b_2 a) -2.0)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.9e-139) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 4.8e-105) {
		tmp = (b_2 + sqrt((-a * c))) / -a;
	} else {
		tmp = fma((c / b_2), 0.5, ((b_2 / a) * -2.0));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.90000000000000004e-139

   1. Initial program 18.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 \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 83.4

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

   5. Applied rewrites 83.4%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot c}{b\_2} \]

      5. lower-/.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-*.f64 83.4

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

   7. Applied rewrites 83.4%

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

   if -1.90000000000000004e-139 < b_2 < 4.8000000000000003e-105

   1. Initial program 83.7%

      \[\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. 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 82.2

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

   5. Applied rewrites 82.2%

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

   if 4.8000000000000003e-105 < b_2

   1. Initial program 72.0%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 85.3

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

   5. Applied rewrites 85.3%

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

4. Final simplification 83.9%

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

Alternative 3: 79.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -4.8e-57)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 4.8e-105)
     (/ (- (sqrt (* (- a) c))) a)
     (fma (/ c b_2) 0.5 (* (/ b_2 a) -2.0)))))

C

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

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -4.8e-57)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= 4.8e-105)
		tmp = Float64(Float64(-sqrt(Float64(Float64(-a) * c))) / a);
	else
		tmp = fma(Float64(c / b_2), 0.5, Float64(Float64(b_2 / a) * -2.0));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -4.80000000000000012e-57

   1. Initial program 13.6%

      \[\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}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 88.2

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

   5. Applied rewrites 88.2%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot c}{b\_2} \]

      5. lower-/.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-*.f64 88.2

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

   7. Applied rewrites 88.2%

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

   if -4.80000000000000012e-57 < b_2 < 4.8000000000000003e-105

   1. Initial program 77.1%

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

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

   5. Applied rewrites 74.9%

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

   if 4.8000000000000003e-105 < b_2

   1. Initial program 72.0%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 85.3

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

   5. Applied rewrites 85.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{c}{b\_2}, 0.5, \frac{b\_2}{a} \cdot -2\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 79.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -4.8e-57)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 4.8e-105) (/ (- (sqrt (* (- a) c))) a) (/ (+ b_2 b_2) (- a)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.8e-57) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 4.8e-105) {
		tmp = -sqrt((-a * c)) / a;
	} else {
		tmp = (b_2 + 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 <= (-4.8d-57)) then
        tmp = ((-0.5d0) * c) / b_2
    else if (b_2 <= 4.8d-105) then
        tmp = -sqrt((-a * c)) / a
    else
        tmp = (b_2 + 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 <= -4.8e-57) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 4.8e-105) {
		tmp = -Math.sqrt((-a * c)) / a;
	} else {
		tmp = (b_2 + b_2) / -a;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -4.80000000000000012e-57

   1. Initial program 13.6%

      \[\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}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 88.2

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

   5. Applied rewrites 88.2%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot c}{b\_2} \]

      5. lower-/.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-*.f64 88.2

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

   7. Applied rewrites 88.2%

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

   if -4.80000000000000012e-57 < b_2 < 4.8000000000000003e-105

   1. Initial program 77.1%

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

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

   5. Applied rewrites 74.9%

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

   if 4.8000000000000003e-105 < b_2

   1. Initial program 72.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 0

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

   5. Applied rewrites 84.8%

      \[\leadsto \frac{\left(-b\_2\right) - \color{blue}{b\_2}}{a} \]
3. Recombined 3 regimes into one program.

4. Final simplification 83.6%

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

Alternative 5: 71.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.8 \cdot 10^{-185}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 3.5 \cdot 10^{-167}:\\ \;\;\;\;\sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2 + b\_2}{-a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -2.8e-185)
   (/ (* -0.5 c) b_2)
   (if (<= b_2 3.5e-167) (sqrt (* (/ c a) -1.0)) (/ (+ b_2 b_2) (- a)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2.8e-185) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 3.5e-167) {
		tmp = sqrt(((c / a) * -1.0));
	} else {
		tmp = (b_2 + 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 <= (-2.8d-185)) then
        tmp = ((-0.5d0) * c) / b_2
    else if (b_2 <= 3.5d-167) then
        tmp = sqrt(((c / a) * (-1.0d0)))
    else
        tmp = (b_2 + 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 <= -2.8e-185) {
		tmp = (-0.5 * c) / b_2;
	} else if (b_2 <= 3.5e-167) {
		tmp = Math.sqrt(((c / a) * -1.0));
	} else {
		tmp = (b_2 + b_2) / -a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -2.8e-185:
		tmp = (-0.5 * c) / b_2
	elif b_2 <= 3.5e-167:
		tmp = math.sqrt(((c / a) * -1.0))
	else:
		tmp = (b_2 + b_2) / -a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -2.8e-185)
		tmp = Float64(Float64(-0.5 * c) / b_2);
	elseif (b_2 <= 3.5e-167)
		tmp = sqrt(Float64(Float64(c / a) * -1.0));
	else
		tmp = Float64(Float64(b_2 + b_2) / Float64(-a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -2.8e-185)
		tmp = (-0.5 * c) / b_2;
	elseif (b_2 <= 3.5e-167)
		tmp = sqrt(((c / a) * -1.0));
	else
		tmp = (b_2 + b_2) / -a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -2.8e-185], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], If[LessEqual[b$95$2, 3.5e-167], N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision], N[(N[(b$95$2 + b$95$2), $MachinePrecision] / (-a)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -2.79999999999999991e-185

   1. Initial program 20.7%

      \[\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}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 80.9

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

   5. Applied rewrites 80.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot c}{b\_2} \]

      5. lower-/.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-*.f64 80.9

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

   7. Applied rewrites 80.9%

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

   if -2.79999999999999991e-185 < b_2 < 3.4999999999999999e-167

   1. Initial program 82.6%

      \[\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 \color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}} \]
   4. Step-by-step derivation

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 45.8

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

   5. Applied rewrites 45.8%

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

   if 3.4999999999999999e-167 < b_2

   1. Initial program 73.6%

      \[\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 \frac{\left(-b\_2\right) - \color{blue}{b\_2}}{a} \]
   4. Step-by-step derivation

   5. Applied rewrites 79.8%

      \[\leadsto \frac{\left(-b\_2\right) - \color{blue}{b\_2}}{a} \]
3. Recombined 3 regimes into one program.

4. Final simplification 75.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.8 \cdot 10^{-185}:\\ \;\;\;\;\frac{-0.5 \cdot c}{b\_2}\\ \mathbf{elif}\;b\_2 \leq 3.5 \cdot 10^{-167}:\\ \;\;\;\;\sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2 + b\_2}{-a}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 67.2% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -4.999999999999985e-310

   1. Initial program 29.9%

      \[\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}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 70.5

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

   5. Applied rewrites 70.5%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot c}{b\_2} \]

      5. lower-/.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-*.f64 70.6

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

   7. Applied rewrites 70.6%

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

   if -4.999999999999985e-310 < b_2

   1. Initial program 74.1%

      \[\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 \frac{\left(-b\_2\right) - \color{blue}{b\_2}}{a} \]
   4. Step-by-step derivation

   5. Applied rewrites 68.1%

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

4. Final simplification 69.4%

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

Alternative 7: 47.3% accurate, 1.7× speedup

Math

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

FPCore

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

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5e-310) {
		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 <= (-5d-310)) 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 <= -5e-310) {
		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 <= -5e-310:
		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 <= -5e-310)
		tmp = Float64(Float64(-0.5 * 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 <= -5e-310)
		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, -5e-310], N[(N[(-0.5 * c), $MachinePrecision] / b$95$2), $MachinePrecision], N[((-b$95$2) / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -4.999999999999985e-310

   1. Initial program 29.9%

      \[\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}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 70.5

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

   5. Applied rewrites 70.5%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. metadata-eval N/A

         \[\leadsto \frac{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot c}{b\_2} \]

      5. lower-/.f64 N/A

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

      6. metadata-eval N/A

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

      7. lower-*.f64 70.6

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

   7. Applied rewrites 70.6%

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

   if -4.999999999999985e-310 < b_2

   1. Initial program 74.1%

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

   3. Taylor expanded in c around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. sqrt-unprod N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 23.4

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

   5. Applied rewrites 23.4%

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

   6. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 24.2

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

   8. Applied rewrites 24.2%

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

Alternative 8: 47.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -5 \cdot 10^{-310}:\\ \;\;\;\;-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 -5e-310) (* -0.5 (/ c b_2)) (/ (- b_2) a)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5e-310) {
		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 <= (-5d-310)) 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 <= -5e-310) {
		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 <= -5e-310:
		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 <= -5e-310)
		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 <= -5e-310)
		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, -5e-310], 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 < -4.999999999999985e-310

   1. Initial program 29.9%

      \[\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}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 70.5

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

   5. Applied rewrites 70.5%

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

   if -4.999999999999985e-310 < b_2

   1. Initial program 74.1%

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

   3. Taylor expanded in c around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. sqrt-unprod N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 23.4

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

   5. Applied rewrites 23.4%

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

   6. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 24.2

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

   8. Applied rewrites 24.2%

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

Alternative 9: 22.8% accurate, 1.7× speedup

Math

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

FPCore

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

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -9500000.0) {
		tmp = (c / b_2) * 0.5;
	} 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 <= (-9500000.0d0)) then
        tmp = (c / b_2) * 0.5d0
    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 <= -9500000.0) {
		tmp = (c / b_2) * 0.5;
	} else {
		tmp = -b_2 / a;
	}
	return tmp;
}

Python

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

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -9500000.0)
		tmp = Float64(Float64(c / b_2) * 0.5);
	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 <= -9500000.0)
		tmp = (c / b_2) * 0.5;
	else
		tmp = -b_2 / a;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -9.5e6

   1. Initial program 10.2%

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

   3. Taylor expanded in c around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 2.4

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

   5. Applied rewrites 2.4%

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

   6. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 29.6

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

   8. Applied rewrites 29.6%

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

   if -9.5e6 < b_2

   1. Initial program 69.7%

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

   3. Taylor expanded in c around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. sqrt-unprod N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 24.3

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

   5. Applied rewrites 24.3%

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

   6. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 17.7

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

   8. Applied rewrites 17.7%

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

Alternative 10: 15.0% 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.1%

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

3. Taylor expanded in c around -inf

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

   1. associate-*r* N/A

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

   2. mul-1-neg N/A

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

   3. lower-*.f64 N/A

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

   4. lower-neg.f64 N/A

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

   5. lower--.f64 N/A

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

   6. lower-/.f64 N/A

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

   7. sqrt-unprod N/A

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

   8. lower-sqrt.f64 N/A

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

   9. lower-*.f64 N/A

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

   10. lower-/.f64 18.1

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

5. Applied rewrites 18.1%

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

6. Taylor expanded in b_2 around inf

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

   1. mul-1-neg N/A

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

   2. lift-neg.f64 12.9

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

8. Applied rewrites 12.9%

   \[\leadsto \frac{-b\_2}{a} \]
9. 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{c}{t\_1 - b\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2 + t\_1}{-a}\\ \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) (/ c (- t_1 b_2)) (/ (+ b_2 t_1) (- a)))))

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 = c / (t_1 - b_2);
	} else {
		tmp_1 = (b_2 + t_1) / -a;
	}
	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 = c / (t_1 - b_2);
	} else {
		tmp_1 = (b_2 + t_1) / -a;
	}
	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 = c / (t_1 - b_2)
	else:
		tmp_1 = (b_2 + t_1) / -a
	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(c / Float64(t_1 - b_2));
	else
		tmp_1 = Float64(Float64(b_2 + t_1) / Float64(-a));
	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 = c / (t_1 - b_2);
	else
		tmp_2 = (b_2 + t_1) / -a;
	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[(c / N[(t$95$1 - b$95$2), $MachinePrecision]), $MachinePrecision], N[(N[(b$95$2 + t$95$1), $MachinePrecision] / (-a)), $MachinePrecision]]]]

Reproduce

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

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

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