quadm (p42, negative)

Percentage Accurate: 51.9% → 84.6%
Time: 4.5s
Alternatives: 9
Speedup: 2.5×

Specification

?
\[\begin{array}{l} \\ \frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \end{array} \]
(FPCore (a b c)
 :precision binary64
 (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))
double code(double a, double b, double c) {
	return (-b - sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}
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
public static double code(double a, double b, double c) {
	return (-b - Math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}
def code(a, b, c):
	return (-b - math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a)
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
function tmp = code(a, b, c)
	tmp = (-b - sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
end
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]
\begin{array}{l}

\\
\frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 9 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 51.9% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \end{array} \]
(FPCore (a b c)
 :precision binary64
 (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))
double code(double a, double b, double c) {
	return (-b - sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}
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
public static double code(double a, double b, double c) {
	return (-b - Math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}
def code(a, b, c):
	return (-b - math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a)
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
function tmp = code(a, b, c)
	tmp = (-b - sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
end
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]
\begin{array}{l}

\\
\frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}
\end{array}

Alternative 1: 84.6% accurate, 0.9× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.7 \cdot 10^{-11}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{-b}\\ \mathbf{elif}\;b \leq 4.3 \cdot 10^{+83}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(b, b, \left(c \cdot a\right) \cdot -4\right)}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]
(FPCore (a b c)
 :precision binary64
 (if (<= b -1.7e-11)
   (/ (* (fma a (/ c (* b b)) 1.0) c) (- b))
   (if (<= b 4.3e+83)
     (/ (- (- b) (sqrt (fma b b (* (* c a) -4.0)))) (+ a a))
     (/ (- b) a))))
double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.7e-11) {
		tmp = (fma(a, (c / (b * b)), 1.0) * c) / -b;
	} else if (b <= 4.3e+83) {
		tmp = (-b - sqrt(fma(b, b, ((c * a) * -4.0)))) / (a + a);
	} else {
		tmp = -b / a;
	}
	return tmp;
}
function code(a, b, c)
	tmp = 0.0
	if (b <= -1.7e-11)
		tmp = Float64(Float64(fma(a, Float64(c / Float64(b * b)), 1.0) * c) / Float64(-b));
	elseif (b <= 4.3e+83)
		tmp = Float64(Float64(Float64(-b) - sqrt(fma(b, b, Float64(Float64(c * a) * -4.0)))) / Float64(a + a));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end
code[a_, b_, c_] := If[LessEqual[b, -1.7e-11], N[(N[(N[(a * N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * c), $MachinePrecision] / (-b)), $MachinePrecision], If[LessEqual[b, 4.3e+83], N[(N[((-b) - N[Sqrt[N[(b * b + N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[((-b) / a), $MachinePrecision]]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;b \leq -1.7 \cdot 10^{-11}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{-b}\\

\mathbf{elif}\;b \leq 4.3 \cdot 10^{+83}:\\
\;\;\;\;\frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(b, b, \left(c \cdot a\right) \cdot -4\right)}}{a + a}\\

\mathbf{else}:\\
\;\;\;\;\frac{-b}{a}\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if b < -1.6999999999999999e-11

    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 b around -inf

      \[\leadsto \color{blue}{-1 \cdot \frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}} \]
    4. Step-by-step derivation
      1. mul-1-negN/A

        \[\leadsto \mathsf{neg}\left(\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}\right) \]
      2. lower-neg.f64N/A

        \[\leadsto -\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b} \]
      3. lower-/.f64N/A

        \[\leadsto -\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b} \]
      4. +-commutativeN/A

        \[\leadsto -\frac{\frac{a \cdot {c}^{2}}{{b}^{2}} + c}{b} \]
      5. associate-/l*N/A

        \[\leadsto -\frac{a \cdot \frac{{c}^{2}}{{b}^{2}} + c}{b} \]
      6. lower-fma.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{{c}^{2}}{{b}^{2}}, c\right)}{b} \]
      7. lower-/.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{{c}^{2}}{{b}^{2}}, c\right)}{b} \]
      8. unpow2N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{{b}^{2}}, c\right)}{b} \]
      9. lower-*.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{{b}^{2}}, c\right)}{b} \]
      10. pow2N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{b \cdot b}, c\right)}{b} \]
      11. lower-*.f6473.3

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{b \cdot b}, c\right)}{b} \]
    5. Applied rewrites73.3%

      \[\leadsto \color{blue}{-\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{b \cdot b}, c\right)}{b}} \]
    6. Taylor expanded in c around 0

      \[\leadsto -\frac{c \cdot \left(1 + \frac{a \cdot c}{{b}^{2}}\right)}{b} \]
    7. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto -\frac{\left(1 + \frac{a \cdot c}{{b}^{2}}\right) \cdot c}{b} \]
      2. lower-*.f64N/A

        \[\leadsto -\frac{\left(1 + \frac{a \cdot c}{{b}^{2}}\right) \cdot c}{b} \]
      3. +-commutativeN/A

        \[\leadsto -\frac{\left(\frac{a \cdot c}{{b}^{2}} + 1\right) \cdot c}{b} \]
      4. associate-/l*N/A

        \[\leadsto -\frac{\left(a \cdot \frac{c}{{b}^{2}} + 1\right) \cdot c}{b} \]
      5. lower-fma.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c}{{b}^{2}}, 1\right) \cdot c}{b} \]
      6. lower-/.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c}{{b}^{2}}, 1\right) \cdot c}{b} \]
      7. pow2N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{b} \]
      8. lower-*.f6491.4

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{b} \]
    8. Applied rewrites91.4%

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

    if -1.6999999999999999e-11 < b < 4.3e83

    1. Initial program 77.5%

      \[\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. lower-/.f64N/A

        \[\leadsto \color{blue}{\frac{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}} \]
      2. lower--.f64N/A

        \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      3. lower-neg.f64N/A

        \[\leadsto \frac{\color{blue}{\left(-b\right)} - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      4. lower-sqrt.f64N/A

        \[\leadsto \frac{\left(-b\right) - \color{blue}{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      5. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2}} - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      6. fp-cancel-sub-sign-invN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      7. metadata-evalN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{{b}^{2} + \color{blue}{-4} \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      8. +-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}}{2 \cdot a} \]
      9. associate-*r*N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\left(-4 \cdot a\right) \cdot c} + {b}^{2}}}{2 \cdot a} \]
      10. lower-fma.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\mathsf{fma}\left(-4 \cdot a, c, {b}^{2}\right)}}}{2 \cdot a} \]
      11. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(\color{blue}{-4 \cdot a}, c, {b}^{2}\right)}}{2 \cdot a} \]
      12. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      13. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      14. lower-*.f6477.5

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

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

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

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

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(-4 \cdot a\right) \cdot c + \color{blue}{{b}^{2}}}}{a + a} \]
      2. associate-*r*N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)} + {b}^{2}}}{a + a} \]
      3. +-commutativeN/A

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{b \cdot b} + -4 \cdot \left(a \cdot c\right)}}{a + a} \]
      5. lower-fma.f64N/A

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(b, b, \color{blue}{\left(a \cdot c\right) \cdot -4}\right)}}{a + a} \]
      7. lower-*.f64N/A

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

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

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

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

    if 4.3e83 < b

    1. Initial program 58.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{b}{a}} \]
    4. Step-by-step derivation
      1. associate-*r/N/A

        \[\leadsto \frac{-1 \cdot b}{\color{blue}{a}} \]
      2. mul-1-negN/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{a} \]
      3. lower-/.f64N/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{\color{blue}{a}} \]
      4. lower-neg.f6491.4

        \[\leadsto \frac{-b}{a} \]
    5. Applied rewrites91.4%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
  3. Recombined 3 regimes into one program.
  4. Final simplification85.3%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.7 \cdot 10^{-11}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{-b}\\ \mathbf{elif}\;b \leq 4.3 \cdot 10^{+83}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(b, b, \left(c \cdot a\right) \cdot -4\right)}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
  5. Add Preprocessing

