quad2p (problem 3.2.1, positive)

Percentage Accurate: 51.3% → 85.0%

Time: 3.8s

Alternatives: 11

Speedup: 1.7×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 51.3% 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.0% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.15e+115)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 4.5e-50)
     (+ (/ (- b_2) a) (/ (sqrt (fma (- a) c (* b_2 b_2))) a))
     (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.15e+115) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 4.5e-50) {
		tmp = (-b_2 / a) + (sqrt(fma(-a, c, (b_2 * b_2))) / a);
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.15e+115)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 4.5e-50)
		tmp = Float64(Float64(Float64(-b_2) / a) + Float64(sqrt(fma(Float64(-a), c, Float64(b_2 * b_2))) / a));
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.15000000000000002e115

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

      1. lower-*.f64 96.3

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

   5. Applied rewrites 96.3%

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

   if -1.15000000000000002e115 < b_2 < 4.49999999999999962e-50

   1. Initial program 78.8%

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

      1. lift-/.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. div-add N/A

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

      9. mul-1-neg N/A

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

      10. associate-*r/ N/A

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

      11. lower-+.f64 N/A

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

      12. associate-*r/ N/A

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

      13. mul-1-neg N/A

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

      14. lower-/.f64 N/A

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

      15. lift-neg.f64 N/A

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

      16. lower-/.f64 N/A

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

   4. Applied rewrites 78.8%

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

   if 4.49999999999999962e-50 < b_2

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 86.7

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

   5. Applied rewrites 86.7%

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

Alternative 2: 85.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.15e+115)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 4.5e-50)
     (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a)
     (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.15e+115) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 4.5e-50) {
		tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	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.15d+115)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= 4.5d-50) then
        tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.15e+115) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 4.5e-50) {
		tmp = (-b_2 + Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.15e+115:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= 4.5e-50:
		tmp = (-b_2 + math.sqrt(((b_2 * b_2) - (a * c)))) / a
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.15e+115)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 4.5e-50)
		tmp = Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a);
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.15e+115)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 4.5e-50)
		tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
	else
		tmp = (c / b_2) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -1.15e+115], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 4.5e-50], 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), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.15000000000000002e115

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

      1. lower-*.f64 96.3

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

   5. Applied rewrites 96.3%

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

   if -1.15000000000000002e115 < b_2 < 4.49999999999999962e-50

   1. Initial program 78.8%

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

   if 4.49999999999999962e-50 < b_2

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 86.7

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

   5. Applied rewrites 86.7%

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

Alternative 3: 80.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -5.9e-114)
   (/ (fma (* (/ c b_2) a) 0.5 (* -2.0 b_2)) a)
   (if (<= b_2 4.5e-50)
     (/ (+ (- b_2) (sqrt (* (- a) c))) a)
     (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5.9e-114) {
		tmp = fma(((c / b_2) * a), 0.5, (-2.0 * b_2)) / a;
	} else if (b_2 <= 4.5e-50) {
		tmp = (-b_2 + sqrt((-a * c))) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -5.9e-114)
		tmp = Float64(fma(Float64(Float64(c / b_2) * a), 0.5, Float64(-2.0 * b_2)) / a);
	elseif (b_2 <= 4.5e-50)
		tmp = Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(-a) * c))) / a);
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -5.9000000000000001e-114

   1. Initial program 69.5%

      \[\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}{-1 \cdot \left(b\_2 \cdot \left(2 + \frac{-1}{2} \cdot \frac{a \cdot c}{{b\_2}^{2}}\right)\right)}}{a} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. pow2 N/A

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

      12. lift-*.f64 83.0

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

   5. Applied rewrites 83.0%

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

   6. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lift-/.f64 N/A

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

      8. lower-*.f64 83.1

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

   8. Applied rewrites 83.1%

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

   if -5.9000000000000001e-114 < b_2 < 4.49999999999999962e-50

   1. Initial program 70.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. 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 67.3

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

   5. Applied rewrites 67.3%

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

   if 4.49999999999999962e-50 < b_2

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 86.7

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

   5. Applied rewrites 86.7%

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

Alternative 4: 79.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -5.9e-114)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 4.5e-50)
     (/ (+ (- b_2) (sqrt (* (- a) c))) a)
     (* (/ c b_2) -0.5))))

C

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

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5.9e-114) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 4.5e-50) {
		tmp = (-b_2 + Math.sqrt((-a * c))) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -5.9e-114:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= 4.5e-50:
		tmp = (-b_2 + math.sqrt((-a * c))) / a
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -5.9e-114)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 4.5e-50)
		tmp = Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(-a) * c))) / a);
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -5.9e-114)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 4.5e-50)
		tmp = (-b_2 + sqrt((-a * c))) / a;
	else
		tmp = (c / b_2) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -5.9000000000000001e-114

   1. Initial program 69.5%

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

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

   5. Applied rewrites 82.7%

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

   if -5.9000000000000001e-114 < b_2 < 4.49999999999999962e-50

   1. Initial program 70.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. 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 67.3

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

   5. Applied rewrites 67.3%

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

   if 4.49999999999999962e-50 < b_2

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 86.7

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

   5. Applied rewrites 86.7%

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

