quad2p (problem 3.2.1, positive)

Percentage Accurate: 52.1% → 85.7%

Time: 4.0s

Alternatives: 11

Speedup: 1.2×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 52.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.7% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -2e+144)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 3.8e-111)
     (/ (+ (- b_2) (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 <= -2e+144) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 3.8e-111) {
		tmp = (-b_2 + 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 <= -2e+144)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 3.8e-111)
		tmp = Float64(Float64(Float64(-b_2) + 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, -2e+144], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 3.8e-111], N[(N[((-b$95$2) + N[Sqrt[N[((-a) * c + N[(b$95$2 * b$95$2), $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 < -2.00000000000000005e144

   1. Initial program 44.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 97.5

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

   4. Applied rewrites 97.5%

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

   if -2.00000000000000005e144 < b_2 < 3.80000000000000022e-111

   1. Initial program 83.7%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. pow2 N/A

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

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

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 83.7

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

   3. Applied rewrites 83.7%

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

   if 3.80000000000000022e-111 < b_2

   1. Initial program 20.2%

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

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

   4. Applied rewrites 82.7%

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

Alternative 2: 85.7% accurate, 0.7× speedup

Math

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-2d+144)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= 3.8d-111) then
        tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2e+144) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 3.8e-111) {
		tmp = (-b_2 + Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -2e+144:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= 3.8e-111:
		tmp = (-b_2 + math.sqrt(((b_2 * b_2) - (a * c)))) / a
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

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

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -2e+144)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 3.8e-111)
		tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
	else
		tmp = (c / b_2) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -2e+144], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 3.8e-111], 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 < -2.00000000000000005e144

   1. Initial program 44.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 97.5

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

   4. Applied rewrites 97.5%

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

   if -2.00000000000000005e144 < b_2 < 3.80000000000000022e-111

   1. Initial program 83.7%

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

   if 3.80000000000000022e-111 < b_2

   1. Initial program 20.2%

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

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

   4. Applied rewrites 82.7%

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

Alternative 3: 80.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -8.8 \cdot 10^{-57}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \frac{c}{b\_2}, \frac{b\_2}{a} \cdot -2\right)\\ \mathbf{elif}\;b\_2 \leq 3.8 \cdot 10^{-111}:\\ \;\;\;\;\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 -8.8e-57)
   (fma 0.5 (/ c b_2) (* (/ b_2 a) -2.0))
   (if (<= b_2 3.8e-111)
     (/ (+ (- 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 <= -8.8e-57) {
		tmp = fma(0.5, (c / b_2), ((b_2 / a) * -2.0));
	} else if (b_2 <= 3.8e-111) {
		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 <= -8.8e-57)
		tmp = fma(0.5, Float64(c / b_2), Float64(Float64(b_2 / a) * -2.0));
	elseif (b_2 <= 3.8e-111)
		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, -8.8e-57], N[(0.5 * N[(c / b$95$2), $MachinePrecision] + N[(N[(b$95$2 / a), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 3.8e-111], 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 < -8.79999999999999994e-57

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

      4. lower-*.f64 N/A

         \[\leadsto \left(-b\_2\right) \cdot \color{blue}{\left(\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.0

          \[\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.0%

      \[\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{1}{2} \cdot \frac{c}{b\_2} + -2 \cdot \color{blue}{\frac{b\_2}{a}} \]

      2. lower-fma.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 87.4

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

   7. Applied rewrites 87.4%

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

   if -8.79999999999999994e-57 < b_2 < 3.80000000000000022e-111

   1. Initial program 78.0%

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

   2. Taylor expanded in a around inf

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

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

   4. Applied rewrites 69.4%

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

   if 3.80000000000000022e-111 < b_2

   1. Initial program 20.2%

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

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

   4. Applied rewrites 82.7%

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

Alternative 4: 80.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -8.8 \cdot 10^{-57}:\\ \;\;\;\;\frac{-2 \cdot b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 3.8 \cdot 10^{-111}:\\ \;\;\;\;\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 -8.8e-57)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 3.8e-111)
     (/ (+ (- 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 <= -8.8e-57) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 3.8e-111) {
		tmp = (-b_2 + sqrt((-a * c))) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-8.8d-57)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= 3.8d-111) then
        tmp = (-b_2 + sqrt((-a * c))) / a
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -8.8e-57) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 3.8e-111) {
		tmp = (-b_2 + Math.sqrt((-a * c))) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -8.8e-57], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 3.8e-111], 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 < -8.79999999999999994e-57

   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 87.0

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

   4. Applied rewrites 87.0%

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

   if -8.79999999999999994e-57 < b_2 < 3.80000000000000022e-111

   1. Initial program 78.0%

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

   2. Taylor expanded in a around inf

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

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

   4. Applied rewrites 69.4%

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

   if 3.80000000000000022e-111 < b_2

   1. Initial program 20.2%

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

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

   4. Applied rewrites 82.7%

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

Alternative 5: 80.2% accurate, 1.0× speedup

Math

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

C

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

   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 87.0

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

   4. Applied rewrites 87.0%

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

   if -8.79999999999999994e-57 < b_2 < 3.80000000000000022e-111

   1. Initial program 78.0%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. *-commutative N/A

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

      3. lower-sqrt.f64 N/A

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

      4. associate-*r* N/A

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

      5. mul-1-neg N/A

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

      6. lower-*.f64 N/A

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

      7. lower-neg.f64 67.7

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

   4. Applied rewrites 67.7%

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

   if 3.80000000000000022e-111 < b_2

   1. Initial program 20.2%

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

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

   4. Applied rewrites 82.7%

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

Alternative 6: 74.1% accurate, 1.1× speedup

Math

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

C

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

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

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

   4. Applied rewrites 81.2%

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

   if -8.5000000000000001e-137 < b_2 < 3.84999999999999979e-112

   1. Initial program 75.0%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. pow2 N/A

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

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

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 75.0

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

   3. Applied rewrites 75.0%

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

   4. Taylor expanded in a around inf

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

      1. lift-neg.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lift-neg.f64 N/A

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

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

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

      9. pow2 N/A

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

      10. lift-neg.f64 N/A

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

      11. sqrt-prod N/A

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

      12. lower-sqrt.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-*r/ N/A

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

      15. mul-1-neg N/A

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

      16. lower-/.f64 N/A

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

   6. Applied rewrites 34.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-/.f64 N/A

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

      3. sqrt-div N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 44.6

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

   8. Applied rewrites 44.6%

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

   if 3.84999999999999979e-112 < b_2

   1. Initial program 20.2%

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

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

   4. Applied rewrites 82.6%

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

Alternative 7: 72.0% accurate, 1.2× speedup

Math

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

C

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

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

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

   4. Applied rewrites 81.2%

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

   if -1.95e-138 < b_2 < 1.5000000000000001e-115

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. pow2 N/A

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

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

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 75.1

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

   3. Applied rewrites 75.1%

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

   4. Taylor expanded in a around inf

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

      1. lift-neg.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lift-neg.f64 N/A

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

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

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

      9. pow2 N/A

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

      10. lift-neg.f64 N/A

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

      11. sqrt-prod N/A

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

      12. lower-sqrt.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-*r/ N/A

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

      15. mul-1-neg N/A

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

      16. lower-/.f64 N/A

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

   6. Applied rewrites 34.7%

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

   if 1.5000000000000001e-115 < b_2

   1. Initial program 20.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 82.2

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

   4. Applied rewrites 82.2%

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

Alternative 8: 53.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -3.55 \cdot 10^{-53}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 1.5 \cdot 10^{-115}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b\_2} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -3.55e-53)
   (/ (- b_2) a)
   (if (<= b_2 1.5e-115) (sqrt (/ (- c) a)) (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.55e-53) {
		tmp = -b_2 / a;
	} else if (b_2 <= 1.5e-115) {
		tmp = sqrt((-c / a));
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-3.55d-53)) then
        tmp = -b_2 / a
    else if (b_2 <= 1.5d-115) then
        tmp = sqrt((-c / a))
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.55e-53) {
		tmp = -b_2 / a;
	} else if (b_2 <= 1.5e-115) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -3.55e-53:
		tmp = -b_2 / a
	elif b_2 <= 1.5e-115:
		tmp = math.sqrt((-c / a))
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -3.55e-53)
		tmp = Float64(Float64(-b_2) / a);
	elseif (b_2 <= 1.5e-115)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -3.55e-53)
		tmp = -b_2 / a;
	elseif (b_2 <= 1.5e-115)
		tmp = sqrt((-c / a));
	else
		tmp = (c / b_2) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -3.55e-53], N[((-b$95$2) / a), $MachinePrecision], If[LessEqual[b$95$2, 1.5e-115], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(c / b$95$2), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -3.5500000000000001e-53

   1. Initial program 68.3%

      \[\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 \frac{\left(-b\_2\right) + \sqrt{\color{blue}{b\_2 \cdot b\_2} - a \cdot c}}{a} \]

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. pow2 N/A

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

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

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 68.4

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

   3. Applied rewrites 68.4%

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

   4. 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}} \]
   5. Step-by-step derivation

      1. lift-neg.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lift-neg.f64 N/A

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

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

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

      9. pow2 N/A

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

      10. lift-neg.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 N/A

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

   6. Applied rewrites 22.4%

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

   7. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. distribute-frac-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lift-/.f64 36.3

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

   9. Applied rewrites 36.3%

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

   if -3.5500000000000001e-53 < b_2 < 1.5000000000000001e-115

   1. Initial program 78.4%

      \[\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 \frac{\left(-b\_2\right) + \sqrt{\color{blue}{b\_2 \cdot b\_2} - a \cdot c}}{a} \]

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. pow2 N/A

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

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

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 78.4

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

   3. Applied rewrites 78.4%

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

   4. Taylor expanded in a around inf

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

      1. lift-neg.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lift-neg.f64 N/A

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

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

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

      9. pow2 N/A

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

      10. lift-neg.f64 N/A

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

      11. sqrt-prod N/A

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

      12. lower-sqrt.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-*r/ N/A

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

      15. mul-1-neg N/A

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

      16. lower-/.f64 N/A

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

   6. Applied rewrites 32.7%

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

   if 1.5000000000000001e-115 < b_2

   1. Initial program 20.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 82.2

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

   4. Applied rewrites 82.2%

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

