quad2p (problem 3.2.1, positive)

Percentage Accurate: 51.9% → 85.0%

Time: 3.7s

Alternatives: 12

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: 51.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.0% accurate, 0.6× speedup

Math

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

C

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

Python

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

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -5e+130)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 2e-167)
		tmp = Float64(Float64(Float64(-b_2) / a) + Float64(sqrt(Float64(Float64(b_2 * b_2) - Float64(c * a))) / 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 <= -5e+130)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 2e-167)
		tmp = (-b_2 / a) + (sqrt(((b_2 * b_2) - (c * a))) / 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, -5e+130], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 2e-167], N[(N[((-b$95$2) / a), $MachinePrecision] + N[(N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(N[(c / b$95$2), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -4.9999999999999996e130

   1. Initial program 48.7%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 97.2

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

   4. Applied rewrites 97.2%

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

   if -4.9999999999999996e130 < b_2 < 2e-167

   1. Initial program 84.9%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. div-add N/A

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

      8. lift-neg.f64 N/A

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

      9. mul-1-neg N/A

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

      10. associate-*r/ N/A

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

      11. lower-+.f64 N/A

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

      12. associate-*r/ N/A

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

      13. mul-1-neg N/A

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

      14. lift-neg.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lower-/.f64 N/A

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

   3. Applied rewrites 84.9%

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

   if 2e-167 < b_2

   1. Initial program 23.0%

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

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

   4. Applied rewrites 79.8%

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

Alternative 2: 85.0% accurate, 0.7× speedup

Math

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

   1. Initial program 48.7%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 97.2

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

   4. Applied rewrites 97.2%

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

   if -4.9999999999999996e130 < b_2 < 2e-167

   1. Initial program 84.9%

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

   if 2e-167 < b_2

   1. Initial program 23.0%

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

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

   4. Applied rewrites 79.8%

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

Alternative 3: 85.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -5 \cdot 10^{+130}:\\ \;\;\;\;\frac{-2 \cdot b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 2 \cdot 10^{-167}:\\ \;\;\;\;\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 -5e+130)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 2e-167)
     (/ (+ (- 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 <= -5e+130) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 2e-167) {
		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 <= -5e+130)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 2e-167)
		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, -5e+130], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 2e-167], 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 < -4.9999999999999996e130

   1. Initial program 48.7%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 97.2

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

   4. Applied rewrites 97.2%

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

   if -4.9999999999999996e130 < b_2 < 2e-167

   1. Initial program 84.9%

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

      1. lift-*.f64 N/A

         \[\leadsto \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 84.9

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

   3. Applied rewrites 84.9%

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

   if 2e-167 < b_2

   1. Initial program 23.0%

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

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

   4. Applied rewrites 79.8%

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

Alternative 4: 79.8% accurate, 0.9× speedup

Math

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

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

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

   4. Applied rewrites 83.8%

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

   if -1.04999999999999999e-104 < b_2 < 2e-167

   1. Initial program 76.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 71.7

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

   4. Applied rewrites 71.7%

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

   if 2e-167 < b_2

   1. Initial program 23.0%

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

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

   4. Applied rewrites 79.8%

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

Alternative 5: 79.5% accurate, 1.0× speedup

Math

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

C

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

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

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

   4. Applied rewrites 83.8%

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

   if -1.04999999999999999e-104 < b_2 < 2e-167

   1. Initial program 76.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 70.5

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

   4. Applied rewrites 70.5%

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

   if 2e-167 < b_2

   1. Initial program 23.0%

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

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

   4. Applied rewrites 79.8%

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

Alternative 6: 73.1% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -4.3e-170)
   (/ (* -2.0 b_2) a)
   (if (<= b_2 1e-162) (- (sqrt (/ (- c) a))) (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.3e-170) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 1e-162) {
		tmp = -sqrt((-c / a));
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-4.3d-170)) then
        tmp = ((-2.0d0) * b_2) / a
    else if (b_2 <= 1d-162) then
        tmp = -sqrt((-c / a))
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -4.3e-170) {
		tmp = (-2.0 * b_2) / a;
	} else if (b_2 <= 1e-162) {
		tmp = -Math.sqrt((-c / a));
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -4.3e-170:
		tmp = (-2.0 * b_2) / a
	elif b_2 <= 1e-162:
		tmp = -math.sqrt((-c / a))
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -4.3e-170)
		tmp = Float64(Float64(-2.0 * b_2) / a);
	elseif (b_2 <= 1e-162)
		tmp = Float64(-sqrt(Float64(Float64(-c) / a)));
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -4.3e-170)
		tmp = (-2.0 * b_2) / a;
	elseif (b_2 <= 1e-162)
		tmp = -sqrt((-c / a));
	else
		tmp = (c / b_2) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -4.3e-170], N[(N[(-2.0 * b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 1e-162], (-N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision]), N[(N[(c / b$95$2), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -4.2999999999999998e-170

   1. Initial program 73.2%

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

   2. Taylor expanded in b_2 around -inf

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

      1. lower-*.f64 78.6

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

   4. Applied rewrites 78.6%

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

   if -4.2999999999999998e-170 < b_2 < 9.99999999999999954e-163

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

      1. lift-neg.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. pow2 N/A

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

      4. +-commutative N/A

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

      5. lift-*.f64 N/A

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

      6. lift-neg.f64 N/A

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

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

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

      8. pow2 N/A

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

      9. mul-1-neg N/A

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

      10. lower-neg.f64 N/A

          \[\leadsto -\sqrt{\frac{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. associate-*l/ N/A

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

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

      17. lower-neg.f64 38.3

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

   6. Applied rewrites 38.3%

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

   if 9.99999999999999954e-163 < b_2

   1. Initial program 22.7%

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

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

   4. Applied rewrites 80.2%

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

Alternative 7: 72.8% accurate, 1.2× speedup

Math

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

C

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

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

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

   4. Applied rewrites 80.5%

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

   if -1.5500000000000001e-147 < b_2 < 2.5999999999999999e-183

   1. Initial program 74.6%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 36.0

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

   4. Applied rewrites 36.0%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 36.0

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

   6. Applied rewrites 36.0%

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

   if 2.5999999999999999e-183 < b_2

   1. Initial program 23.9%

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

   2. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 78.7

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

   4. Applied rewrites 78.7%

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

Alternative 8: 54.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.45 \cdot 10^{-6}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 2.6 \cdot 10^{-183}:\\ \;\;\;\;\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.45e-6)
   (/ (- b_2) a)
   (if (<= b_2 2.6e-183) (sqrt (/ (- c) a)) (* (/ c b_2) -0.5))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.45e-6) {
		tmp = -b_2 / a;
	} else if (b_2 <= 2.6e-183) {
		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.45d-6)) then
        tmp = -b_2 / a
    else if (b_2 <= 2.6d-183) 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.45e-6) {
		tmp = -b_2 / a;
	} else if (b_2 <= 2.6e-183) {
		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.45e-6:
		tmp = -b_2 / a
	elif b_2 <= 2.6e-183:
		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.45e-6)
		tmp = Float64(Float64(-b_2) / a);
	elseif (b_2 <= 2.6e-183)
		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.45e-6)
		tmp = -b_2 / a;
	elseif (b_2 <= 2.6e-183)
		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.45e-6], N[((-b$95$2) / a), $MachinePrecision], If[LessEqual[b$95$2, 2.6e-183], 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.4500000000000001e-6

   1. Initial program 67.5%

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

   2. Taylor expanded in c around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. sqrt-unprod N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. associate-*r/ N/A

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

      10. mul-1-neg N/A

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

      11. lift-neg.f64 N/A

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

      12. lower-/.f64 27.0

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

   4. Applied rewrites 27.0%

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

   5. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 40.0

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

   7. Applied rewrites 40.0%

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

   if -1.4500000000000001e-6 < b_2 < 2.5999999999999999e-183

   1. Initial program 80.9%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 30.8

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

   4. Applied rewrites 30.8%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 30.8

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

   6. Applied rewrites 30.8%

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

   if 2.5999999999999999e-183 < b_2

   1. Initial program 23.9%

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

   2. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 78.7

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

   4. Applied rewrites 78.7%

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

Alternative 9: 54.5% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.45e-6)
   (/ (- b_2) a)
   (if (<= b_2 2.6e-183) (sqrt (/ (- c) a)) (* (/ -0.5 b_2) c))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.45e-6) {
		tmp = -b_2 / a;
	} else if (b_2 <= 2.6e-183) {
		tmp = sqrt((-c / a));
	} else {
		tmp = (-0.5 / b_2) * c;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-1.45d-6)) then
        tmp = -b_2 / a
    else if (b_2 <= 2.6d-183) then
        tmp = sqrt((-c / a))
    else
        tmp = ((-0.5d0) / b_2) * c
    end if
    code = tmp