Alternative 2: 79.9% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.7 \cdot 10^{-11}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{-b}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-53}:\\ \;\;\;\;\frac{b + \sqrt{\left(c \cdot a\right) \cdot -4}}{\left(-a\right) - a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]
(FPCore (a b c)
 :precision binary64
 (if (<= b -1.7e-11)
   (/ (* (fma a (/ c (* b b)) 1.0) c) (- b))
   (if (<= b 2.6e-53)
     (/ (+ b (sqrt (* (* c a) -4.0))) (- (- a) a))
     (/ (- b) a))))
double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.7e-11) {
		tmp = (fma(a, (c / (b * b)), 1.0) * c) / -b;
	} else if (b <= 2.6e-53) {
		tmp = (b + sqrt(((c * a) * -4.0))) / (-a - a);
	} else {
		tmp = -b / a;
	}
	return tmp;
}
function code(a, b, c)
	tmp = 0.0
	if (b <= -1.7e-11)
		tmp = Float64(Float64(fma(a, Float64(c / Float64(b * b)), 1.0) * c) / Float64(-b));
	elseif (b <= 2.6e-53)
		tmp = Float64(Float64(b + sqrt(Float64(Float64(c * a) * -4.0))) / Float64(Float64(-a) - a));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end
code[a_, b_, c_] := If[LessEqual[b, -1.7e-11], N[(N[(N[(a * N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] * c), $MachinePrecision] / (-b)), $MachinePrecision], If[LessEqual[b, 2.6e-53], N[(N[(b + N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[((-a) - a), $MachinePrecision]), $MachinePrecision], N[((-b) / a), $MachinePrecision]]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;b \leq -1.7 \cdot 10^{-11}:\\
\;\;\;\;\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{-b}\\

\mathbf{elif}\;b \leq 2.6 \cdot 10^{-53}:\\
\;\;\;\;\frac{b + \sqrt{\left(c \cdot a\right) \cdot -4}}{\left(-a\right) - a}\\

\mathbf{else}:\\
\;\;\;\;\frac{-b}{a}\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if b < -1.6999999999999999e-11

    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 b around -inf

      \[\leadsto \color{blue}{-1 \cdot \frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}} \]
    4. Step-by-step derivation
      1. mul-1-negN/A

        \[\leadsto \mathsf{neg}\left(\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}\right) \]
      2. lower-neg.f64N/A

        \[\leadsto -\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b} \]
      3. lower-/.f64N/A

        \[\leadsto -\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b} \]
      4. +-commutativeN/A

        \[\leadsto -\frac{\frac{a \cdot {c}^{2}}{{b}^{2}} + c}{b} \]
      5. associate-/l*N/A

        \[\leadsto -\frac{a \cdot \frac{{c}^{2}}{{b}^{2}} + c}{b} \]
      6. lower-fma.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{{c}^{2}}{{b}^{2}}, c\right)}{b} \]
      7. lower-/.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{{c}^{2}}{{b}^{2}}, c\right)}{b} \]
      8. unpow2N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{{b}^{2}}, c\right)}{b} \]
      9. lower-*.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{{b}^{2}}, c\right)}{b} \]
      10. pow2N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{b \cdot b}, c\right)}{b} \]
      11. lower-*.f6473.3

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{b \cdot b}, c\right)}{b} \]
    5. Applied rewrites73.3%

      \[\leadsto \color{blue}{-\frac{\mathsf{fma}\left(a, \frac{c \cdot c}{b \cdot b}, c\right)}{b}} \]
    6. Taylor expanded in c around 0

      \[\leadsto -\frac{c \cdot \left(1 + \frac{a \cdot c}{{b}^{2}}\right)}{b} \]
    7. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto -\frac{\left(1 + \frac{a \cdot c}{{b}^{2}}\right) \cdot c}{b} \]
      2. lower-*.f64N/A

        \[\leadsto -\frac{\left(1 + \frac{a \cdot c}{{b}^{2}}\right) \cdot c}{b} \]
      3. +-commutativeN/A

        \[\leadsto -\frac{\left(\frac{a \cdot c}{{b}^{2}} + 1\right) \cdot c}{b} \]
      4. associate-/l*N/A

        \[\leadsto -\frac{\left(a \cdot \frac{c}{{b}^{2}} + 1\right) \cdot c}{b} \]
      5. lower-fma.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c}{{b}^{2}}, 1\right) \cdot c}{b} \]
      6. lower-/.f64N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c}{{b}^{2}}, 1\right) \cdot c}{b} \]
      7. pow2N/A

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{b} \]
      8. lower-*.f6491.4

        \[\leadsto -\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{b} \]
    8. Applied rewrites91.4%

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

    if -1.6999999999999999e-11 < b < 2.59999999999999996e-53

    1. Initial program 70.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. lower-/.f64N/A

        \[\leadsto \color{blue}{\frac{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}} \]
      2. lower--.f64N/A

        \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      3. lower-neg.f64N/A

        \[\leadsto \frac{\color{blue}{\left(-b\right)} - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      4. lower-sqrt.f64N/A

        \[\leadsto \frac{\left(-b\right) - \color{blue}{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      5. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2}} - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      6. fp-cancel-sub-sign-invN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      7. metadata-evalN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{{b}^{2} + \color{blue}{-4} \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      8. +-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}}{2 \cdot a} \]
      9. associate-*r*N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\left(-4 \cdot a\right) \cdot c} + {b}^{2}}}{2 \cdot a} \]
      10. lower-fma.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\mathsf{fma}\left(-4 \cdot a, c, {b}^{2}\right)}}}{2 \cdot a} \]
      11. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(\color{blue}{-4 \cdot a}, c, {b}^{2}\right)}}{2 \cdot a} \]
      12. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      13. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      14. lower-*.f6470.8

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

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

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

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

      \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)}}{\color{blue}{a + a}} \]
    7. Taylor expanded in a around inf

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{a + a} \]
      2. *-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{a + a} \]
      3. *-commutativeN/A

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

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{a + a} \]
      6. *-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(a \cdot c\right) \cdot \color{blue}{-4}}}{a + a} \]
      7. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(a \cdot c\right) \cdot \color{blue}{-4}}}{a + a} \]
      8. *-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(c \cdot a\right) \cdot -4}}{a + a} \]
      9. lower-*.f6467.1

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(c \cdot a\right) \cdot -4}}{a + a} \]
    9. Applied rewrites67.1%

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

    if 2.59999999999999996e-53 < b

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

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
    4. Step-by-step derivation
      1. associate-*r/N/A

        \[\leadsto \frac{-1 \cdot b}{\color{blue}{a}} \]
      2. mul-1-negN/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{a} \]
      3. lower-/.f64N/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{\color{blue}{a}} \]
      4. lower-neg.f6490.7

        \[\leadsto \frac{-b}{a} \]
    5. Applied rewrites90.7%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
  3. Recombined 3 regimes into one program.
  4. Final simplification82.9%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.7 \cdot 10^{-11}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right) \cdot c}{-b}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-53}:\\ \;\;\;\;\frac{b + \sqrt{\left(c \cdot a\right) \cdot -4}}{\left(-a\right) - a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
  5. Add Preprocessing

Alternative 3: 80.0% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.7 \cdot 10^{-11}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-53}:\\ \;\;\;\;\frac{b + \sqrt{\left(c \cdot a\right) \cdot -4}}{\left(-a\right) - a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]
(FPCore (a b c)
 :precision binary64
 (if (<= b -1.7e-11)
   (/ c (- b))
   (if (<= b 2.6e-53)
     (/ (+ b (sqrt (* (* c a) -4.0))) (- (- a) a))
     (/ (- b) a))))
