quad2p (problem 3.2.1, positive)

Percentage Accurate: 52.9% → 86.0%

Time: 3.1s

Alternatives: 10

Speedup: 1.2×

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.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 86.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.2 \cdot 10^{+145}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 1.26 \cdot 10^{-94}:\\ \;\;\;\;\mathsf{fma}\left(-b\_2, \frac{1}{a}, \frac{\sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a}\right)\\ \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.2e+145)
   (* -2.0 (/ b_2 a))
   (if (<= b_2 1.26e-94)
     (fma (- b_2) (/ 1.0 a) (/ (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.2e+145) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.26e-94) {
		tmp = fma(-b_2, (1.0 / a), (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.2e+145)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 1.26e-94)
		tmp = fma(Float64(-b_2), Float64(1.0 / a), Float64(sqrt(Float64(Float64(b_2 * b_2) - 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, -1.2e+145], N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 1.26e-94], N[((-b$95$2) * N[(1.0 / a), $MachinePrecision] + N[(N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $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.19999999999999996e145

   1. Initial program 45.2%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 98.0

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

   4. Applied rewrites 98.0%

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

   if -1.19999999999999996e145 < b_2 < 1.2600000000000001e-94

   1. Initial program 82.8%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. 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-+.f64 N/A

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

      3. 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} \]

      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{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}}}{a} \]

      7. 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} \]

      8. mult-flip N/A

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

      9. lower-*.f64 N/A

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

   3. Applied rewrites 82.6%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. *-commutative N/A

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

      8. +-commutative N/A

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

      9. lift-neg.f64 N/A

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

      10. lift-/.f64 N/A

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

      11. mult-flip N/A

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

      12. lift-neg.f64 N/A

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

      13. div-add N/A

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

      14. mult-flip N/A

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

      15. lower-fma.f64 N/A

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

   5. Applied rewrites 82.8%

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

   if 1.2600000000000001e-94 < b_2

   1. Initial program 20.4%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. 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 84.0

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

   4. Applied rewrites 84.0%

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

Alternative 2: 86.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.2 \cdot 10^{+145}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 1.26 \cdot 10^{-94}:\\ \;\;\;\;\frac{\sqrt{b\_2 \cdot b\_2 - a \cdot c} - 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 -1.2e+145)
   (* -2.0 (/ b_2 a))
   (if (<= b_2 1.26e-94)
     (/ (- (sqrt (- (* b_2 b_2) (* a c))) b_2) a)
     (* (/ c b_2) -0.5))))

C

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

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.2e+145:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 1.26e-94:
		tmp = (math.sqrt(((b_2 * b_2) - (a * c))) - 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.2e+145)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 1.26e-94)
		tmp = Float64(Float64(sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c))) - 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 <= -1.2e+145)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 1.26e-94)
		tmp = (sqrt(((b_2 * b_2) - (a * c))) - 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, -1.2e+145], N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 1.26e-94], N[(N[(N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b$95$2), $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.19999999999999996e145

   1. Initial program 45.2%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 98.0

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

   4. Applied rewrites 98.0%

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

   if -1.19999999999999996e145 < b_2 < 1.2600000000000001e-94

   1. Initial program 82.8%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. 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-+.f64 N/A

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

      3. 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} \]

      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{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}}}{a} \]

      7. 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} \]

      8. mult-flip N/A

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

      9. lower-*.f64 N/A

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

   3. Applied rewrites 82.6%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. mult-flip-rev N/A

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

      10. lower-/.f64 N/A

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

   5. Applied rewrites 82.8%

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

   if 1.2600000000000001e-94 < b_2

   1. Initial program 20.4%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. 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 84.0

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

   4. Applied rewrites 84.0%

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

