quadp (p42, positive)

Percentage Accurate: 52.3% → 85.3%

Time: 3.6s

Alternatives: 8

Speedup: 2.7×

Specification

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * 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, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - (4.0d0 * (a * c))))) / (2.0d0 * a)
end function

Java

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

Python

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

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))) / Float64(2.0 * a))
end

MATLAB

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

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 52.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * 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, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - (4.0d0 * (a * c))))) / (2.0d0 * a)
end function

Java

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

Python

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

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))) / Float64(2.0 * a))
end

MATLAB

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

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 85.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.4 \cdot 10^{+118}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 8.8 \cdot 10^{-44}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + \left(-b\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.4e+118)
   (/ (- b) a)
   (if (<= b 8.8e-44)
     (/ (+ (sqrt (fma (* -4.0 a) c (* b b))) (- b)) (+ a a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.4e+118) {
		tmp = -b / a;
	} else if (b <= 8.8e-44) {
		tmp = (sqrt(fma((-4.0 * a), c, (b * b))) + -b) / (a + a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.4e+118)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 8.8e-44)
		tmp = Float64(Float64(sqrt(fma(Float64(-4.0 * a), c, Float64(b * b))) + Float64(-b)) / Float64(a + a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.4e+118], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 8.8e-44], N[(N[(N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + (-b)), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.39999999999999993e118

   1. Initial program 51.3%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 97.2

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

   4. Applied rewrites 97.2%

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

   if -1.39999999999999993e118 < b < 8.80000000000000048e-44

   1. Initial program 78.7%

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

   3. Applied rewrites 78.7%

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

   if 8.80000000000000048e-44 < b

   1. Initial program 17.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 87.6

         \[\leadsto \frac{-c}{b} \]

   4. Applied rewrites 87.6%

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

Alternative 2: 80.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5.6 \cdot 10^{-90}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 8.8 \cdot 10^{-44}:\\ \;\;\;\;\frac{\sqrt{\left(a \cdot -4\right) \cdot c} + \left(-b\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5.6e-90)
   (/ (- b) a)
   (if (<= b 8.8e-44)
     (/ (+ (sqrt (* (* a -4.0) c)) (- b)) (+ a a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.6e-90) {
		tmp = -b / a;
	} else if (b <= 8.8e-44) {
		tmp = (sqrt(((a * -4.0) * c)) + -b) / (a + a);
	} else {
		tmp = -c / b;
	}
	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, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-5.6d-90)) then
        tmp = -b / a
    else if (b <= 8.8d-44) then
        tmp = (sqrt(((a * (-4.0d0)) * c)) + -b) / (a + a)
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.6e-90) {
		tmp = -b / a;
	} else if (b <= 8.8e-44) {
		tmp = (Math.sqrt(((a * -4.0) * c)) + -b) / (a + a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5.6e-90:
		tmp = -b / a
	elif b <= 8.8e-44:
		tmp = (math.sqrt(((a * -4.0) * c)) + -b) / (a + a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5.6e-90)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 8.8e-44)
		tmp = Float64(Float64(sqrt(Float64(Float64(a * -4.0) * c)) + Float64(-b)) / Float64(a + a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5.6e-90)
		tmp = -b / a;
	elseif (b <= 8.8e-44)
		tmp = (sqrt(((a * -4.0) * c)) + -b) / (a + a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5.6e-90], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 8.8e-44], N[(N[(N[Sqrt[N[(N[(a * -4.0), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision] + (-b)), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.5999999999999998e-90

   1. Initial program 70.4%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 84.8

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

   4. Applied rewrites 84.8%

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

   if -5.5999999999999998e-90 < b < 8.80000000000000048e-44

   1. Initial program 71.0%

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

   3. Applied rewrites 71.0%

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

   4. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 66.3

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

   6. Applied rewrites 66.3%

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

   if 8.80000000000000048e-44 < b

   1. Initial program 17.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 87.6

         \[\leadsto \frac{-c}{b} \]

   4. Applied rewrites 87.6%

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

Alternative 3: 80.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5.6 \cdot 10^{-90}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 8.8 \cdot 10^{-44}:\\ \;\;\;\;\frac{\mathsf{fma}\left(-0.5, b, \sqrt{\left(a \cdot c\right) \cdot -1}\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5.6e-90)
   (/ (- b) a)
   (if (<= b 8.8e-44) (/ (fma -0.5 b (sqrt (* (* a c) -1.0))) a) (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.6e-90) {
		tmp = -b / a;
	} else if (b <= 8.8e-44) {
		tmp = fma(-0.5, b, sqrt(((a * c) * -1.0))) / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5.6e-90)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 8.8e-44)
		tmp = Float64(fma(-0.5, b, sqrt(Float64(Float64(a * c) * -1.0))) / a);
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5.6e-90], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 8.8e-44], N[(N[(-0.5 * b + N[Sqrt[N[(N[(a * c), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.5999999999999998e-90

   1. Initial program 70.4%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 84.8

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

   4. Applied rewrites 84.8%

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

   if -5.5999999999999998e-90 < b < 8.80000000000000048e-44

   1. Initial program 71.0%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sqrt-unprod N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 31.1

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

   4. Applied rewrites 31.1%

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

   5. Taylor expanded in a around -inf

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. sqrt-prod N/A

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

      5. lower-sqrt.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lower-neg.f64 31.1

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

   7. Applied rewrites 31.1%

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

   8. Taylor expanded in a around 0

      \[\leadsto \frac{\frac{-1}{2} \cdot b + \sqrt{a \cdot c} \cdot \sqrt{-1}}{a} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower-fma.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 66.3

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

   10. Applied rewrites 66.3%

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

   if 8.80000000000000048e-44 < b

   1. Initial program 17.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 87.6

         \[\leadsto \frac{-c}{b} \]

   4. Applied rewrites 87.6%

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

Alternative 4: 80.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.5 \cdot 10^{-90}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 8.8 \cdot 10^{-44}:\\ \;\;\;\;\frac{\sqrt{\left(a \cdot -4\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.5e-90)
   (/ (- b) a)
   (if (<= b 8.8e-44) (/ (sqrt (* (* a -4.0) c)) (+ a a)) (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.5e-90) {
		tmp = -b / a;
	} else if (b <= 8.8e-44) {
		tmp = sqrt(((a * -4.0) * c)) / (a + a);
	} else {
		tmp = -c / b;
	}
	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, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-3.5d-90)) then
        tmp = -b / a
    else if (b <= 8.8d-44) then
        tmp = sqrt(((a * (-4.0d0)) * c)) / (a + a)
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -3.5e-90) {
		tmp = -b / a;
	} else if (b <= 8.8e-44) {
		tmp = Math.sqrt(((a * -4.0) * c)) / (a + a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -3.5e-90:
		tmp = -b / a
	elif b <= 8.8e-44:
		tmp = math.sqrt(((a * -4.0) * c)) / (a + a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3.5e-90)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 8.8e-44)
		tmp = Float64(sqrt(Float64(Float64(a * -4.0) * c)) / Float64(a + a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -3.5e-90)
		tmp = -b / a;
	elseif (b <= 8.8e-44)
		tmp = sqrt(((a * -4.0) * c)) / (a + a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.5e-90], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 8.8e-44], N[(N[Sqrt[N[(N[(a * -4.0), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.4999999999999999e-90

   1. Initial program 70.4%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 84.8

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

   4. Applied rewrites 84.8%

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

   if -3.4999999999999999e-90 < b < 8.80000000000000048e-44

   1. Initial program 71.0%

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

   2. Taylor expanded in a around inf

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

      1. sqrt-unprod N/A

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

      2. *-commutative N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 65.2

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

   4. Applied rewrites 65.2%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 65.2

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

      8. lower-*.f64 N/A

         \[\leadsto \frac{\sqrt{\left(a \cdot -4\right) \cdot c}}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{\sqrt{\left(a \cdot -4\right) \cdot c}}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto \frac{\sqrt{\left(a \cdot -4\right) \cdot c}}{\mathsf{Rewrite<=}\left(lift-+.f64, \left(a + a\right)\right)} \]

   6. Applied rewrites 65.2%

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

   if 8.80000000000000048e-44 < b

   1. Initial program 17.3%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 87.6

         \[\leadsto \frac{-c}{b} \]

   4. Applied rewrites 87.6%

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

Alternative 5: 73.4% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.65 \cdot 10^{-104}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 1.65 \cdot 10^{-130}:\\ \;\;\;\;\frac{\sqrt{-c}}{\sqrt{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.65e-104)
   (/ (- b) a)
   (if (<= b 1.65e-130) (/ (sqrt (- c)) (sqrt a)) (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.65e-104) {
		tmp = -b / a;
	} else if (b <= 1.65e-130) {
		tmp = sqrt(-c) / sqrt(a);
	} else {
		tmp = -c / b;
	}
	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, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-1.65d-104)) then
        tmp = -b / a
    else if (b <= 1.65d-130) then
        tmp = sqrt(-c) / sqrt(a)
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.65e-104) {
		tmp = -b / a;
	} else if (b <= 1.65e-130) {
		tmp = Math.sqrt(-c) / Math.sqrt(a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.65e-104:
		tmp = -b / a
	elif b <= 1.65e-130:
		tmp = math.sqrt(-c) / math.sqrt(a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.65e-104)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 1.65e-130)
		tmp = Float64(sqrt(Float64(-c)) / sqrt(a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.65e-104)
		tmp = -b / a;
	elseif (b <= 1.65e-130)
		tmp = sqrt(-c) / sqrt(a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.65e-104], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 1.65e-130], N[(N[Sqrt[(-c)], $MachinePrecision] / N[Sqrt[a], $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.65000000000000001e-104

   1. Initial program 70.8%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 83.5

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

   4. Applied rewrites 83.5%

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

   if -1.65000000000000001e-104 < b < 1.6499999999999999e-130

   1. Initial program 74.9%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sqrt-unprod N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 33.5

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

   4. Applied rewrites 33.5%

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

   5. Taylor expanded in a around -inf

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

      1. sqrt-prod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 32.9

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

   7. Applied rewrites 32.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. sqrt-div N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 43.6

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

   9. Applied rewrites 43.6%

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

   if 1.6499999999999999e-130 < b

   1. Initial program 22.6%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 80.7

         \[\leadsto \frac{-c}{b} \]

   4. Applied rewrites 80.7%

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

Alternative 6: 70.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3 \cdot 10^{-201}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 1.65 \cdot 10^{-130}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3e-201)
   (/ (- b) a)
   (if (<= b 1.65e-130) (sqrt (/ (- c) a)) (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -3e-201) {
		tmp = -b / a;
	} else if (b <= 1.65e-130) {
		tmp = sqrt((-c / a));
	} else {
		tmp = -c / b;
	}
	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, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-3d-201)) then
        tmp = -b / a
    else if (b <= 1.65d-130) then
        tmp = sqrt((-c / a))
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -3e-201) {
		tmp = -b / a;
	} else if (b <= 1.65e-130) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -3e-201:
		tmp = -b / a
	elif b <= 1.65e-130:
		tmp = math.sqrt((-c / a))
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -3e-201)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 1.65e-130)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -3e-201)
		tmp = -b / a;
	elseif (b <= 1.65e-130)
		tmp = sqrt((-c / a));
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3e-201], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 1.65e-130], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.00000000000000002e-201

   1. Initial program 72.4%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 75.7

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

   4. Applied rewrites 75.7%

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

   if -3.00000000000000002e-201 < b < 1.6499999999999999e-130

   1. Initial program 72.3%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sqrt-unprod N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 33.9

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

   4. Applied rewrites 33.9%

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

   5. Taylor expanded in a around -inf

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

      1. sqrt-prod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. lower-/.f64 N/A

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

      7. lower-neg.f64 33.9

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

   7. Applied rewrites 33.9%

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

   if 1.6499999999999999e-130 < b

   1. Initial program 22.6%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 80.7

         \[\leadsto \frac{-c}{b} \]

   4. Applied rewrites 80.7%

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

Alternative 7: 67.3% accurate, 2.7× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 4e-282) (/ (- b) a) (/ (- c) b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 4e-282) {
		tmp = -b / a;
	} else {
		tmp = -c / b;
	}
	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, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= 4d-282) then
        tmp = -b / a
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 4e-282) {
		tmp = -b / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 4e-282:
		tmp = -b / a
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 4e-282)
		tmp = Float64(Float64(-b) / a);
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 4e-282)
		tmp = -b / a;
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 4e-282], N[((-b) / a), $MachinePrecision], N[((-c) / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 4.0000000000000001e-282

   1. Initial program 73.0%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

   if 4.0000000000000001e-282 < b

   1. Initial program 31.0%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 69.2

         \[\leadsto \frac{-c}{b} \]

   4. Applied rewrites 69.2%

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

Alternative 8: 34.5% accurate, 4.6× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return -b / 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, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = -b / a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 52.3%

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

2. Taylor expanded in b around -inf

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

   1. associate-*r/ N/A

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

   2. mul-1-neg N/A

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

   3. lift-neg.f64 N/A

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

   4. lower-/.f64 34.5

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

4. Applied rewrites 34.5%

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

Developer Target 1: 99.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025112 
(FPCore (a b c)
  :name "quadp (p42, 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 0) (/ (- sqtD (/ b 2)) a) (/ (- c) (+ (/ b 2) sqtD)))))

  (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))