double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.7e-11) {
		tmp = c / -b;
	} else if (b <= 2.6e-53) {
		tmp = (b + sqrt(((c * a) * -4.0))) / (-a - a);
	} else {
		tmp = -b / a;
	}
	return tmp;
}
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-11)) then
        tmp = c / -b
    else if (b <= 2.6d-53) then
        tmp = (b + sqrt(((c * a) * (-4.0d0)))) / (-a - a)
    else
        tmp = -b / a
    end if
    code = tmp
end function
public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.7e-11) {
		tmp = c / -b;
	} else if (b <= 2.6e-53) {
		tmp = (b + Math.sqrt(((c * a) * -4.0))) / (-a - a);
	} else {
		tmp = -b / a;
	}
	return tmp;
}
def code(a, b, c):
	tmp = 0
	if b <= -1.7e-11:
		tmp = c / -b
	elif b <= 2.6e-53:
		tmp = (b + math.sqrt(((c * a) * -4.0))) / (-a - a)
	else:
		tmp = -b / a
	return tmp
function code(a, b, c)
	tmp = 0.0
	if (b <= -1.7e-11)
		tmp = Float64(c / Float64(-b));
	elseif (b <= 2.6e-53)
		tmp = Float64(Float64(b + sqrt(Float64(Float64(c * a) * -4.0))) / Float64(Float64(-a) - a));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end