Alternative 3: 80.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.6 \cdot 10^{-21}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 1.16 \cdot 10^{-94}:\\ \;\;\;\;\frac{\sqrt{\left(-a\right) \cdot c} - 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 -2.6e-21)
   (* -2.0 (/ b_2 a))
   (if (<= b_2 1.16e-94) (/ (- (sqrt (* (- a) c)) b_2) a) (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2.6e-21) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.16e-94) {
		tmp = (sqrt((-a * c)) - 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 <= (-2.6d-21)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= 1.16d-94) then
        tmp = (sqrt((-a * c)) - 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 <= -2.6e-21) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.16e-94) {
		tmp = (Math.sqrt((-a * c)) - b_2) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -2.6e-21:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 1.16e-94:
		tmp = (math.sqrt((-a * c)) - 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 <= -2.6e-21)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 1.16e-94)
		tmp = Float64(Float64(sqrt(Float64(Float64(-a) * c)) - 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 <= -2.6e-21)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 1.16e-94)
		tmp = (sqrt((-a * c)) - 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, -2.6e-21], N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 1.16e-94], N[(N[(N[Sqrt[N[((-a) * c), $MachinePrecision]], $MachinePrecision] - b$95$2), $MachinePrecision] / a), $MachinePrecision], N[(N[(c / b$95$2), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -2.60000000000000017e-21

   1. Initial program 66.6%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 90.2

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

   4. Applied rewrites 90.2%

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

   if -2.60000000000000017e-21 < b_2 < 1.16000000000000001e-94

   1. Initial program 78.0%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. 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-+.f64 N/A

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

      3. 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} \]

      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{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}}}{a} \]

      7. 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} \]

      8. mult-flip N/A

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

      9. lower-*.f64 N/A

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

   3. Applied rewrites 77.9%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. mult-flip-rev N/A

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

      10. lower-/.f64 N/A

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

   5. Applied rewrites 78.0%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 65.9

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

   8. Applied rewrites 65.9%

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

   if 1.16000000000000001e-94 < b_2

   1. Initial program 20.4%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. 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 84.0

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

   4. Applied rewrites 84.0%

      \[\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, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.6 \cdot 10^{-21}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 1.16 \cdot 10^{-94}:\\ \;\;\;\;\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 -2.6e-21)
   (* -2.0 (/ b_2 a))
   (if (<= b_2 1.16e-94) (/ (sqrt (* (- a) c)) a) (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2.6e-21) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.16e-94) {
		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 <= (-2.6d-21)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= 1.16d-94) 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 <= -2.6e-21) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.16e-94) {
		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 <= -2.6e-21:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 1.16e-94:
		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 <= -2.6e-21)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 1.16e-94)
		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 <= -2.6e-21)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 1.16e-94)
		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, -2.6e-21], N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 1.16e-94], 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 < -2.60000000000000017e-21

   1. Initial program 66.6%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 90.2

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

   4. Applied rewrites 90.2%

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

   if -2.60000000000000017e-21 < b_2 < 1.16000000000000001e-94

   1. Initial program 78.0%

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

   2. Taylor expanded in a around inf

      \[\leadsto \frac{\color{blue}{\sqrt{a \cdot c} \cdot \sqrt{-1}}}{a} \]
   3. 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 64.0

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

   4. Applied rewrites 64.0%

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

   if 1.16000000000000001e-94 < b_2

   1. Initial program 20.4%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. 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 84.0

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

   4. Applied rewrites 84.0%

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

Alternative 5: 70.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\frac{-c}{a}}\\ \mathbf{if}\;b\_2 \leq -3.3 \cdot 10^{-28}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq -3.4 \cdot 10^{-194}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b\_2 \leq 4.4 \cdot 10^{-157}:\\ \;\;\;\;-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 -3.3e-28)
     (* -2.0 (/ b_2 a))
     (if (<= b_2 -3.4e-194)
       t_0
       (if (<= b_2 4.4e-157) (- 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 <= -3.3e-28) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= -3.4e-194) {
		tmp = t_0;
	} else if (b_2 <= 4.4e-157) {
		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 <= (-3.3d-28)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= (-3.4d-194)) then
        tmp = t_0
    else if (b_2 <= 4.4d-157) 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 <= -3.3e-28) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= -3.4e-194) {
		tmp = t_0;
	} else if (b_2 <= 4.4e-157) {
		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 <= -3.3e-28:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= -3.4e-194:
		tmp = t_0
	elif b_2 <= 4.4e-157:
		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 <= -3.3e-28)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= -3.4e-194)
		tmp = t_0;
	elseif (b_2 <= 4.4e-157)
		tmp = Float64(-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 <= -3.3e-28)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= -3.4e-194)
		tmp = t_0;
	elseif (b_2 <= 4.4e-157)
		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, -3.3e-28], N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, -3.4e-194], t$95$0, If[LessEqual[b$95$2, 4.4e-157], (-t$95$0), N[(N[(c / b$95$2), $MachinePrecision] * -0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if b_2 < -3.3000000000000002e-28

   1. Initial program 67.0%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 89.8

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

   4. Applied rewrites 89.8%

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

   if -3.3000000000000002e-28 < b_2 < -3.40000000000000009e-194

   1. Initial program 87.7%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 24.8

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

   4. Applied rewrites 24.8%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative 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. lift-neg.f64 N/A

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

      7. lower-/.f64 24.8

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

   6. Applied rewrites 24.8%

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

   if -3.40000000000000009e-194 < b_2 < 4.4000000000000002e-157

   1. Initial program 74.7%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. 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-+.f64 N/A

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

      3. 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} \]

      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{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}}}{a} \]

      7. 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} \]

      8. mult-flip N/A

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

      9. lower-*.f64 N/A

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

   3. Applied rewrites 74.7%

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

   4. Taylor expanded in a around -inf

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

      1. mult-flip-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. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lift-neg.f64 N/A

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

      6. mul-1-neg N/A

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

      7. sqrt-prod N/A

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

      8. lift-/.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-sqrt.f64 N/A

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

      11. lift-neg.f64 36.8

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

      12. lift-*.f64 N/A

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

      13. lift-/.f64 N/A

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

      14. associate-*l/ N/A

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

      15. *-commutative N/A

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

      16. mul-1-neg N/A

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

      17. lift-neg.f64 N/A

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

      18. lower-/.f64 36.8

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

   6. Applied rewrites 36.8%

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

   if 4.4000000000000002e-157 < b_2

   1. Initial program 24.6%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. 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 78.8

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

   4. Applied rewrites 78.8%

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