end function

Java

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

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.45e-6:
		tmp = -b_2 / a
	elif b_2 <= 2.6e-183:
		tmp = math.sqrt((-c / a))
	else:
		tmp = (-0.5 / b_2) * c
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.45e-6)
		tmp = Float64(Float64(-b_2) / a);
	elseif (b_2 <= 2.6e-183)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(-0.5 / b_2) * c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.45e-6)
		tmp = -b_2 / a;
	elseif (b_2 <= 2.6e-183)
		tmp = sqrt((-c / a));
	else
		tmp = (-0.5 / b_2) * c;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.4500000000000001e-6

   1. Initial program 67.5%

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

   2. Taylor expanded in c around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. sqrt-unprod N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. associate-*r/ N/A

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

      10. mul-1-neg N/A

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

      11. lift-neg.f64 N/A

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

      12. lower-/.f64 27.0

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

   4. Applied rewrites 27.0%

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

   5. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 40.0

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

   7. Applied rewrites 40.0%

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

   if -1.4500000000000001e-6 < b_2 < 2.5999999999999999e-183

   1. Initial program 80.9%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 30.8

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

   4. Applied rewrites 30.8%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 30.8

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

   6. Applied rewrites 30.8%

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

   if 2.5999999999999999e-183 < b_2

   1. Initial program 23.9%

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

   2. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. associate-*r/ N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. unpow3 N/A

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

      10. pow2 N/A

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

      11. lower-*.f64 N/A

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

      12. pow2 N/A

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

      13. lift-*.f64 N/A

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

      14. associate-*r/ N/A

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

      15. metadata-eval N/A

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

      16. lower-/.f64 72.2

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

   4. Applied rewrites 72.2%

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

   5. Taylor expanded in a around 0

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

      1. lower-/.f64 78.5

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

   7. Applied rewrites 78.5%

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