function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.7e-11)
		tmp = c / -b;
	elseif (b <= 2.6e-53)
		tmp = (b + sqrt(((c * a) * -4.0))) / (-a - a);
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end
code[a_, b_, c_] := If[LessEqual[b, -1.7e-11], N[(c / (-b)), $MachinePrecision], If[LessEqual[b, 2.6e-53], N[(N[(b + N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[((-a) - a), $MachinePrecision]), $MachinePrecision], N[((-b) / a), $MachinePrecision]]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;b \leq -1.7 \cdot 10^{-11}:\\
\;\;\;\;\frac{c}{-b}\\

\mathbf{elif}\;b \leq 2.6 \cdot 10^{-53}:\\
\;\;\;\;\frac{b + \sqrt{\left(c \cdot a\right) \cdot -4}}{\left(-a\right) - a}\\

\mathbf{else}:\\
\;\;\;\;\frac{-b}{a}\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if b < -1.6999999999999999e-11

    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 b around -inf

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

        \[\leadsto \mathsf{neg}\left(\frac{c}{b}\right) \]
      2. lower-neg.f64N/A

        \[\leadsto -\frac{c}{b} \]
      3. lower-/.f6491.0

        \[\leadsto -\frac{c}{b} \]
    5. Applied rewrites91.0%

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

    if -1.6999999999999999e-11 < b < 2.59999999999999996e-53

    1. Initial program 70.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. lower-/.f64N/A

        \[\leadsto \color{blue}{\frac{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}} \]
      2. lower--.f64N/A

        \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      3. lower-neg.f64N/A

        \[\leadsto \frac{\color{blue}{\left(-b\right)} - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      4. lower-sqrt.f64N/A

        \[\leadsto \frac{\left(-b\right) - \color{blue}{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      5. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2}} - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      6. fp-cancel-sub-sign-invN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      7. metadata-evalN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{{b}^{2} + \color{blue}{-4} \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      8. +-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}}{2 \cdot a} \]
      9. associate-*r*N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\left(-4 \cdot a\right) \cdot c} + {b}^{2}}}{2 \cdot a} \]
      10. lower-fma.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\mathsf{fma}\left(-4 \cdot a, c, {b}^{2}\right)}}}{2 \cdot a} \]
      11. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(\color{blue}{-4 \cdot a}, c, {b}^{2}\right)}}{2 \cdot a} \]
      12. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      13. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      14. lower-*.f6470.8

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

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

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

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

      \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)}}{\color{blue}{a + a}} \]
    7. Taylor expanded in a around inf

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{a + a} \]
      2. *-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{a + a} \]
      3. *-commutativeN/A

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

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{a + a} \]
      6. *-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(a \cdot c\right) \cdot \color{blue}{-4}}}{a + a} \]
      7. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(a \cdot c\right) \cdot \color{blue}{-4}}}{a + a} \]
      8. *-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(c \cdot a\right) \cdot -4}}{a + a} \]
      9. lower-*.f6467.1

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(c \cdot a\right) \cdot -4}}{a + a} \]
    9. Applied rewrites67.1%

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

    if 2.59999999999999996e-53 < b

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

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
    4. Step-by-step derivation
      1. associate-*r/N/A

        \[\leadsto \frac{-1 \cdot b}{\color{blue}{a}} \]
      2. mul-1-negN/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{a} \]
      3. lower-/.f64N/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{\color{blue}{a}} \]
      4. lower-neg.f6490.7

        \[\leadsto \frac{-b}{a} \]
    5. Applied rewrites90.7%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
  3. Recombined 3 regimes into one program.
  4. Final simplification82.8%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.7 \cdot 10^{-11}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-53}:\\ \;\;\;\;\frac{b + \sqrt{\left(c \cdot a\right) \cdot -4}}{\left(-a\right) - a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
  5. Add Preprocessing

Alternative 4: 72.2% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.9 \cdot 10^{-159}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 5 \cdot 10^{-269}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{elif}\;b \leq 1.85 \cdot 10^{-93}:\\ \;\;\;\;\sqrt{\frac{c}{a} \cdot -4} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]
(FPCore (a b c)
 :precision binary64
 (if (<= b -2.9e-159)
   (/ c (- b))
   (if (<= b 5e-269)
     (sqrt (/ (- c) a))
     (if (<= b 1.85e-93) (* (sqrt (* (/ c a) -4.0)) -0.5) (/ (- b) a)))))
double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-159) {
		tmp = c / -b;
	} else if (b <= 5e-269) {
		tmp = sqrt((-c / a));
	} else if (b <= 1.85e-93) {
		tmp = sqrt(((c / a) * -4.0)) * -0.5;
	} else {
		tmp = -b / a;
	}
	return tmp;
}
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 <= (-2.9d-159)) then
        tmp = c / -b
    else if (b <= 5d-269) then
        tmp = sqrt((-c / a))
    else if (b <= 1.85d-93) then
        tmp = sqrt(((c / a) * (-4.0d0))) * (-0.5d0)
    else
        tmp = -b / a
    end if
    code = tmp
end function
public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-159) {
		tmp = c / -b;
	} else if (b <= 5e-269) {
		tmp = Math.sqrt((-c / a));
	} else if (b <= 1.85e-93) {
		tmp = Math.sqrt(((c / a) * -4.0)) * -0.5;
	} else {
		tmp = -b / a;
	}
	return tmp;
}
def code(a, b, c):
	tmp = 0
	if b <= -2.9e-159:
		tmp = c / -b
	elif b <= 5e-269:
		tmp = math.sqrt((-c / a))
	elif b <= 1.85e-93:
		tmp = math.sqrt(((c / a) * -4.0)) * -0.5
	else:
		tmp = -b / a
	return tmp