Alternative 6: 70.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -3.3 \cdot 10^{-28}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 1.05 \cdot 10^{-159}:\\ \;\;\;\;\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 -3.3e-28)
   (* -2.0 (/ b_2 a))
   (if (<= b_2 1.05e-159) (sqrt (/ (- c) a)) (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.3e-28) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.05e-159) {
		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 <= (-3.3d-28)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= 1.05d-159) 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 <= -3.3e-28) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.05e-159) {
		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 <= -3.3e-28:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 1.05e-159:
		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 <= -3.3e-28)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 1.05e-159)
		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 <= -3.3e-28)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 1.05e-159)
		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, -3.3e-28], N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 1.05e-159], 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 < -3.3000000000000002e-28

   1. Initial program 67.0%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 89.8

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

   4. Applied rewrites 89.8%

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

   if -3.3000000000000002e-28 < b_2 < 1.05e-159

   1. Initial program 80.3%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 31.6

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

   4. Applied rewrites 31.6%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative 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. lift-neg.f64 N/A

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

      7. lower-/.f64 31.6

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

   6. Applied rewrites 31.6%

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

   if 1.05e-159 < b_2

   1. Initial program 24.8%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. 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 78.7

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

   4. Applied rewrites 78.7%

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

Alternative 7: 49.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -3.3 \cdot 10^{-28}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 7.8 \cdot 10^{+101}:\\ \;\;\;\;\sqrt{\frac{-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 -3.3e-28)
   (* -2.0 (/ b_2 a))
   (if (<= b_2 7.8e+101) (sqrt (/ (- c) a)) (/ (- b_2 b_2) a))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.3e-28) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 7.8e+101) {
		tmp = sqrt((-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 <= (-3.3d-28)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= 7.8d+101) then
        tmp = sqrt((-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 <= -3.3e-28) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 7.8e+101) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = (b_2 - b_2) / a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -3.3e-28:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 7.8e+101:
		tmp = math.sqrt((-c / a))
	else:
		tmp = (b_2 - b_2) / a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -3.3e-28)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 7.8e+101)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(b_2 - b_2) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -3.3e-28)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 7.8e+101)
		tmp = sqrt((-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, -3.3e-28], N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 7.8e+101], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(b$95$2 - b$95$2), $MachinePrecision] / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -3.3000000000000002e-28

   1. Initial program 67.0%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 89.8

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

   4. Applied rewrites 89.8%

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

   if -3.3000000000000002e-28 < b_2 < 7.8e101

   1. Initial program 63.3%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 25.7

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

   4. Applied rewrites 25.7%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative 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. lift-neg.f64 N/A

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

      7. lower-/.f64 25.7

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

   6. Applied rewrites 25.7%

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

   if 7.8e101 < b_2

   1. Initial program 8.8%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. 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-+.f64 N/A

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

      3. 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} \]

      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{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}}}{a} \]

      7. 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} \]

      8. mult-flip N/A

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

      9. lower-*.f64 N/A

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

   3. Applied rewrites 8.8%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. mult-flip-rev N/A

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

      10. lower-/.f64 N/A

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

   5. Applied rewrites 8.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 38.1%

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