Alternative 5: 71.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\frac{-c}{a}}\\ \mathbf{if}\;b\_2 \leq -5.5 \cdot 10^{-167}:\\ \;\;\;\;\frac{-2 \cdot b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq -7 \cdot 10^{-247}:\\ \;\;\;\;-t\_0\\ \mathbf{elif}\;b\_2 \leq 1.45 \cdot 10^{-133}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b\_2} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (let* ((t_0 (sqrt (/ (- c) a))))
   (if (<= b_2 -5.5e-167)
     (/ (* -2.0 b_2) a)
     (if (<= b_2 -7e-247)
       (- t_0)
       (if (<= b_2 1.45e-133) t_0 (* (/ c b_2) -0.5))))))

C

double code(double a, double b_2, double c) {
	double t_0 = sqrt((-c / a));
	double tmp;
	if (b_2 <= -5.5e-167) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= -7e-247) {
		tmp = -t_0;
	} else if (b_2 <= 1.45e-133) {
		tmp = t_0;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((-c / a))
    if (b_2 <= (-5.5d-167)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= (-7d-247)) then
        tmp = -t_0
    else if (b_2 <= 1.45d-133) then
        tmp = t_0
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double t_0 = Math.sqrt((-c / a));
	double tmp;
	if (b_2 <= -5.5e-167) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= -7e-247) {
		tmp = -t_0;
	} else if (b_2 <= 1.45e-133) {
		tmp = t_0;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	t_0 = math.sqrt((-c / a))
	tmp = 0
	if b_2 <= -5.5e-167:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= -7e-247:
		tmp = -t_0
	elif b_2 <= 1.45e-133:
		tmp = t_0
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

function code(a, b_2, c)
	t_0 = sqrt(Float64(Float64(-c) / a))
	tmp = 0.0
	if (b_2 <= -5.5e-167)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= -7e-247)
		tmp = Float64(-t_0);
	elseif (b_2 <= 1.45e-133)
		tmp = t_0;
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	t_0 = sqrt((-c / a));
	tmp = 0.0;
	if (b_2 <= -5.5e-167)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= -7e-247)
		tmp = -t_0;
	elseif (b_2 <= 1.45e-133)
		tmp = t_0;
	else
		tmp = (c / b_2) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := Block[{t$95$0 = N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b$95$2, -5.5e-167], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, -7e-247], (-t$95$0), If[LessEqual[b$95$2, 1.45e-133], t$95$0, N[(N[(c / b$95$2), $MachinePrecision] * -0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if b_2 < -5.5000000000000003e-167

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

      1. lower-*.f64 78.2

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

   5. Applied rewrites 78.2%

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

   if -5.5000000000000003e-167 < b_2 < -6.9999999999999998e-247

   1. Initial program 77.0%

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

      1. lift-/.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. div-add N/A

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

      9. mul-1-neg N/A

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

      10. associate-*r/ N/A

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

      11. lower-+.f64 N/A

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

      12. associate-*r/ N/A

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

      13. mul-1-neg N/A

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

      14. lower-/.f64 N/A

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

      15. lift-neg.f64 N/A

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

      16. lower-/.f64 N/A

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

   4. Applied rewrites 77.0%

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

   5. Taylor expanded in a around -inf

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

      1. div-add-rev N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lift-neg.f64 N/A

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

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

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

      9. pow2 N/A

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

      10. mul-1-neg N/A

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

      11. lower-neg.f64 N/A

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

      12. sqrt-prod N/A

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

      13. lower-sqrt.f64 N/A

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

      14. *-commutative N/A

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

      15. associate-*r/ N/A

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

      16. mul-1-neg N/A

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

   7. Applied rewrites 31.3%

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

   if -6.9999999999999998e-247 < b_2 < 1.4499999999999999e-133

   1. Initial program 71.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 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 38.5

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

   5. Applied rewrites 38.5%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 38.5

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

   7. Applied rewrites 38.5%

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

   if 1.4499999999999999e-133 < b_2

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 80.4

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

   5. Applied rewrites 80.4%

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

Alternative 6: 79.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -5.9e-114)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 4.5e-50) (/ (sqrt (* (- a) c)) a) (* (/ c b_2) -0.5))))