function code(a, b, c)
	tmp = 0.0
	if (b <= -2.9e-159)
		tmp = Float64(c / Float64(-b));
	elseif (b <= 5e-269)
		tmp = sqrt(Float64(Float64(-c) / a));
	elseif (b <= 1.85e-93)
		tmp = Float64(sqrt(Float64(Float64(c / a) * -4.0)) * -0.5);
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end
function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2.9e-159)
		tmp = c / -b;
	elseif (b <= 5e-269)
		tmp = sqrt((-c / a));
	elseif (b <= 1.85e-93)
		tmp = sqrt(((c / a) * -4.0)) * -0.5;
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end
code[a_, b_, c_] := If[LessEqual[b, -2.9e-159], N[(c / (-b)), $MachinePrecision], If[LessEqual[b, 5e-269], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], If[LessEqual[b, 1.85e-93], N[(N[Sqrt[N[(N[(c / a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] * -0.5), $MachinePrecision], N[((-b) / a), $MachinePrecision]]]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;b \leq -2.9 \cdot 10^{-159}:\\
\;\;\;\;\frac{c}{-b}\\

\mathbf{elif}\;b \leq 5 \cdot 10^{-269}:\\
\;\;\;\;\sqrt{\frac{-c}{a}}\\

\mathbf{elif}\;b \leq 1.85 \cdot 10^{-93}:\\
\;\;\;\;\sqrt{\frac{c}{a} \cdot -4} \cdot -0.5\\

\mathbf{else}:\\
\;\;\;\;\frac{-b}{a}\\


\end{array}
\end{array}
Derivation
  1. Split input into 4 regimes
  2. if b < -2.8999999999999999e-159

    1. Initial program 22.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{c}{b}} \]
    4. Step-by-step derivation
      1. mul-1-negN/A

        \[\leadsto \mathsf{neg}\left(\frac{c}{b}\right) \]
      2. lower-neg.f64N/A

        \[\leadsto -\frac{c}{b} \]
      3. lower-/.f6483.3

        \[\leadsto -\frac{c}{b} \]
    5. Applied rewrites83.3%

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

    if -2.8999999999999999e-159 < b < 4.99999999999999979e-269

    1. Initial program 78.3%

      \[\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. lower-/.f64N/A

        \[\leadsto \color{blue}{\frac{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}} \]
      2. lower--.f64N/A

        \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      3. lower-neg.f64N/A

        \[\leadsto \frac{\color{blue}{\left(-b\right)} - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      4. lower-sqrt.f64N/A

        \[\leadsto \frac{\left(-b\right) - \color{blue}{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      5. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2}} - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      6. fp-cancel-sub-sign-invN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      7. metadata-evalN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{{b}^{2} + \color{blue}{-4} \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      8. +-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}}{2 \cdot a} \]
      9. associate-*r*N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\left(-4 \cdot a\right) \cdot c} + {b}^{2}}}{2 \cdot a} \]
      10. lower-fma.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\mathsf{fma}\left(-4 \cdot a, c, {b}^{2}\right)}}}{2 \cdot a} \]
      11. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(\color{blue}{-4 \cdot a}, c, {b}^{2}\right)}}{2 \cdot a} \]
      12. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      13. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      14. lower-*.f6478.3

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

      \[\leadsto \color{blue}{\frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)}}{2 \cdot a}} \]
    5. Taylor expanded in a around -inf

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

        \[\leadsto \color{blue}{\sqrt{\frac{c}{a}}} \cdot \sqrt{-1} \]
      2. pow2N/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      3. +-commutativeN/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      4. associate-*r*N/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      5. metadata-evalN/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      6. fp-cancel-sub-sign-invN/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      7. pow2N/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      8. div-subN/A

        \[\leadsto \color{blue}{\sqrt{\frac{c}{a}}} \cdot \sqrt{-1} \]
      9. sqrt-unprodN/A

        \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]
      10. *-commutativeN/A

        \[\leadsto \sqrt{-1 \cdot \frac{c}{a}} \]
      11. lower-sqrt.f64N/A

        \[\leadsto \sqrt{-1 \cdot \frac{c}{a}} \]
      12. associate-*r/N/A

        \[\leadsto \sqrt{\frac{-1 \cdot c}{a}} \]
    7. Applied rewrites45.8%

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

    if 4.99999999999999979e-269 < b < 1.85000000000000001e-93

    1. Initial program 68.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 inf

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

        \[\leadsto \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-4}\right) \cdot \color{blue}{\frac{-1}{2}} \]
      2. lower-*.f64N/A

        \[\leadsto \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-4}\right) \cdot \color{blue}{\frac{-1}{2}} \]
      3. sqrt-unprodN/A

        \[\leadsto \sqrt{\frac{c}{a} \cdot -4} \cdot \frac{-1}{2} \]
      4. lower-sqrt.f64N/A

        \[\leadsto \sqrt{\frac{c}{a} \cdot -4} \cdot \frac{-1}{2} \]
      5. lower-*.f64N/A

        \[\leadsto \sqrt{\frac{c}{a} \cdot -4} \cdot \frac{-1}{2} \]
      6. lower-/.f6452.1

        \[\leadsto \sqrt{\frac{c}{a} \cdot -4} \cdot -0.5 \]
    5. Applied rewrites52.1%

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

    if 1.85000000000000001e-93 < b

    1. Initial program 73.4%

      \[\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{b}{a}} \]
    4. Step-by-step derivation
      1. associate-*r/N/A

        \[\leadsto \frac{-1 \cdot b}{\color{blue}{a}} \]
      2. mul-1-negN/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{a} \]
      3. lower-/.f64N/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{\color{blue}{a}} \]
      4. lower-neg.f6487.7

        \[\leadsto \frac{-b}{a} \]
    5. Applied rewrites87.7%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
  3. Recombined 4 regimes into one program.
  4. Final simplification76.0%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.9 \cdot 10^{-159}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 5 \cdot 10^{-269}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{elif}\;b \leq 1.85 \cdot 10^{-93}:\\ \;\;\;\;\sqrt{\frac{c}{a} \cdot -4} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
  5. Add Preprocessing

Alternative 5: 79.8% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5.6 \cdot 10^{-145}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-53}:\\ \;\;\;\;\frac{-\sqrt{\left(-4 \cdot a\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]
(FPCore (a b c)
 :precision binary64
 (if (<= b -5.6e-145)
   (/ c (- b))
   (if (<= b 2.6e-53) (/ (- (sqrt (* (* -4.0 a) c))) (+ a a)) (/ (- b) a))))
double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.6e-145) {
		tmp = c / -b;
	} else if (b <= 2.6e-53) {
		tmp = -sqrt(((-4.0 * a) * c)) / (a + a);
	} else {
		tmp = -b / a;
	}
	return tmp;
}
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-145)) then
        tmp = c / -b
    else if (b <= 2.6d-53) then
        tmp = -sqrt((((-4.0d0) * a) * c)) / (a + a)
    else
        tmp = -b / a
    end if
    code = tmp
end function
public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.6e-145) {
		tmp = c / -b;
	} else if (b <= 2.6e-53) {
		tmp = -Math.sqrt(((-4.0 * a) * c)) / (a + a);
	} else {
		tmp = -b / a;
	}
	return tmp;
}
def code(a, b, c):
	tmp = 0
	if b <= -5.6e-145:
		tmp = c / -b
	elif b <= 2.6e-53:
		tmp = -math.sqrt(((-4.0 * a) * c)) / (a + a)
	else:
		tmp = -b / a
	return tmp
function code(a, b, c)
	tmp = 0.0
	if (b <= -5.6e-145)
		tmp = Float64(c / Float64(-b));
	elseif (b <= 2.6e-53)
		tmp = Float64(Float64(-sqrt(Float64(Float64(-4.0 * a) * c))) / Float64(a + a));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end