Alternative 8: 32.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.5 \cdot 10^{-26}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 7.8 \cdot 10^{+101}:\\ \;\;\;\;\sqrt{\frac{-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 -2.5e-26)
   (/ (- b_2) a)
   (if (<= b_2 7.8e+101) (sqrt (/ (- c) a)) (/ (- b_2 b_2) a))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2.5e-26) {
		tmp = -b_2 / a;
	} else if (b_2 <= 7.8e+101) {
		tmp = sqrt((-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 <= (-2.5d-26)) then
        tmp = -b_2 / a
    else if (b_2 <= 7.8d+101) then
        tmp = sqrt((-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 <= -2.5e-26) {
		tmp = -b_2 / a;
	} else if (b_2 <= 7.8e+101) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = (b_2 - b_2) / a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -2.5e-26:
		tmp = -b_2 / a
	elif b_2 <= 7.8e+101:
		tmp = math.sqrt((-c / a))
	else:
		tmp = (b_2 - b_2) / a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -2.5e-26)
		tmp = Float64(Float64(-b_2) / a);
	elseif (b_2 <= 7.8e+101)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(b_2 - b_2) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -2.5e-26)
		tmp = -b_2 / a;
	elseif (b_2 <= 7.8e+101)
		tmp = sqrt((-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, -2.5e-26], N[((-b$95$2) / a), $MachinePrecision], If[LessEqual[b$95$2, 7.8e+101], N[Sqrt[N[((-c) / a), $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.5000000000000001e-26

   1. Initial program 66.8%

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

   2. Taylor expanded in a around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 N/A

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

      4. sqrt-unprod N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. associate-*r/ N/A

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

      9. mul-1-neg N/A

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

      10. lift-neg.f64 N/A

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

      11. lower-/.f64 22.0

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

   4. Applied rewrites 22.0%

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

   5. Taylor expanded in b_2 around inf

      \[\leadsto -1 \cdot \color{blue}{\frac{b\_2}{a}} \]
   6. 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-neg.f64 N/A

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

      4. lift-/.f64 39.5

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

   7. Applied rewrites 39.5%

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

   if -2.5000000000000001e-26 < b_2 < 7.8e101

   1. Initial program 63.4%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 25.7

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

   4. Applied rewrites 25.7%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative 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. lift-neg.f64 N/A

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

      7. lower-/.f64 25.7

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

   6. Applied rewrites 25.7%

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

   if 7.8e101 < b_2

   1. Initial program 8.8%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. 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-+.f64 N/A

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

      3. 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} \]

      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{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}}}{a} \]

      7. 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} \]

      8. mult-flip N/A

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

      9. lower-*.f64 N/A

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

   3. Applied rewrites 8.8%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. mult-flip-rev N/A

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

      10. lower-/.f64 N/A

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

   5. Applied rewrites 8.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 38.1%

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

Alternative 9: 24.5% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1 \cdot 10^{-301}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{b\_2 - b\_2}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1e-301) (/ (- b_2) a) (/ (- b_2 b_2) a)))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1e-301) {
		tmp = -b_2 / 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 <= (-1d-301)) then
        tmp = -b_2 / 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 <= -1e-301) {
		tmp = -b_2 / a;
	} else {
		tmp = (b_2 - b_2) / a;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1e-301:
		tmp = -b_2 / a
	else:
		tmp = (b_2 - b_2) / a
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1e-301)
		tmp = Float64(Float64(-b_2) / a);
	else
		tmp = Float64(Float64(b_2 - b_2) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1e-301)
		tmp = -b_2 / 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, -1e-301], N[((-b$95$2) / a), $MachinePrecision], N[(N[(b$95$2 - b$95$2), $MachinePrecision] / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -1.00000000000000007e-301

   1. Initial program 72.5%

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

   2. Taylor expanded in a around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 N/A

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

      4. sqrt-unprod N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. associate-*r/ N/A

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

      9. mul-1-neg N/A

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

      10. lift-neg.f64 N/A

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

      11. lower-/.f64 25.0

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

   4. Applied rewrites 25.0%

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

   5. Taylor expanded in b_2 around inf

      \[\leadsto -1 \cdot \color{blue}{\frac{b\_2}{a}} \]
   6. 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-neg.f64 N/A

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

      4. lift-/.f64 29.2

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

   7. Applied rewrites 29.2%

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

   if -1.00000000000000007e-301 < b_2

   1. Initial program 33.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. 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-+.f64 N/A

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

      3. 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} \]

      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{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}}}{a} \]

      7. 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} \]

      8. mult-flip N/A

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

      9. lower-*.f64 N/A

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

   3. Applied rewrites 33.5%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. mult-flip-rev N/A

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

      10. lower-/.f64 N/A

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

   5. Applied rewrites 33.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 19.8%

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

Alternative 10: 15.9% accurate, 3.4× 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 52.9%

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

2. Taylor expanded in a around -inf

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

   1. lower-+.f64 N/A

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

   2. mul-1-neg N/A

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

   3. lower-neg.f64 N/A

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

   4. sqrt-unprod N/A

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

   5. lower-sqrt.f64 N/A

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

   6. lower-*.f64 N/A

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

   7. lower-/.f64 N/A

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

   8. associate-*r/ N/A

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

   9. mul-1-neg N/A

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

   10. lift-neg.f64 N/A

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

   11. lower-/.f64 19.6

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

4. Applied rewrites 19.6%

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

5. Taylor expanded in b_2 around inf

   \[\leadsto -1 \cdot \color{blue}{\frac{b\_2}{a}} \]
6. 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-neg.f64 N/A

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

   4. lift-/.f64 15.9

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

7. Applied rewrites 15.9%

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

Developer Target 1: 99.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025127 
(FPCore (a b_2 c)
  :name "quad2p (problem 3.2.1, positive)"
  :precision binary64
  :herbie-expected 10

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

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