Alternative 10: 29.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b\_2 \leq -1.45 \cdot 10^{-6}:\\ \;\;\;\;\frac{-b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq 3.6 \cdot 10^{+114}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;0 \cdot \frac{b\_2}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -1.45e-6)
   (/ (- b_2) a)
   (if (<= b_2 3.6e+114) (sqrt (/ (- c) a)) (* 0.0 (/ b_2 a)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.45e-6) {
		tmp = -b_2 / a;
	} else if (b_2 <= 3.6e+114) {
		tmp = sqrt((-c / a));
	} else {
		tmp = 0.0 * (b_2 / a);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-1.45d-6)) then
        tmp = -b_2 / a
    else if (b_2 <= 3.6d+114) then
        tmp = sqrt((-c / a))
    else
        tmp = 0.0d0 * (b_2 / a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.45e-6) {
		tmp = -b_2 / a;
	} else if (b_2 <= 3.6e+114) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = 0.0 * (b_2 / a);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.45e-6:
		tmp = -b_2 / a
	elif b_2 <= 3.6e+114:
		tmp = math.sqrt((-c / a))
	else:
		tmp = 0.0 * (b_2 / a)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.45e-6)
		tmp = Float64(Float64(-b_2) / a);
	elseif (b_2 <= 3.6e+114)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(0.0 * Float64(b_2 / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.45e-6)
		tmp = -b_2 / a;
	elseif (b_2 <= 3.6e+114)
		tmp = sqrt((-c / a));
	else
		tmp = 0.0 * (b_2 / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -1.45e-6], N[((-b$95$2) / a), $MachinePrecision], If[LessEqual[b$95$2, 3.6e+114], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(0.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.4500000000000001e-6

   1. Initial program 67.5%

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

   2. Taylor expanded in c around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. sqrt-unprod N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. associate-*r/ N/A

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

      10. mul-1-neg N/A

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

      11. lift-neg.f64 N/A

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

      12. lower-/.f64 27.0

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

   4. Applied rewrites 27.0%

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

   5. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 40.0

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

   7. Applied rewrites 40.0%

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

   if -1.4500000000000001e-6 < b_2 < 3.6000000000000001e114

   1. Initial program 61.3%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 25.1

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

   4. Applied rewrites 25.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 25.1

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

   6. Applied rewrites 25.1%

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

   if 3.6000000000000001e114 < b_2

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

      2. lift-+.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. div-add N/A

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

      8. lift-neg.f64 N/A

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

      9. mul-1-neg N/A

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

      10. associate-*r/ N/A

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

      11. lower-+.f64 N/A

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

      12. associate-*r/ N/A

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

      13. mul-1-neg N/A

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

      14. lift-neg.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lower-/.f64 N/A

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

   3. Applied rewrites 4.9%

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

   4. Taylor expanded in a around 0

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

      1. div-add-rev N/A

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

      2. *-commutative N/A

         \[\leadsto \frac{b\_2 + -1 \cdot b\_2}{a} \]

      3. div-add N/A

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

      4. associate-*r/ N/A

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

      5. +-commutative N/A

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

      6. distribute-lft1-in N/A

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

      7. metadata-eval N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 24.1

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

   6. Applied rewrites 24.1%

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

Alternative 11: 27.3% accurate, 1.7× speedup

Math

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

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.45e-6) {
		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 <= (-1.45d-6)) 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 <= -1.45e-6) {
		tmp = -b_2 / a;
	} else {
		tmp = Math.sqrt((-c / a));
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.45e-6:
		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 <= -1.45e-6)
		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 <= -1.45e-6)
		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, -1.45e-6], N[((-b$95$2) / a), $MachinePrecision], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < -1.4500000000000001e-6

   1. Initial program 67.5%

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

   2. Taylor expanded in c around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. sqrt-unprod N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. associate-*r/ N/A

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

      10. mul-1-neg N/A

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

      11. lift-neg.f64 N/A

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

      12. lower-/.f64 27.0

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

   4. Applied rewrites 27.0%

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

   5. Taylor expanded in b_2 around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 40.0

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

   7. Applied rewrites 40.0%

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

   if -1.4500000000000001e-6 < b_2

   1. Initial program 44.8%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 21.6

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

   4. Applied rewrites 21.6%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. *-commutative N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 21.6

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

   6. Applied rewrites 21.6%

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

Alternative 12: 15.5% 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 51.9%

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

2. Taylor expanded in c around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. +-commutative N/A

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

   4. lower-+.f64 N/A

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

   5. sqrt-unprod N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-*.f64 N/A

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

   8. lower-/.f64 N/A

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

   9. associate-*r/ N/A

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

   10. mul-1-neg N/A

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

   11. lift-neg.f64 N/A

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

   12. lower-/.f64 20.4

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

4. Applied rewrites 20.4%

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

5. Taylor expanded in b_2 around inf

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

   1. mul-1-neg N/A

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

   2. lift-neg.f64 15.5

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

7. Applied rewrites 15.5%

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

Developer Target 1: 99.7% 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 2025122 
(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))