function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5.6e-145)
		tmp = c / -b;
	elseif (b <= 2.6e-53)
		tmp = -sqrt(((-4.0 * a) * c)) / (a + a);
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end
code[a_, b_, c_] := If[LessEqual[b, -5.6e-145], N[(c / (-b)), $MachinePrecision], If[LessEqual[b, 2.6e-53], N[((-N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision]) / N[(a + a), $MachinePrecision]), $MachinePrecision], N[((-b) / a), $MachinePrecision]]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;b \leq -5.6 \cdot 10^{-145}:\\
\;\;\;\;\frac{c}{-b}\\

\mathbf{elif}\;b \leq 2.6 \cdot 10^{-53}:\\
\;\;\;\;\frac{-\sqrt{\left(-4 \cdot a\right) \cdot c}}{a + a}\\

\mathbf{else}:\\
\;\;\;\;\frac{-b}{a}\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if b < -5.6000000000000002e-145

    1. Initial program 21.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{c}{b}} \]
    4. Step-by-step derivation
      1. mul-1-negN/A

        \[\leadsto \mathsf{neg}\left(\frac{c}{b}\right) \]
      2. lower-neg.f64N/A

        \[\leadsto -\frac{c}{b} \]
      3. lower-/.f6484.8

        \[\leadsto -\frac{c}{b} \]
    5. Applied rewrites84.8%

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

    if -5.6000000000000002e-145 < b < 2.59999999999999996e-53

    1. Initial program 74.6%

      \[\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. lower-/.f64N/A

        \[\leadsto \color{blue}{\frac{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}} \]
      2. lower--.f64N/A

        \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      3. lower-neg.f64N/A

        \[\leadsto \frac{\color{blue}{\left(-b\right)} - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      4. lower-sqrt.f64N/A

        \[\leadsto \frac{\left(-b\right) - \color{blue}{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      5. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2}} - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      6. fp-cancel-sub-sign-invN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      7. metadata-evalN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{{b}^{2} + \color{blue}{-4} \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      8. +-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}}{2 \cdot a} \]
      9. associate-*r*N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\left(-4 \cdot a\right) \cdot c} + {b}^{2}}}{2 \cdot a} \]
      10. lower-fma.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\mathsf{fma}\left(-4 \cdot a, c, {b}^{2}\right)}}}{2 \cdot a} \]
      11. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(\color{blue}{-4 \cdot a}, c, {b}^{2}\right)}}{2 \cdot a} \]
      12. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      13. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      14. lower-*.f6474.6

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

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

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

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

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{\left(-4 \cdot a\right) \cdot c + \color{blue}{{b}^{2}}}}{a + a} \]
      2. associate-*r*N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)} + {b}^{2}}}{a + a} \]
      3. +-commutativeN/A

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{b \cdot b} + -4 \cdot \left(a \cdot c\right)}}{a + a} \]
      5. lower-fma.f64N/A

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

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(b, b, \color{blue}{\left(a \cdot c\right) \cdot -4}\right)}}{a + a} \]
      7. lower-*.f64N/A

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

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

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

      \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\mathsf{fma}\left(b, b, \left(c \cdot a\right) \cdot -4\right)}}}{a + a} \]
    9. Taylor expanded in a around inf

      \[\leadsto \frac{\color{blue}{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}}{a + a} \]
    10. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto \frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a} \]
      2. *-commutativeN/A

        \[\leadsto \frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a} \]
      3. pow2N/A

        \[\leadsto \frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a} \]
      4. metadata-evalN/A

        \[\leadsto \frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a} \]
      5. fp-cancel-sub-sign-invN/A

        \[\leadsto \frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a} \]
      6. pow2N/A

        \[\leadsto \frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a} \]
      7. mul-1-negN/A

        \[\leadsto \frac{\mathsf{neg}\left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a} \]
      8. lower-neg.f64N/A

        \[\leadsto \frac{-\sqrt{a \cdot c} \cdot \sqrt{-4}}{a + a} \]
      9. sqrt-unprodN/A

        \[\leadsto \frac{-\sqrt{\left(a \cdot c\right) \cdot -4}}{a + a} \]
      10. *-commutativeN/A

        \[\leadsto \frac{-\sqrt{-4 \cdot \left(a \cdot c\right)}}{a + a} \]
      11. lower-sqrt.f64N/A

        \[\leadsto \frac{-\sqrt{-4 \cdot \left(a \cdot c\right)}}{a + a} \]
      12. associate-*r*N/A

        \[\leadsto \frac{-\sqrt{\left(-4 \cdot a\right) \cdot c}}{a + a} \]
      13. lower-*.f64N/A

        \[\leadsto \frac{-\sqrt{\left(-4 \cdot a\right) \cdot c}}{a + a} \]
      14. lower-*.f6469.8

        \[\leadsto \frac{-\sqrt{\left(-4 \cdot a\right) \cdot c}}{a + a} \]
    11. Applied rewrites69.8%

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

    if 2.59999999999999996e-53 < b

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

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
    4. Step-by-step derivation
      1. associate-*r/N/A

        \[\leadsto \frac{-1 \cdot b}{\color{blue}{a}} \]
      2. mul-1-negN/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{a} \]
      3. lower-/.f64N/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{\color{blue}{a}} \]
      4. lower-neg.f6490.7

        \[\leadsto \frac{-b}{a} \]
    5. Applied rewrites90.7%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
  3. Recombined 3 regimes into one program.
  4. Final simplification82.4%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5.6 \cdot 10^{-145}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 2.6 \cdot 10^{-53}:\\ \;\;\;\;\frac{-\sqrt{\left(-4 \cdot a\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
  5. Add Preprocessing

Alternative 6: 72.1% accurate, 1.4× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.9 \cdot 10^{-159}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 1.9 \cdot 10^{-70}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]
(FPCore (a b c)
 :precision binary64
 (if (<= b -2.9e-159)
   (/ c (- b))
   (if (<= b 1.9e-70) (sqrt (/ (- c) a)) (/ (- b) a))))
double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-159) {
		tmp = c / -b;
	} else if (b <= 1.9e-70) {
		tmp = sqrt((-c / a));
	} else {
		tmp = -b / a;
	}
	return tmp;
}
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 <= (-2.9d-159)) then
        tmp = c / -b
    else if (b <= 1.9d-70) then
        tmp = sqrt((-c / a))
    else
        tmp = -b / a
    end if
    code = tmp
