quad2p (problem 3.2.1, positive)

Percentage Accurate: 52.9% → 85.1%

Time: 3.5s

Alternatives: 12

Speedup: 1.0×

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: 85.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -9.6 \cdot 10^{+64}:\\ \;\;\;\;\mathsf{fma}\left(\frac{b\_2}{a}, -2, 0.5 \cdot \frac{c}{b\_2}\right)\\ \mathbf{elif}\;b\_2 \leq 8.6 \cdot 10^{-58}:\\ \;\;\;\;\mathsf{fma}\left(\frac{b\_2}{a}, -1, \frac{\sqrt{\mathsf{fma}\left(-a, c, b\_2 \cdot b\_2\right)}}{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 -9.6e+64)
   (fma (/ b_2 a) -2.0 (* 0.5 (/ c b_2)))
   (if (<= b_2 8.6e-58)
     (fma (/ b_2 a) -1.0 (/ (sqrt (fma (- a) c (* b_2 b_2))) a))
     (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -9.6e+64) {
		tmp = fma((b_2 / a), -2.0, (0.5 * (c / b_2)));
	} else if (b_2 <= 8.6e-58) {
		tmp = fma((b_2 / a), -1.0, (sqrt(fma(-a, c, (b_2 * b_2))) / a));
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -9.59999999999999997e64

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 94.2

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

   4. Applied rewrites 94.2%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 94.5

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

   7. Applied rewrites 94.5%

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

   if -9.59999999999999997e64 < b_2 < 8.5999999999999999e-58

   1. Initial program 77.9%

      \[\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-neg.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. div-add N/A

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

      9. mul-1-neg N/A

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

      10. associate-*r/ N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-/.f64 N/A

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

   3. Applied rewrites 77.9%

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

   if 8.5999999999999999e-58 < b_2

   1. Initial program 17.5%

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

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

   4. Applied rewrites 87.0%

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

Alternative 2: 85.1% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -9.6e+64)
   (fma (/ b_2 a) -2.0 (* 0.5 (/ c b_2)))
   (if (<= b_2 8.6e-58)
     (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a)
     (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -9.6e+64) {
		tmp = fma((b_2 / a), -2.0, (0.5 * (c / b_2)));
	} else if (b_2 <= 8.6e-58) {
		tmp = (-b_2 + 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 <= -9.6e+64)
		tmp = fma(Float64(b_2 / a), -2.0, Float64(0.5 * Float64(c / b_2)));
	elseif (b_2 <= 8.6e-58)
		tmp = Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a);
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -9.59999999999999997e64

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 94.2

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

   4. Applied rewrites 94.2%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 94.5

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

   7. Applied rewrites 94.5%

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

   if -9.59999999999999997e64 < b_2 < 8.5999999999999999e-58

   1. Initial program 77.9%

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

   if 8.5999999999999999e-58 < b_2

   1. Initial program 17.5%

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

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

   4. Applied rewrites 87.0%

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

Alternative 3: 80.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -3.1e-48)
   (fma (/ b_2 a) -2.0 (* 0.5 (/ c b_2)))
   (if (<= b_2 8.6e-58)
     (/ (+ (- b_2) (sqrt (* (- a) c))) a)
     (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.1e-48) {
		tmp = fma((b_2 / a), -2.0, (0.5 * (c / b_2)));
	} else if (b_2 <= 8.6e-58) {
		tmp = (-b_2 + sqrt((-a * c))) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -3.10000000000000016e-48

   1. Initial program 67.3%

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 87.7

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

   4. Applied rewrites 87.7%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 88.0

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

   7. Applied rewrites 88.0%

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

   if -3.10000000000000016e-48 < b_2 < 8.5999999999999999e-58

   1. Initial program 73.9%

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

   2. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 65.7

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

   4. Applied rewrites 65.7%

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

   if 8.5999999999999999e-58 < b_2

   1. Initial program 17.5%

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

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

   4. Applied rewrites 87.0%

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

Alternative 4: 80.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.8 \cdot 10^{-63}:\\ \;\;\;\;\mathsf{fma}\left(\frac{b\_2}{a}, -2, 0.5 \cdot \frac{c}{b\_2}\right)\\ \mathbf{elif}\;b\_2 \leq 8.6 \cdot 10^{-58}:\\ \;\;\;\;\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.8e-63)
   (fma (/ b_2 a) -2.0 (* 0.5 (/ c b_2)))
   (if (<= b_2 8.6e-58) (/ (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.8e-63) {
		tmp = fma((b_2 / a), -2.0, (0.5 * (c / b_2)));
	} else if (b_2 <= 8.6e-58) {
		tmp = 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.8e-63)
		tmp = fma(Float64(b_2 / a), -2.0, Float64(0.5 * Float64(c / b_2)));
	elseif (b_2 <= 8.6e-58)
		tmp = Float64(sqrt(Float64(Float64(-a) * c)) / a);
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -2.8e-63], N[(N[(b$95$2 / a), $MachinePrecision] * -2.0 + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 8.6e-58], 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.8000000000000002e-63

   1. Initial program 68.1%

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 86.4

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

   4. Applied rewrites 86.4%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 86.7

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

   7. Applied rewrites 86.7%

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

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

   1. Initial program 73.3%

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

   2. Taylor expanded in a around inf

      \[\leadsto \frac{\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 65.3

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

   4. Applied rewrites 65.3%

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

   if 8.5999999999999999e-58 < b_2

   1. Initial program 17.5%

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

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

   4. Applied rewrites 87.0%

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

Alternative 5: 80.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -2.8 \cdot 10^{-63}:\\ \;\;\;\;\frac{-2 \cdot b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 8.6 \cdot 10^{-58}:\\ \;\;\;\;\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.8e-63)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 8.6e-58) (/ (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.8e-63) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 8.6e-58) {
		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.8d-63)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= 8.6d-58) 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.8e-63) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 8.6e-58) {
		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.8e-63:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= 8.6e-58:
		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.8e-63)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 8.6e-58)
		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.8e-63)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 8.6e-58)
		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.8e-63], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 8.6e-58], 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.8000000000000002e-63

   1. Initial program 68.1%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 86.3

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

   4. Applied rewrites 86.3%

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

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

   1. Initial program 73.3%

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

   2. Taylor expanded in a around inf

      \[\leadsto \frac{\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 65.3

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

   4. Applied rewrites 65.3%

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

   if 8.5999999999999999e-58 < b_2

   1. Initial program 17.5%

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

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

   4. Applied rewrites 87.0%

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

Alternative 6: 72.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -5.5 \cdot 10^{-75}:\\ \;\;\;\;\frac{-2 \cdot b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 6.2 \cdot 10^{-58}:\\ \;\;\;\;\frac{\sqrt{-c}}{\sqrt{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b\_2} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -5.5e-75)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 6.2e-58) (/ (sqrt (- c)) (sqrt a)) (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -5.5e-75) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 6.2e-58) {
		tmp = sqrt(-c) / sqrt(a);
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-5.5d-75)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= 6.2d-58) then
        tmp = sqrt(-c) / sqrt(a)
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -5.50000000000000026e-75

   1. Initial program 68.4%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 85.5

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

   4. Applied rewrites 85.5%

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

   if -5.50000000000000026e-75 < b_2 < 6.1999999999999998e-58

   1. Initial program 73.0%

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

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

   4. Applied rewrites 32.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. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 32.6

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

   6. Applied rewrites 32.6%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. sqrt-div N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lift-neg.f64 N/A

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

      8. lower-sqrt.f64 41.9

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

   8. Applied rewrites 41.9%

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

   if 6.1999999999999998e-58 < b_2

   1. Initial program 17.5%

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

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

   4. Applied rewrites 86.9%

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