C

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

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5.9e-114) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 4.5e-50) {
		tmp = Math.sqrt((-a * c)) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -5.9e-114:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= 4.5e-50:
		tmp = math.sqrt((-a * c)) / a
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -5.9e-114)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 4.5e-50)
		tmp = Float64(sqrt(Float64(Float64(-a) * c)) / a);
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -5.9e-114)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 4.5e-50)
		tmp = sqrt((-a * c)) / a;
	else
		tmp = (c / b_2) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -5.9000000000000001e-114

   1. Initial program 69.5%

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

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

   5. Applied rewrites 82.7%

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

   if -5.9000000000000001e-114 < b_2 < 4.49999999999999962e-50

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

      1. sqrt-unprod N/A

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

      2. *-commutative N/A

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

      3. lower-sqrt.f64 N/A

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

      4. associate-*r* N/A

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

      5. mul-1-neg N/A

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

      6. lower-*.f64 N/A

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

      7. lower-neg.f64 66.5

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

   5. Applied rewrites 66.5%

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

   if 4.49999999999999962e-50 < b_2

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 86.7

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

   5. Applied rewrites 86.7%

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

Alternative 7: 71.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -6.4 \cdot 10^{-239}:\\ \;\;\;\;\frac{-2 \cdot b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 1.45 \cdot 10^{-133}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b\_2} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -6.4e-239)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 1.45e-133) (sqrt (/ (- c) a)) (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -6.4e-239) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 1.45e-133) {
		tmp = sqrt((-c / a));
	} else {
		tmp = (c / b_2) * -0.5;
	}
	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.4d-239)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= 1.45d-133) then
        tmp = sqrt((-c / a))
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -6.4e-239) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 1.45e-133) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -6.4e-239:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= 1.45e-133:
		tmp = math.sqrt((-c / a))
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -6.4e-239)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 1.45e-133)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -6.4e-239)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 1.45e-133)
		tmp = sqrt((-c / a));
	else
		tmp = (c / b_2) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -6.3999999999999998e-239

   1. Initial program 71.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 72.3

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

   5. Applied rewrites 72.3%

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

   if -6.3999999999999998e-239 < b_2 < 1.4499999999999999e-133

   1. Initial program 71.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 \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 39.2

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

   5. Applied rewrites 39.2%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 39.2

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

   7. Applied rewrites 39.2%

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

   if 1.4499999999999999e-133 < b_2

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 80.4

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

   5. Applied rewrites 80.4%

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

Alternative 8: 67.3% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -3.999999999999988e-310

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

      1. lower-*.f64 67.4

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

   5. Applied rewrites 67.4%

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

   if -3.999999999999988e-310 < b_2

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 67.2

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

   5. Applied rewrites 67.2%

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

Alternative 9: 47.4% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -3.999999999999988e-310

   1. Initial program 71.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 \color{blue}{-1 \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right) + -1 \cdot \frac{b\_2}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lift-neg.f64 24.8

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

   5. Applied rewrites 24.8%

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

   6. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. distribute-frac-neg N/A

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

      3. lift-/.f64 N/A

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

      4. lift-neg.f64 26.9

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

   8. Applied rewrites 26.9%

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

   if -3.999999999999988e-310 < b_2

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 67.2

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

   5. Applied rewrites 67.2%

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

Alternative 10: 47.3% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < -3.999999999999988e-310

   1. Initial program 71.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 \color{blue}{-1 \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right) + -1 \cdot \frac{b\_2}{a}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lift-neg.f64 24.8

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

   5. Applied rewrites 24.8%

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

   6. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. distribute-frac-neg N/A

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

      3. lift-/.f64 N/A

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

      4. lift-neg.f64 26.9

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

   8. Applied rewrites 26.9%

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

   if -3.999999999999988e-310 < b_2

   1. Initial program 31.6%

      \[\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}{c \cdot \left(\frac{-1}{8} \cdot \frac{a \cdot c}{{b\_2}^{3}} - \frac{1}{2} \cdot \frac{1}{b\_2}\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. associate-*r/ N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. unpow3 N/A

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

      10. pow2 N/A

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

      11. lower-*.f64 N/A

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

      12. pow2 N/A

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

      13. lift-*.f64 N/A

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

      14. associate-*r/ N/A

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

      15. metadata-eval N/A

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

      16. lower-/.f64 59.5

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

   5. Applied rewrites 59.5%

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

   6. Taylor expanded in a around 0

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

      1. lower-/.f64 67.0

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

   8. Applied rewrites 67.0%

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

Alternative 11: 14.6% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = -b_2 / a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 51.3%

   \[\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}{-1 \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right) + -1 \cdot \frac{b\_2}{a}} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-fma.f64 N/A

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

   3. sqrt-unprod N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 N/A

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

   7. associate-*r/ N/A

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

   8. mul-1-neg N/A

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

   9. lower-/.f64 N/A

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

   10. lift-neg.f64 19.4

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

5. Applied rewrites 19.4%

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

6. Taylor expanded in b_2 around inf

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

   1. mul-1-neg N/A

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

   2. distribute-frac-neg N/A

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

   3. lift-/.f64 N/A

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

   4. lift-neg.f64 14.6

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

8. Applied rewrites 14.6%

   \[\leadsto \frac{-b\_2}{\color{blue}{a}} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2025092 
(FPCore (a b_2 c)
  :name "quad2p (problem 3.2.1, positive)"
  :precision binary64
  :herbie-expected 10
  (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))