end function
public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-159) {
		tmp = c / -b;
	} else if (b <= 1.9e-70) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = -b / a;
	}
	return tmp;
}
def code(a, b, c):
	tmp = 0
	if b <= -2.9e-159:
		tmp = c / -b
	elif b <= 1.9e-70:
		tmp = math.sqrt((-c / a))
	else:
		tmp = -b / a
	return tmp
function code(a, b, c)
	tmp = 0.0
	if (b <= -2.9e-159)
		tmp = Float64(c / Float64(-b));
	elseif (b <= 1.9e-70)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end
function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2.9e-159)
		tmp = c / -b;
	elseif (b <= 1.9e-70)
		tmp = sqrt((-c / a));
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end
code[a_, b_, c_] := If[LessEqual[b, -2.9e-159], N[(c / (-b)), $MachinePrecision], If[LessEqual[b, 1.9e-70], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[((-b) / a), $MachinePrecision]]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;b \leq -2.9 \cdot 10^{-159}:\\
\;\;\;\;\frac{c}{-b}\\

\mathbf{elif}\;b \leq 1.9 \cdot 10^{-70}:\\
\;\;\;\;\sqrt{\frac{-c}{a}}\\

\mathbf{else}:\\
\;\;\;\;\frac{-b}{a}\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if b < -2.8999999999999999e-159

    1. Initial program 22.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{c}{b}} \]
    4. Step-by-step derivation
      1. mul-1-negN/A

        \[\leadsto \mathsf{neg}\left(\frac{c}{b}\right) \]
      2. lower-neg.f64N/A

        \[\leadsto -\frac{c}{b} \]
      3. lower-/.f6483.3

        \[\leadsto -\frac{c}{b} \]
    5. Applied rewrites83.3%

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

    if -2.8999999999999999e-159 < b < 1.8999999999999999e-70

    1. Initial program 72.7%

      \[\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. lower-/.f64N/A

        \[\leadsto \color{blue}{\frac{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}} \]
      2. lower--.f64N/A

        \[\leadsto \frac{\color{blue}{\left(\mathsf{neg}\left(b\right)\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      3. lower-neg.f64N/A

        \[\leadsto \frac{\color{blue}{\left(-b\right)} - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      4. lower-sqrt.f64N/A

        \[\leadsto \frac{\left(-b\right) - \color{blue}{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      5. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2}} - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      6. fp-cancel-sub-sign-invN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{{b}^{2} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]
      7. metadata-evalN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{{b}^{2} + \color{blue}{-4} \cdot \left(a \cdot c\right)}}{2 \cdot a} \]
      8. +-commutativeN/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right) + {b}^{2}}}}{2 \cdot a} \]
      9. associate-*r*N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\left(-4 \cdot a\right) \cdot c} + {b}^{2}}}{2 \cdot a} \]
      10. lower-fma.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\color{blue}{\mathsf{fma}\left(-4 \cdot a, c, {b}^{2}\right)}}}{2 \cdot a} \]
      11. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(\color{blue}{-4 \cdot a}, c, {b}^{2}\right)}}{2 \cdot a} \]
      12. pow2N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      13. lower-*.f64N/A

        \[\leadsto \frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, \color{blue}{b \cdot b}\right)}}{2 \cdot a} \]
      14. lower-*.f6472.7

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

      \[\leadsto \color{blue}{\frac{\left(-b\right) - \sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)}}{2 \cdot a}} \]
    5. Taylor expanded in a around -inf

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

        \[\leadsto \color{blue}{\sqrt{\frac{c}{a}}} \cdot \sqrt{-1} \]
      2. pow2N/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      3. +-commutativeN/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      4. associate-*r*N/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      5. metadata-evalN/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      6. fp-cancel-sub-sign-invN/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      7. pow2N/A

        \[\leadsto \sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]
      8. div-subN/A

        \[\leadsto \color{blue}{\sqrt{\frac{c}{a}}} \cdot \sqrt{-1} \]
      9. sqrt-unprodN/A

        \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]
      10. *-commutativeN/A

        \[\leadsto \sqrt{-1 \cdot \frac{c}{a}} \]
      11. lower-sqrt.f64N/A

        \[\leadsto \sqrt{-1 \cdot \frac{c}{a}} \]
      12. associate-*r/N/A

        \[\leadsto \sqrt{\frac{-1 \cdot c}{a}} \]
    7. Applied rewrites38.4%

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

    if 1.8999999999999999e-70 < b

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

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
    4. Step-by-step derivation
      1. associate-*r/N/A

        \[\leadsto \frac{-1 \cdot b}{\color{blue}{a}} \]
      2. mul-1-negN/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{a} \]
      3. lower-/.f64N/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{\color{blue}{a}} \]
      4. lower-neg.f6488.8

        \[\leadsto \frac{-b}{a} \]
    5. Applied rewrites88.8%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
  3. Recombined 3 regimes into one program.
  4. Final simplification73.3%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.9 \cdot 10^{-159}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{elif}\;b \leq 1.9 \cdot 10^{-70}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
  5. Add Preprocessing

Alternative 7: 68.1% accurate, 2.5× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1 \cdot 10^{-288}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]
(FPCore (a b c)
 :precision binary64
 (if (<= b -1e-288) (/ c (- b)) (/ (- b) a)))
double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-288) {
		tmp = c / -b;
	} else {
		tmp = -b / a;
	}
	return tmp;
}
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 <= (-1d-288)) then
        tmp = c / -b
    else
        tmp = -b / a
    end if
    code = tmp
end function
public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-288) {
		tmp = c / -b;
	} else {
		tmp = -b / a;
	}
	return tmp;
}
def code(a, b, c):
	tmp = 0
	if b <= -1e-288:
		tmp = c / -b
	else:
		tmp = -b / a
	return tmp
function code(a, b, c)
	tmp = 0.0
	if (b <= -1e-288)
		tmp = Float64(c / Float64(-b));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end