Alternative 9: 32.1% accurate, 1.2× speedup

Math

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

C

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

   1. Initial program 68.3%

      \[\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 \frac{\left(-b\_2\right) + \sqrt{\color{blue}{b\_2 \cdot b\_2} - a \cdot c}}{a} \]

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. pow2 N/A

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

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

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 68.4

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

   3. Applied rewrites 68.4%

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

   4. 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}} \]
   5. Step-by-step derivation

      1. lift-neg.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lift-neg.f64 N/A

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

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

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

      9. pow2 N/A

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

      10. lift-neg.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 N/A

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

   6. Applied rewrites 22.4%

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

   7. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. distribute-frac-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lift-/.f64 36.3

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

   9. Applied rewrites 36.3%

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

   if -3.5500000000000001e-53 < b_2 < 1.9e6

   1. Initial program 70.2%

      \[\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 \frac{\left(-b\_2\right) + \sqrt{\color{blue}{b\_2 \cdot b\_2} - a \cdot c}}{a} \]

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. pow2 N/A

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

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

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 70.2

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

   3. Applied rewrites 70.2%

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

   4. Taylor expanded in a around inf

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

      1. lift-neg.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lift-neg.f64 N/A

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

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

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

      9. pow2 N/A

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

      10. lift-neg.f64 N/A

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

      11. sqrt-prod N/A

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

      12. lower-sqrt.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-*r/ N/A

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

      15. mul-1-neg N/A

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

      16. lower-/.f64 N/A

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

   6. Applied rewrites 29.4%

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

   if 1.9e6 < b_2

   1. Initial program 13.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 \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. 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) \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-b\_2\right) \cdot \color{blue}{\left(\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. lift-/.f64 30.4

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

   7. Applied rewrites 30.4%

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

Alternative 10: 27.4% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -3.55e-53) (/ (- b_2) a) (sqrt (/ (- c) a))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.55e-53) {
		tmp = -b_2 / a;
	} else {
		tmp = sqrt((-c / a));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-3.55d-53)) then
        tmp = -b_2 / a
    else
        tmp = sqrt((-c / a))
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.55e-53) {
		tmp = -b_2 / a;
	} else {
		tmp = Math.sqrt((-c / a));
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -3.55e-53:
		tmp = -b_2 / a
	else:
		tmp = math.sqrt((-c / a))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -3.55e-53)
		tmp = -b_2 / a;
	else
		tmp = sqrt((-c / a));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -3.55e-53], N[((-b$95$2) / a), $MachinePrecision], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -3.5500000000000001e-53

   1. Initial program 68.3%

      \[\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 \frac{\left(-b\_2\right) + \sqrt{\color{blue}{b\_2 \cdot b\_2} - a \cdot c}}{a} \]

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. pow2 N/A

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

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

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 68.4

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

   3. Applied rewrites 68.4%

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

   4. 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}} \]
   5. Step-by-step derivation

      1. lift-neg.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lift-neg.f64 N/A

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

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

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

      9. pow2 N/A

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

      10. lift-neg.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 N/A

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

   6. Applied rewrites 22.4%

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

   7. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. distribute-frac-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lift-/.f64 36.3

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

   9. Applied rewrites 36.3%

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

   if -3.5500000000000001e-53 < b_2

   1. Initial program 43.7%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. pow2 N/A

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

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

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

      6. mul-1-neg N/A

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

      7. associate-*r* N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. mul-1-neg N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. pow2 N/A

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

      14. lift-*.f64 43.7

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

   3. Applied rewrites 43.7%

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

   4. Taylor expanded in a around inf

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

      1. lift-neg.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. pow2 N/A

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

      5. +-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. lift-neg.f64 N/A

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

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

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

      9. pow2 N/A

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

      10. lift-neg.f64 N/A

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

      11. sqrt-prod N/A

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

      12. lower-sqrt.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-*r/ N/A

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

      15. mul-1-neg N/A

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

      16. lower-/.f64 N/A

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

   6. Applied rewrites 22.7%

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

