quadp (p42, positive)

Percentage Accurate: 52.7% → 86.7%

Time: 7.7s

Alternatives: 7

Speedup: 2.5×

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

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{+164}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 1.56 \cdot 10^{-71}:\\ \;\;\;\;\frac{\left(-b\right) + \sqrt{\mathsf{fma}\left(-4 \cdot c, a, b \cdot b\right)}}{a + a}\\ \mathbf{elif}\;b \leq 8.2 \cdot 10^{+31}:\\ \;\;\;\;\frac{\frac{-4 \cdot \left(a \cdot c\right)}{\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} + b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e+164)
   (/ (- b) a)
   (if (<= b 1.56e-71)
     (/ (+ (- b) (sqrt (fma (* -4.0 c) a (* b b)))) (+ a a))
     (if (<= b 8.2e+31)
       (/
        (/ (* -4.0 (* a c)) (+ (sqrt (fma -4.0 (* c a) (* b b))) b))
        (* 2.0 a))
       (/ (- c) b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e+164) {
		tmp = -b / a;
	} else if (b <= 1.56e-71) {
		tmp = (-b + sqrt(fma((-4.0 * c), a, (b * b)))) / (a + a);
	} else if (b <= 8.2e+31) {
		tmp = ((-4.0 * (a * c)) / (sqrt(fma(-4.0, (c * a), (b * b))) + b)) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.8e+164)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 1.56e-71)
		tmp = Float64(Float64(Float64(-b) + sqrt(fma(Float64(-4.0 * c), a, Float64(b * b)))) / Float64(a + a));
	elseif (b <= 8.2e+31)
		tmp = Float64(Float64(Float64(-4.0 * Float64(a * c)) / Float64(sqrt(fma(-4.0, Float64(c * a), Float64(b * b))) + b)) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.8e+164], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 1.56e-71], N[(N[((-b) + N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 8.2e+31], N[(N[(N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if b < -4.80000000000000021e164

   1. Initial program 45.9%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -4.80000000000000021e164 < b < 1.56e-71

   1. Initial program 79.9%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

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

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

      4. +-commutative N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 80.0

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

   4. Applied rewrites 80.0%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 80.0

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

   6. Applied rewrites 80.0%

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

   if 1.56e-71 < b < 8.2000000000000003e31

   1. Initial program 45.3%

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

   4. Applied rewrites 44.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 89.1

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

   7. Applied rewrites 89.1%

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

   if 8.2000000000000003e31 < b

   1. Initial program 16.3%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 96.0

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

   5. Applied rewrites 96.0%

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

Alternative 2: 85.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e+164)
   (/ (- b) a)
   (if (<= b 5.4e-32)
     (/ (+ (- b) (sqrt (fma (* -4.0 c) a (* b b)))) (+ a a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e+164) {
		tmp = -b / a;
	} else if (b <= 5.4e-32) {
		tmp = (-b + sqrt(fma((-4.0 * c), a, (b * b)))) / (a + a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.8e+164)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 5.4e-32)
		tmp = Float64(Float64(Float64(-b) + sqrt(fma(Float64(-4.0 * c), a, Float64(b * b)))) / Float64(a + a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.8e+164], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 5.4e-32], N[(N[((-b) + N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.80000000000000021e164

   1. Initial program 45.9%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -4.80000000000000021e164 < b < 5.39999999999999962e-32

   1. Initial program 78.8%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

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

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

      4. +-commutative N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*r* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 78.8

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

   4. Applied rewrites 78.8%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 78.8

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

   6. Applied rewrites 78.8%

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

   if 5.39999999999999962e-32 < b

   1. Initial program 18.6%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 92.4

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

   5. Applied rewrites 92.4%

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

Alternative 3: 80.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{-87}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 3.6 \cdot 10^{-35}:\\ \;\;\;\;\frac{\left(-b\right) + \sqrt{\left(c \cdot a\right) \cdot -4}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -8e-87)
   (- (/ c b) (/ b a))
   (if (<= b 3.6e-35)
     (/ (+ (- b) (sqrt (* (* c a) -4.0))) (* 2.0 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -8e-87) {
		tmp = (c / b) - (b / a);
	} else if (b <= 3.6e-35) {
		tmp = (-b + sqrt(((c * a) * -4.0))) / (2.0 * 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 <= (-8d-87)) then
        tmp = (c / b) - (b / a)
    else if (b <= 3.6d-35) then
        tmp = (-b + sqrt(((c * a) * (-4.0d0)))) / (2.0d0 * 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 <= -8e-87) {
		tmp = (c / b) - (b / a);
	} else if (b <= 3.6e-35) {
		tmp = (-b + Math.sqrt(((c * a) * -4.0))) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -8e-87:
		tmp = (c / b) - (b / a)
	elif b <= 3.6e-35:
		tmp = (-b + math.sqrt(((c * a) * -4.0))) / (2.0 * a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -8e-87)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 3.6e-35)
		tmp = Float64(Float64(Float64(-b) + sqrt(Float64(Float64(c * a) * -4.0))) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -8e-87)
		tmp = (c / b) - (b / a);
	elseif (b <= 3.6e-35)
		tmp = (-b + sqrt(((c * a) * -4.0))) / (2.0 * a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -8e-87], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 3.6e-35], N[(N[((-b) + N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -8.00000000000000014e-87

   1. Initial program 77.8%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-/.f64 90.5

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

   5. Applied rewrites 90.5%

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

   6. Taylor expanded in c around 0

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

   8. Applied rewrites 90.5%

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

   if -8.00000000000000014e-87 < b < 3.60000000000000019e-35

   1. Initial program 63.0%

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

   3. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 61.0

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

   5. Applied rewrites 61.0%

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

   if 3.60000000000000019e-35 < b

   1. Initial program 18.6%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 92.4

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

   5. Applied rewrites 92.4%

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

Alternative 4: 67.8% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5e-310) (- (/ c b) (/ b a)) (/ (- c) b)))

C

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

Python

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

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5e-310)
		tmp = Float64(Float64(c / b) - 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 <= -5e-310)
		tmp = (c / b) - (b / a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

   1. Initial program 76.9%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. lower-fma.f64 N/A

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

      7. associate-*r/ N/A

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

      8. mul-1-neg N/A

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

      9. lower-/.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-/.f64 74.0

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

   5. Applied rewrites 74.0%

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

   6. Taylor expanded in c around 0

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

   8. Applied rewrites 75.0%

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

   if -4.999999999999985e-310 < b

   1. Initial program 31.7%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 71.3

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

   5. Applied rewrites 71.3%

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

Alternative 5: 67.4% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 1.7e-222) (/ (- b) a) (/ (- c) b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 1.7e-222) {
		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 <= 1.7d-222) 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 <= 1.7e-222) {
		tmp = -b / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

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

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 1.7e-222)
		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 <= 1.7e-222)
		tmp = -b / a;
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.7000000000000001e-222

   1. Initial program 76.1%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 68.7

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

   5. Applied rewrites 68.7%

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

   if 1.7000000000000001e-222 < b

   1. Initial program 28.2%

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

   3. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 78.1

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

   5. Applied rewrites 78.1%

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

Alternative 6: 43.6% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 4.5 \cdot 10^{-136}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 4.5e-136) (/ (- b) a) 0.0))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 4.5e-136) {
		tmp = -b / a;
	} else {
		tmp = 0.0;
	}
	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 <= 4.5d-136) then
        tmp = -b / a
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(a, b, c):
	tmp = 0
	if b <= 4.5e-136:
		tmp = -b / a
	else:
		tmp = 0.0
	return tmp

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 4.5e-136], N[((-b) / a), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if b < 4.49999999999999972e-136

   1. Initial program 73.5%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 63.5

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

   5. Applied rewrites 63.5%

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

   if 4.49999999999999972e-136 < b

   1. Initial program 26.4%

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

   4. Applied rewrites 17.0%

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

   5. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

         \[\leadsto \frac{\frac{1}{4} \cdot \left(\color{blue}{0} \cdot {b}^{2}\right)}{a \cdot b} \]

      4. mul0-lft N/A

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

      5. metadata-eval N/A

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

      6. mul0-lft N/A

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

      7. metadata-eval N/A

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

      8. distribute-lft1-in N/A

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

      9. associate-/r* N/A

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

      10. div-add N/A

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

      11. associate-*r/ N/A

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

      12. distribute-lft1-in N/A

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

      13. metadata-eval N/A

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

      14. mul0-lft N/A

          \[\leadsto \frac{\color{blue}{0}}{b} \]

      15. mul0-lft N/A

          \[\leadsto \frac{\color{blue}{0 \cdot {b}^{2}}}{b} \]

      16. metadata-eval N/A

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

      17. distribute-lft1-in N/A

          \[\leadsto \frac{\color{blue}{-1 \cdot {b}^{2} + {b}^{2}}}{b} \]

      18. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{-1 \cdot {b}^{2} + {b}^{2}}{b}} \]

      19. distribute-lft1-in N/A

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

      20. metadata-eval N/A

          \[\leadsto \frac{\color{blue}{0} \cdot {b}^{2}}{b} \]

      21. mul0-lft 26.6

          \[\leadsto \frac{\color{blue}{0}}{b} \]

   7. Applied rewrites 26.6%

      \[\leadsto \color{blue}{\frac{0}{b}} \]

   8. Taylor expanded in b around 0

      \[\leadsto 0 \]
   9. Step-by-step derivation

   10. Applied rewrites 26.6%

       \[\leadsto 0 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 11.6% accurate, 50.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 0.0)

C

double code(double a, double b, double c) {
	return 0.0;
}

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 = 0.0d0
end function

Java

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

Python

def code(a, b, c):
	return 0.0

Julia

function code(a, b, c)
	return 0.0
end

MATLAB

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

Wolfram

code[a_, b_, c_] := 0.0

Derivation

1. Initial program 53.8%

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

4. Applied rewrites 23.8%

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

5. Taylor expanded in a around 0

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

   1. associate-*r/ N/A

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

   2. distribute-lft1-in N/A

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

   3. metadata-eval N/A

      \[\leadsto \frac{\frac{1}{4} \cdot \left(\color{blue}{0} \cdot {b}^{2}\right)}{a \cdot b} \]

   4. mul0-lft N/A

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

   5. metadata-eval N/A

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

   6. mul0-lft N/A

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

   7. metadata-eval N/A

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

   8. distribute-lft1-in N/A

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

   9. associate-/r* N/A

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

   10. div-add N/A

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

   11. associate-*r/ N/A

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

   12. distribute-lft1-in N/A

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

   13. metadata-eval N/A

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

   14. mul0-lft N/A

       \[\leadsto \frac{\color{blue}{0}}{b} \]

   15. mul0-lft N/A

       \[\leadsto \frac{\color{blue}{0 \cdot {b}^{2}}}{b} \]

   16. metadata-eval N/A

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

   17. distribute-lft1-in N/A

       \[\leadsto \frac{\color{blue}{-1 \cdot {b}^{2} + {b}^{2}}}{b} \]

   18. lower-/.f64 N/A

       \[\leadsto \color{blue}{\frac{-1 \cdot {b}^{2} + {b}^{2}}{b}} \]

   19. distribute-lft1-in N/A

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

   20. metadata-eval N/A

       \[\leadsto \frac{\color{blue}{0} \cdot {b}^{2}}{b} \]

   21. mul0-lft 12.8

       \[\leadsto \frac{\color{blue}{0}}{b} \]

7. Applied rewrites 12.8%

   \[\leadsto \color{blue}{\frac{0}{b}} \]

8. Taylor expanded in b around 0

   \[\leadsto 0 \]
9. Step-by-step derivation

10. Applied rewrites 12.8%

    \[\leadsto 0 \]
11. Add Preprocessing

Developer Target 1: 99.7% accurate, 0.2× 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 2024358 
(FPCore (a b c)
  :name "quadp (p42, positive)"
  :precision binary64
  :herbie-expected 10

  :alt
  (! :herbie-platform default (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)))