function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1e-288)
		tmp = c / -b;
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end
code[a_, b_, c_] := If[LessEqual[b, -1e-288], N[(c / (-b)), $MachinePrecision], N[((-b) / a), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;b \leq -1 \cdot 10^{-288}:\\
\;\;\;\;\frac{c}{-b}\\

\mathbf{else}:\\
\;\;\;\;\frac{-b}{a}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if b < -1.00000000000000006e-288

    1. Initial program 31.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 b around -inf

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

        \[\leadsto \mathsf{neg}\left(\frac{c}{b}\right) \]
      2. lower-neg.f64N/A

        \[\leadsto -\frac{c}{b} \]
      3. lower-/.f6471.4

        \[\leadsto -\frac{c}{b} \]
    5. Applied rewrites71.4%

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

    if -1.00000000000000006e-288 < b

    1. Initial program 72.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 a around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
    4. Step-by-step derivation
      1. associate-*r/N/A

        \[\leadsto \frac{-1 \cdot b}{\color{blue}{a}} \]
      2. mul-1-negN/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{a} \]
      3. lower-/.f64N/A

        \[\leadsto \frac{\mathsf{neg}\left(b\right)}{\color{blue}{a}} \]
      4. lower-neg.f6461.9

        \[\leadsto \frac{-b}{a} \]
    5. Applied rewrites61.9%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification66.7%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1 \cdot 10^{-288}:\\ \;\;\;\;\frac{c}{-b}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
  5. Add Preprocessing

Alternative 8: 34.5% accurate, 3.6× speedup?

\[\begin{array}{l} \\ \frac{c}{-b} \end{array} \]
(FPCore (a b c) :precision binary64 (/ c (- b)))
double code(double a, double b, double c) {
	return c / -b;
}
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 = c / -b
end function
public static double code(double a, double b, double c) {
	return c / -b;
}
def code(a, b, c):
	return c / -b
function code(a, b, c)
	return Float64(c / Float64(-b))
end
function tmp = code(a, b, c)
	tmp = c / -b;
end
code[a_, b_, c_] := N[(c / (-b)), $MachinePrecision]
\begin{array}{l}

\\
\frac{c}{-b}
\end{array}
Derivation
  1. Initial program 52.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 b around -inf

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

      \[\leadsto \mathsf{neg}\left(\frac{c}{b}\right) \]
    2. lower-neg.f64N/A

      \[\leadsto -\frac{c}{b} \]
    3. lower-/.f6437.0

      \[\leadsto -\frac{c}{b} \]
  5. Applied rewrites37.0%

    \[\leadsto \color{blue}{-\frac{c}{b}} \]
  6. Final simplification37.0%

    \[\leadsto \frac{c}{-b} \]
  7. Add Preprocessing

Alternative 9: 10.5% accurate, 4.2× speedup?

\[\begin{array}{l} \\ \frac{c}{b} \end{array} \]
(FPCore (a b c) :precision binary64 (/ c b))
double code(double a, double b, double c) {
	return c / b;
}
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 = c / b
end function
public static double code(double a, double b, double c) {
	return c / b;
}
def code(a, b, c):
	return c / b
function code(a, b, c)
	return Float64(c / b)
end
function tmp = code(a, b, c)
	tmp = c / b;
end
code[a_, b_, c_] := N[(c / b), $MachinePrecision]
\begin{array}{l}

\\
\frac{c}{b}
\end{array}
Derivation
  1. Initial program 52.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 c around 0

    \[\leadsto \color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}} \]
  4. Step-by-step derivation
    1. *-commutativeN/A

      \[\leadsto \frac{b}{a} \cdot -1 + \frac{\color{blue}{c}}{b} \]
    2. lower-fma.f64N/A

      \[\leadsto \mathsf{fma}\left(\frac{b}{a}, \color{blue}{-1}, \frac{c}{b}\right) \]
    3. lower-/.f64N/A

      \[\leadsto \mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right) \]
    4. lower-/.f6432.0

      \[\leadsto \mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right) \]
  5. Applied rewrites32.0%

    \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)} \]
  6. Taylor expanded in a around inf

    \[\leadsto \frac{c}{\color{blue}{b}} \]
  7. Step-by-step derivation
    1. lower-/.f6411.4

      \[\leadsto \frac{c}{b} \]
  8. Applied rewrites11.4%

    \[\leadsto \frac{c}{\color{blue}{b}} \]
  9. Add Preprocessing

Developer Target 1: 99.7% accurate, 0.2× speedup?

\[\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{c}{t\_2 - \frac{b}{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{b}{2} + t\_2}{-a}\\ \end{array} \end{array} \]
(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) (/ c (- t_2 (/ b 2.0))) (/ (+ (/ b 2.0) t_2) (- a)))))
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 = c / (t_2 - (b / 2.0));
	} else {
		tmp_1 = ((b / 2.0) + t_2) / -a;
	}
	return tmp_1;
}
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 = c / (t_2 - (b / 2.0));
	} else {
		tmp_1 = ((b / 2.0) + t_2) / -a;
	}
	return tmp_1;
}
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 = c / (t_2 - (b / 2.0))
	else:
		tmp_1 = ((b / 2.0) + t_2) / -a
	return tmp_1
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(c / Float64(t_2 - Float64(b / 2.0)));
	else
		tmp_1 = Float64(Float64(Float64(b / 2.0) + t_2) / Float64(-a));
	end
	return tmp_1
end
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 = c / (t_2 - (b / 2.0));
	else
		tmp_2 = ((b / 2.0) + t_2) / -a;
	end
	tmp_3 = tmp_2;
end
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[(c / N[(t$95$2 - N[(b / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / 2.0), $MachinePrecision] + t$95$2), $MachinePrecision] / (-a)), $MachinePrecision]]]]]
\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{c}{t\_2 - \frac{b}{2}}\\

\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{2} + t\_2}{-a}\\


\end{array}
\end{array}

Reproduce

?
herbie shell --seed 2025044 
(FPCore (a b c)
  :name "quadm (p42, negative)"
  :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) (/ c (- sqtD (/ b 2))) (/ (+ (/ b 2) sqtD) (- a)))))

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