Alternative 7: 70.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\frac{-c}{a}}\\ t_1 := -t\_0\\ \mathbf{if}\;b\_2 \leq -2.8 \cdot 10^{-63}:\\ \;\;\;\;\frac{-2 \cdot b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq -2.1 \cdot 10^{-183}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b\_2 \leq 8.5 \cdot 10^{-287}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b\_2 \leq 3.5 \cdot 10^{-55}:\\ \;\;\;\;t\_1\\ \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))) (t_1 (- t_0)))
   (if (<= b_2 -2.8e-63)
     (/ (* -2.0 b_2) a)
     (if (<= b_2 -2.1e-183)
       t_1
       (if (<= b_2 8.5e-287)
         t_0
         (if (<= b_2 3.5e-55) t_1 (* (/ c b_2) -0.5)))))))

C

double code(double a, double b_2, double c) {
	double t_0 = sqrt((-c / a));
	double t_1 = -t_0;
	double tmp;
	if (b_2 <= -2.8e-63) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= -2.1e-183) {
		tmp = t_1;
	} else if (b_2 <= 8.5e-287) {
		tmp = t_0;
	} else if (b_2 <= 3.5e-55) {
		tmp = t_1;
	} 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) :: t_1
    real(8) :: tmp
    t_0 = sqrt((-c / a))
    t_1 = -t_0
    if (b_2 <= (-2.8d-63)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= (-2.1d-183)) then
        tmp = t_1
    else if (b_2 <= 8.5d-287) then
        tmp = t_0
    else if (b_2 <= 3.5d-55) then
        tmp = t_1
    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 t_1 = -t_0;
	double tmp;
	if (b_2 <= -2.8e-63) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= -2.1e-183) {
		tmp = t_1;
	} else if (b_2 <= 8.5e-287) {
		tmp = t_0;
	} else if (b_2 <= 3.5e-55) {
		tmp = t_1;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	t_0 = math.sqrt((-c / a))
	t_1 = -t_0
	tmp = 0
	if b_2 <= -2.8e-63:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= -2.1e-183:
		tmp = t_1
	elif b_2 <= 8.5e-287:
		tmp = t_0
	elif b_2 <= 3.5e-55:
		tmp = t_1
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

function code(a, b_2, c)
	t_0 = sqrt(Float64(Float64(-c) / a))
	t_1 = Float64(-t_0)
	tmp = 0.0
	if (b_2 <= -2.8e-63)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= -2.1e-183)
		tmp = t_1;
	elseif (b_2 <= 8.5e-287)
		tmp = t_0;
	elseif (b_2 <= 3.5e-55)
		tmp = t_1;
	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));
	t_1 = -t_0;
	tmp = 0.0;
	if (b_2 <= -2.8e-63)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= -2.1e-183)
		tmp = t_1;
	elseif (b_2 <= 8.5e-287)
		tmp = t_0;
	elseif (b_2 <= 3.5e-55)
		tmp = t_1;
	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]}, Block[{t$95$1 = (-t$95$0)}, If[LessEqual[b$95$2, -2.8e-63], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, -2.1e-183], t$95$1, If[LessEqual[b$95$2, 8.5e-287], t$95$0, If[LessEqual[b$95$2, 3.5e-55], t$95$1, N[(N[(c / b$95$2), $MachinePrecision] * -0.5), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if b_2 < -2.8000000000000002e-63

   1. Initial program 68.1%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 86.3

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

   4. Applied rewrites 86.3%

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

   if -2.8000000000000002e-63 < b_2 < -2.1000000000000002e-183 or 8.5000000000000003e-287 < b_2 < 3.50000000000000025e-55

   1. Initial program 73.1%

      \[\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-neg.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. div-add N/A

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

      9. mul-1-neg N/A

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

      10. associate-*r/ N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-/.f64 N/A

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

   3. Applied rewrites 73.0%

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

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

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

      2. mul-1-neg N/A

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

      3. distribute-frac-neg N/A

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

      4. lift-neg.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. pow2 N/A

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

      7. +-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. lift-neg.f64 N/A

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

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

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

      11. pow2 N/A

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

      12. div-add N/A

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

      13. mul-1-neg N/A

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

      14. lower-neg.f64 N/A

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

      15. sqrt-prod N/A

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

      16. lower-sqrt.f64 N/A

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

   6. Applied rewrites 28.4%

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

   if -2.1000000000000002e-183 < b_2 < 8.5000000000000003e-287

   1. Initial program 73.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 40.7

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

   4. Applied rewrites 40.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. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 40.7

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

   6. Applied rewrites 40.7%

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

   if 3.50000000000000025e-55 < b_2

   1. Initial program 17.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 87.2

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

   4. Applied rewrites 87.2%

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

Alternative 8: 69.5% accurate, 1.0× speedup

Math

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

C

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

   1. Initial program 70.5%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 80.4

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

   4. Applied rewrites 80.4%

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

   if -4.0999999999999999e-137 < b_2 < 6.1999999999999998e-58

   1. Initial program 70.6%

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

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

   4. Applied rewrites 34.2%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 34.2

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

   6. Applied rewrites 34.2%

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

   if 6.1999999999999998e-58 < b_2

   1. Initial program 17.5%

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

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

   4. Applied rewrites 86.9%

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

Alternative 9: 52.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.1 \cdot 10^{-70}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 6.2 \cdot 10^{-58}:\\ \;\;\;\;\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 -1.1e-70)
   (/ (- b_2) a)
   (if (<= b_2 6.2e-58) (sqrt (/ (- c) a)) (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.1e-70) {
		tmp = -b_2 / a;
	} else if (b_2 <= 6.2e-58) {
		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 <= (-1.1d-70)) then
        tmp = -b_2 / a
    else if (b_2 <= 6.2d-58) 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 <= -1.1e-70) {
		tmp = -b_2 / a;
	} else if (b_2 <= 6.2e-58) {
		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 <= -1.1e-70:
		tmp = -b_2 / a
	elif b_2 <= 6.2e-58:
		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 <= -1.1e-70)
		tmp = Float64(Float64(-b_2) / a);
	elseif (b_2 <= 6.2e-58)
		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 <= -1.1e-70)
		tmp = -b_2 / a;
	elseif (b_2 <= 6.2e-58)
		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, -1.1e-70], N[((-b$95$2) / a), $MachinePrecision], If[LessEqual[b$95$2, 6.2e-58], 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 < -1.0999999999999999e-70

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lift-neg.f64 22.2

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

   4. Applied rewrites 22.2%

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

   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-/.f64 N/A

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

      4. lift-neg.f64 36.4

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

   7. Applied rewrites 36.4%

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

   if -1.0999999999999999e-70 < b_2 < 6.1999999999999998e-58

   1. Initial program 73.1%

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

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

   4. Applied rewrites 32.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. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 32.6

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

   6. Applied rewrites 32.6%

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

   if 6.1999999999999998e-58 < b_2

   1. Initial program 17.5%

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

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

   4. Applied rewrites 86.9%

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

Alternative 10: 32.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.1 \cdot 10^{-70}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 2.7 \cdot 10^{+40}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c}{b\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.1e-70)
   (/ (- b_2) a)
   (if (<= b_2 2.7e+40) (sqrt (/ (- c) a)) (* 0.5 (/ c b_2)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.1e-70) {
		tmp = -b_2 / a;
	} else if (b_2 <= 2.7e+40) {
		tmp = sqrt((-c / a));
	} else {
		tmp = 0.5 * (c / b_2);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-1.1d-70)) then
        tmp = -b_2 / a
    else if (b_2 <= 2.7d+40) then
        tmp = sqrt((-c / a))
    else
        tmp = 0.5d0 * (c / b_2)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.1e-70) {
		tmp = -b_2 / a;
	} else if (b_2 <= 2.7e+40) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = 0.5 * (c / b_2);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.1e-70:
		tmp = -b_2 / a
	elif b_2 <= 2.7e+40:
		tmp = math.sqrt((-c / a))
	else:
		tmp = 0.5 * (c / b_2)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.1e-70)
		tmp = Float64(Float64(-b_2) / a);
	elseif (b_2 <= 2.7e+40)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(0.5 * Float64(c / b_2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.1e-70)
		tmp = -b_2 / a;
	elseif (b_2 <= 2.7e+40)
		tmp = sqrt((-c / a));
	else
		tmp = 0.5 * (c / b_2);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.0999999999999999e-70

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lift-neg.f64 22.2

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

   4. Applied rewrites 22.2%

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

   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-/.f64 N/A

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

      4. lift-neg.f64 36.4

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

   7. Applied rewrites 36.4%

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

   if -1.0999999999999999e-70 < b_2 < 2.70000000000000009e40

   1. Initial program 65.6%

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

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

   4. Applied rewrites 29.5%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 29.5

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

   6. Applied rewrites 29.5%

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

   if 2.70000000000000009e40 < b_2

   1. Initial program 12.7%

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 2.5

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

   4. Applied rewrites 2.5%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 31.8

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

   7. Applied rewrites 31.8%

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

Alternative 11: 23.1% accurate, 1.4× speedup

Math

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

FPCore

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

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 3.5e+40) {
		tmp = -b_2 / a;
	} else {
		tmp = 0.5 * (c / b_2);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= 3.5d+40) then
        tmp = -b_2 / a
    else
        tmp = 0.5d0 * (c / b_2)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b_2 < 3.4999999999999999e40

   1. Initial program 66.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. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lift-neg.f64 25.0

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

   4. Applied rewrites 25.0%

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

   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-/.f64 N/A

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

      4. lift-neg.f64 20.0

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

   7. Applied rewrites 20.0%

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

   if 3.4999999999999999e40 < b_2

   1. Initial program 12.7%

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lift-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 2.5

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

   4. Applied rewrites 2.5%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 31.8

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

   7. Applied rewrites 31.8%

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

Alternative 12: 15.5% accurate, 3.3× 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. *-commutative N/A

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

   2. lower-fma.f64 N/A

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

   3. sqrt-unprod N/A

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

   4. lower-sqrt.f64 N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 N/A

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

   7. associate-*r/ N/A

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

   8. mul-1-neg N/A

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

   9. lower-/.f64 N/A

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

   10. lift-neg.f64 19.6

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

4. Applied rewrites 19.6%

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

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-/.f64 N/A

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

   4. lift-neg.f64 15.5

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

7. Applied rewrites 15.5%

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

Reproduce

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