Alternative 11: 15.1% accurate, 3.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   2. lift-*.f64 N/A

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

   3. lift--.f64 N/A

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

   4. pow2 N/A

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

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

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

   6. mul-1-neg N/A

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

   7. associate-*r* N/A

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

   8. +-commutative N/A

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

   9. associate-*r* N/A

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

   10. mul-1-neg N/A

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

   11. lower-fma.f64 N/A

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

   12. lower-neg.f64 N/A

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

   13. pow2 N/A

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

   14. lift-*.f64 52.1

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

3. Applied rewrites 52.1%

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

4. 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}} \]
5. Step-by-step derivation

   1. lift-neg.f64 N/A

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

   2. lift-neg.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. pow2 N/A

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

   5. +-commutative N/A

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

   6. lift-*.f64 N/A

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

   7. lift-neg.f64 N/A

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

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

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

   9. pow2 N/A

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

   10. lift-neg.f64 N/A

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

   11. +-commutative N/A

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

   12. lower-+.f64 N/A

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

6. Applied rewrites 19.4%

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

7. Taylor expanded in b_2 around inf

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

   1. mul-1-neg N/A

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

   2. distribute-frac-neg N/A

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

   3. lift-neg.f64 N/A

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

   4. lift-/.f64 15.1

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

9. Applied rewrites 15.1%

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

Developer Target 1: 99.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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