jeff quadratic root 1

Percentage Accurate: 71.8% → 90.9%

Time: 4.8s

Alternatives: 17

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* (* 4.0 a) c)))))
   (if (>= b 0.0) (/ (- (- b) t_0) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) t_0)))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_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) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((b * b) - ((4.0d0 * a) * c)))
    if (b >= 0.0d0) then
        tmp = (-b - t_0) / (2.0d0 * a)
    else
        tmp = (2.0d0 * c) / (-b + t_0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - ((4.0 * a) * c)))
	tmp = 0
	if b >= 0.0:
		tmp = (-b - t_0) / (2.0 * a)
	else:
		tmp = (2.0 * c) / (-b + t_0)
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (-b - t_0) / (2.0 * a);
	else
		tmp = (2.0 * c) / (-b + t_0);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$0), $MachinePrecision]), $MachinePrecision]]]

Initial Program: 71.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* (* 4.0 a) c)))))
   (if (>= b 0.0) (/ (- (- b) t_0) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) t_0)))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_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) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((b * b) - ((4.0d0 * a) * c)))
    if (b >= 0.0d0) then
        tmp = (-b - t_0) / (2.0d0 * a)
    else
        tmp = (2.0d0 * c) / (-b + t_0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - ((4.0 * a) * c)))
	tmp = 0
	if b >= 0.0:
		tmp = (-b - t_0) / (2.0 * a)
	else:
		tmp = (2.0 * c) / (-b + t_0)
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (-b - t_0) / (2.0 * a);
	else
		tmp = (2.0 * c) / (-b + t_0);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$0), $MachinePrecision]), $MachinePrecision]]]

Alternative 1: 90.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}\\ t_1 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \leq -1.76 \cdot 10^{+59}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_1}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\left|b\right| \cdot \sqrt{\mathsf{fma}\left(-4 \cdot a, \frac{c}{b \cdot b}, 1\right)} - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.2 \cdot 10^{+100}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{t\_0 + b}{-2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma -4.0 (* c a) (* b b))))
        (t_1 (sqrt (- (* b b) (* (* 4.0 a) c)))))
   (if (<= b -1.76e+59)
     (if (>= b 0.0)
       (/ (- (- b) t_1) (* 2.0 a))
       (/
        (+ c c)
        (- (* (fabs b) (sqrt (fma (* -4.0 a) (/ c (* b b)) 1.0))) b)))
     (if (<= b 1.2e+100)
       (if (>= b 0.0) (/ (+ t_0 b) (* -2.0 a)) (/ (+ c c) (- t_0 b)))
       (if (>= b 0.0) (/ (* -2.0 b) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) t_1)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma(-4.0, (c * a), (b * b)));
	double t_1 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp_1;
	if (b <= -1.76e+59) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - t_1) / (2.0 * a);
		} else {
			tmp_2 = (c + c) / ((fabs(b) * sqrt(fma((-4.0 * a), (c / (b * b)), 1.0))) - b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.2e+100) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (t_0 + b) / (-2.0 * a);
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-b + t_1);
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(-4.0, Float64(c * a), Float64(b * b)))
	t_1 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp_1 = 0.0
	if (b <= -1.76e+59)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-b) - t_1) / Float64(2.0 * a));
		else
			tmp_2 = Float64(Float64(c + c) / Float64(Float64(abs(b) * sqrt(fma(Float64(-4.0 * a), Float64(c / Float64(b * b)), 1.0))) - b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.2e+100)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(t_0 + b) / Float64(-2.0 * a));
		else
			tmp_3 = Float64(Float64(c + c) / Float64(t_0 - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_1));
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -1.76e+59], If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$1), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(N[(N[Abs[b], $MachinePrecision] * N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.2e+100], If[GreaterEqual[b, 0.0], N[(N[(t$95$0 + b), $MachinePrecision] / N[(-2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$1), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.7600000000000001e59

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}}\\ \end{array} \]

      2. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}}\\ \end{array} \]

      3. lift-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      4. lift--.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      5. sub-to-mult N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{\left(1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}\right) \cdot \left(b \cdot b\right)} + \left(-b\right)}\\ \end{array} \]

      6. sqrt-prod N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      7. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      8. rem-sqrt-square-rev N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot \color{blue}{c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \left|b\right| + \left(-b\right)}\\ \end{array} \]

      9. lower-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]

   3. Applied rewrites 73.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \left(a \cdot 4\right) \cdot \frac{c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]
   4. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\mathsf{fma}\left(\sqrt{1 - \left(a \cdot 4\right) \cdot \frac{c}{b \cdot b}}, \left|b\right|, -b\right)}\\ \end{array} \]

      2. sub-flip N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\mathsf{fma}\left(\sqrt{1 + \left(\mathsf{neg}\left(\left(a \cdot 4\right) \cdot \frac{c}{b \cdot b}\right)\right)}, \left|b\right|, -b\right)}\\ \end{array} \]

      3. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\mathsf{fma}\left(\sqrt{\left(\mathsf{neg}\left(\left(a \cdot 4\right) \cdot \frac{c}{b \cdot b}\right)\right) + 1}, \left|b\right|, -b\right)}\\ \end{array} \]

      4. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{\left(\mathsf{neg}\left(\left(a \cdot 4\right) \cdot \frac{c}{b \cdot b}\right)\right) + 1}, \left|b\right|, -b\right)}\\ \end{array} \]

      5. distribute-lft-neg-in N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{\left(\mathsf{neg}\left(a \cdot 4\right)\right) \cdot \frac{c}{b \cdot b} + 1}, \left|b\right|, -b\right)}\\ \end{array} \]

      6. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{\left(\mathsf{neg}\left(a \cdot 4\right)\right) \cdot \frac{c}{b \cdot b} + 1}, \left|b\right|, -b\right)}\\ \end{array} \]

      7. distribute-rgt-neg-in N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{\left(a \cdot \left(\mathsf{neg}\left(4\right)\right)\right) \cdot \frac{c}{b \cdot b} + 1}, \left|b\right|, -b\right)}\\ \end{array} \]

      8. metadata-eval N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{\left(a \cdot -4\right) \cdot \frac{c}{b \cdot b} + 1}, \left|b\right|, -b\right)}\\ \end{array} \]

      9. *-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{\left(-4 \cdot a\right) \cdot \frac{c}{b \cdot b} + 1}, \left|b\right|, -b\right)}\\ \end{array} \]

      10. lift-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{\left(-4 \cdot a\right) \cdot \frac{c}{b \cdot b} + 1}, \left|b\right|, -b\right)}\\ \end{array} \]

      11. *-commutative N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{\frac{c}{b \cdot b} \cdot \left(-4 \cdot a\right) + 1}, \left|b\right|, -b\right)}\\ \end{array} \]

      12. lower-fma.f64 73.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\mathsf{fma}\left(\sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)}, \left|b\right|, -b\right)}\\ \end{array} \]

   5. Applied rewrites 73.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\mathsf{fma}\left(\sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)}, \left|b\right|, -b\right)}\\ \end{array} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)}, \left|b\right|, -b\right)}\\ \end{array} \]

      2. count-2-rev N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\mathsf{fma}\left(\sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)}, \left|b\right|, -b\right)}\\ \end{array} \]

      3. lift-+.f64 73.7

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\mathsf{fma}\left(\sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)}, \left|b\right|, -b\right)}\\ \end{array} \]

      4. lift-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{\sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)} \cdot \left|b\right| + \left(-b\right)}}\\ \end{array} \]

      5. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{\sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)} \cdot \left|b\right| + \left(\mathsf{neg}\left(b\right)\right)}}\\ \end{array} \]

      6. sub-flip-reverse N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{\sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)} \cdot \left|b\right| - b}}\\ \end{array} \]

      7. lower--.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{\sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)} \cdot \left|b\right| - b}}\\ \end{array} \]

      8. *-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{c + c}}{\left|b\right| \cdot \sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)} - b}\\ \end{array} \]

      9. lower-*.f64 73.7

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{c + c}}{\left|b\right| \cdot \sqrt{\mathsf{fma}\left(\frac{c}{b \cdot b}, -4 \cdot a, 1\right)} - b}\\ \end{array} \]

      10. lift-fma.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\left|b\right| \cdot \sqrt{\frac{c}{b \cdot b} \cdot \left(-4 \cdot a\right) + 1} - b}\\ \end{array} \]

      11. *-commutative N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\left|b\right| \cdot \sqrt{\left(-4 \cdot a\right) \cdot \frac{c}{b \cdot b} + 1} - b}\\ \end{array} \]

      12. lower-fma.f64 73.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\left|b\right| \cdot \sqrt{\mathsf{fma}\left(-4 \cdot a, \frac{c}{b \cdot b}, 1\right)} - b}\\ \end{array} \]

   7. Applied rewrites 73.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\left|b\right| \cdot \sqrt{\mathsf{fma}\left(-4 \cdot a, \frac{c}{b \cdot b}, 1\right)} - b}\\ \end{array} \]

   if -1.7600000000000001e59 < b < 1.20000000000000006e100

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Step-by-step derivation

   3. Applied rewrites 71.8%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} + b}{-2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} - b}\\ } \end{array}} \]

   if 1.20000000000000006e100 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 69.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 69.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 90.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}\\ \mathbf{if}\;b \leq -2 \cdot 10^{+154}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(1, \left|b\right|, -b\right)}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.2 \cdot 10^{+100}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{t\_0 + b}{-2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma -4.0 (* c a) (* b b)))))
   (if (<= b -2e+154)
     (if (>= b 0.0)
       (/ (- (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a))
       (/ (* 2.0 c) (fma 1.0 (fabs b) (- b))))
     (if (<= b 1.2e+100)
       (if (>= b 0.0) (/ (+ t_0 b) (* -2.0 a)) (/ (+ c c) (- t_0 b)))
       (if (>= b 0.0)
         (/ (* -2.0 b) (* 2.0 a))
         (/ (* 2.0 c) (* -2.0 (/ (* a c) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma(-4.0, (c * a), (b * b)));
	double tmp_1;
	if (b <= -2e+154) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - sqrt(((b * b) - ((4.0 * a) * c)))) / (2.0 * a);
		} else {
			tmp_2 = (2.0 * c) / fma(1.0, fabs(b), -b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.2e+100) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (t_0 + b) / (-2.0 * a);
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(-4.0, Float64(c * a), Float64(b * b)))
	tmp_1 = 0.0
	if (b <= -2e+154)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-b) - sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))) / Float64(2.0 * a));
		else
			tmp_2 = Float64(Float64(2.0 * c) / fma(1.0, abs(b), Float64(-b)));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.2e+100)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(t_0 + b) / Float64(-2.0 * a));
		else
			tmp_3 = Float64(Float64(c + c) / Float64(t_0 - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -2e+154], If[GreaterEqual[b, 0.0], N[(N[((-b) - N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(1.0 * N[Abs[b], $MachinePrecision] + (-b)), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.2e+100], If[GreaterEqual[b, 0.0], N[(N[(t$95$0 + b), $MachinePrecision] / N[(-2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.00000000000000007e154

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}}\\ \end{array} \]

      2. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}}\\ \end{array} \]

      3. lift-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      4. lift--.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      5. sub-to-mult N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{\left(1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}\right) \cdot \left(b \cdot b\right)} + \left(-b\right)}\\ \end{array} \]

      6. sqrt-prod N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      7. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      8. rem-sqrt-square-rev N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot \color{blue}{c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \left|b\right| + \left(-b\right)}\\ \end{array} \]

      9. lower-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]

   3. Applied rewrites 73.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \left(a \cdot 4\right) \cdot \frac{c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]

   4. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\mathsf{fma}\left(1, \left|b\right|, -b\right)}\\ \end{array} \]
   5. Step-by-step derivation

   6. Applied rewrites 68.9%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\mathsf{fma}\left(1, \left|b\right|, -b\right)}\\ \end{array} \]

   if -2.00000000000000007e154 < b < 1.20000000000000006e100

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Step-by-step derivation

   3. Applied rewrites 71.8%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} + b}{-2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} - b}\\ } \end{array}} \]

   if 1.20000000000000006e100 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 34.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 34.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 90.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}\\ t_1 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \leq -2 \cdot 10^{+154}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_1}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\mathsf{fma}\left(1, \left|b\right|, -b\right)}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.2 \cdot 10^{+100}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{t\_0 + b}{-2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma -4.0 (* c a) (* b b))))
        (t_1 (sqrt (- (* b b) (* (* 4.0 a) c)))))
   (if (<= b -2e+154)
     (if (>= b 0.0)
       (/ (- (- b) t_1) (* 2.0 a))
       (/ (* 2.0 c) (fma 1.0 (fabs b) (- b))))
     (if (<= b 1.2e+100)
       (if (>= b 0.0) (/ (+ t_0 b) (* -2.0 a)) (/ (+ c c) (- t_0 b)))
       (if (>= b 0.0) (/ (* -2.0 b) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) t_1)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma(-4.0, (c * a), (b * b)));
	double t_1 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp_1;
	if (b <= -2e+154) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - t_1) / (2.0 * a);
		} else {
			tmp_2 = (2.0 * c) / fma(1.0, fabs(b), -b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.2e+100) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (t_0 + b) / (-2.0 * a);
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-b + t_1);
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(-4.0, Float64(c * a), Float64(b * b)))
	t_1 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp_1 = 0.0
	if (b <= -2e+154)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-b) - t_1) / Float64(2.0 * a));
		else
			tmp_2 = Float64(Float64(2.0 * c) / fma(1.0, abs(b), Float64(-b)));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.2e+100)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(t_0 + b) / Float64(-2.0 * a));
		else
			tmp_3 = Float64(Float64(c + c) / Float64(t_0 - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_1));
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -2e+154], If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$1), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(1.0 * N[Abs[b], $MachinePrecision] + (-b)), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.2e+100], If[GreaterEqual[b, 0.0], N[(N[(t$95$0 + b), $MachinePrecision] / N[(-2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$1), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.00000000000000007e154

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}}\\ \end{array} \]

      2. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}}\\ \end{array} \]

      3. lift-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      4. lift--.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      5. sub-to-mult N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{\left(1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}\right) \cdot \left(b \cdot b\right)} + \left(-b\right)}\\ \end{array} \]

      6. sqrt-prod N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      7. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      8. rem-sqrt-square-rev N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot \color{blue}{c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \left|b\right| + \left(-b\right)}\\ \end{array} \]

      9. lower-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]

   3. Applied rewrites 73.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \left(a \cdot 4\right) \cdot \frac{c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]

   4. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\mathsf{fma}\left(1, \left|b\right|, -b\right)}\\ \end{array} \]
   5. Step-by-step derivation

   6. Applied rewrites 68.9%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\mathsf{fma}\left(1, \left|b\right|, -b\right)}\\ \end{array} \]

   if -2.00000000000000007e154 < b < 1.20000000000000006e100

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Step-by-step derivation

   3. Applied rewrites 71.8%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} + b}{-2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} - b}\\ } \end{array}} \]

   if 1.20000000000000006e100 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 69.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 69.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 90.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)}\\ \mathbf{if}\;b \leq -6.5 \cdot 10^{+153}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{-1}{b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.2 \cdot 10^{+100}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{t\_0 + b}{-2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma -4.0 (* c a) (* b b)))))
   (if (<= b -6.5e+153)
     (if (>= b 0.0)
       (/ (- (- b) (sqrt (* -4.0 (* a c)))) (* 2.0 a))
       (* c (/ -1.0 b)))
     (if (<= b 1.2e+100)
       (if (>= b 0.0) (/ (+ t_0 b) (* -2.0 a)) (/ (+ c c) (- t_0 b)))
       (if (>= b 0.0)
         (/ (* -2.0 b) (* 2.0 a))
         (/ (* 2.0 c) (* -2.0 (/ (* a c) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma(-4.0, (c * a), (b * b)));
	double tmp_1;
	if (b <= -6.5e+153) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - sqrt((-4.0 * (a * c)))) / (2.0 * a);
		} else {
			tmp_2 = c * (-1.0 / b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.2e+100) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (t_0 + b) / (-2.0 * a);
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(-4.0, Float64(c * a), Float64(b * b)))
	tmp_1 = 0.0
	if (b <= -6.5e+153)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-b) - sqrt(Float64(-4.0 * Float64(a * c)))) / Float64(2.0 * a));
		else
			tmp_2 = Float64(c * Float64(-1.0 / b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.2e+100)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(t_0 + b) / Float64(-2.0 * a));
		else
			tmp_3 = Float64(Float64(c + c) / Float64(t_0 - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(-4.0 * N[(c * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -6.5e+153], If[GreaterEqual[b, 0.0], N[(N[((-b) - N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(c * N[(-1.0 / b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.2e+100], If[GreaterEqual[b, 0.0], N[(N[(t$95$0 + b), $MachinePrecision] / N[(-2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -6.49999999999999972e153

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

      2. lower-*.f64 56.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot \color{blue}{c}\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 56.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lower-*.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   7. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      3. *-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot 2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      4. associate-/l* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      6. lower-/.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      7. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      8. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(-b\right)}}\\ \end{array} \]

      9. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\color{blue}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(\mathsf{neg}\left(b\right)\right)}}\\ \end{array} \]

      10. sub-flip-reverse N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

      11. lower--.f64 41.2

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

   9. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-/.f64 53.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{-1}{b}}\\ \end{array} \]

   12. Applied rewrites 53.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]

   if -6.49999999999999972e153 < b < 1.20000000000000006e100

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Step-by-step derivation

   3. Applied rewrites 71.8%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} + b}{-2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4, c \cdot a, b \cdot b\right)} - b}\\ } \end{array}} \]

   if 1.20000000000000006e100 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 34.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 34.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 90.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)}\\ \mathbf{if}\;b \leq -6.5 \cdot 10^{+153}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{-1}{b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.2 \cdot 10^{+100}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(t\_0 + b\right) \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma (* -4.0 a) c (* b b)))))
   (if (<= b -6.5e+153)
     (if (>= b 0.0)
       (/ (- (- b) (sqrt (* -4.0 (* a c)))) (* 2.0 a))
       (* c (/ -1.0 b)))
     (if (<= b 1.2e+100)
       (if (>= b 0.0) (* (+ t_0 b) (/ -0.5 a)) (/ (+ c c) (- t_0 b)))
       (if (>= b 0.0)
         (/ (* -2.0 b) (* 2.0 a))
         (/ (* 2.0 c) (* -2.0 (/ (* a c) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma((-4.0 * a), c, (b * b)));
	double tmp_1;
	if (b <= -6.5e+153) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - sqrt((-4.0 * (a * c)))) / (2.0 * a);
		} else {
			tmp_2 = c * (-1.0 / b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.2e+100) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (t_0 + b) * (-0.5 / a);
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(Float64(-4.0 * a), c, Float64(b * b)))
	tmp_1 = 0.0
	if (b <= -6.5e+153)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-b) - sqrt(Float64(-4.0 * Float64(a * c)))) / Float64(2.0 * a));
		else
			tmp_2 = Float64(c * Float64(-1.0 / b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.2e+100)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(t_0 + b) * Float64(-0.5 / a));
		else
			tmp_3 = Float64(Float64(c + c) / Float64(t_0 - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -6.5e+153], If[GreaterEqual[b, 0.0], N[(N[((-b) - N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(c * N[(-1.0 / b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.2e+100], If[GreaterEqual[b, 0.0], N[(N[(t$95$0 + b), $MachinePrecision] * N[(-0.5 / a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -6.49999999999999972e153

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

      2. lower-*.f64 56.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot \color{blue}{c}\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 56.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lower-*.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   7. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      3. *-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot 2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      4. associate-/l* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      6. lower-/.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      7. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      8. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(-b\right)}}\\ \end{array} \]

      9. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\color{blue}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(\mathsf{neg}\left(b\right)\right)}}\\ \end{array} \]

      10. sub-flip-reverse N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

      11. lower--.f64 41.2

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

   9. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-/.f64 53.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{-1}{b}}\\ \end{array} \]

   12. Applied rewrites 53.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]

   if -6.49999999999999972e153 < b < 1.20000000000000006e100

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}}\\ \end{array} \]

      2. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}}\\ \end{array} \]

      3. lift-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      4. lift--.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      5. sub-to-mult N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{\left(1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}\right) \cdot \left(b \cdot b\right)} + \left(-b\right)}\\ \end{array} \]

      6. sqrt-prod N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      7. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      8. rem-sqrt-square-rev N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot \color{blue}{c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \left|b\right| + \left(-b\right)}\\ \end{array} \]

      9. lower-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]

   3. Applied rewrites 73.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \left(a \cdot 4\right) \cdot \frac{c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]

   5. Applied rewrites 71.7%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b\right) \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ } \end{array}} \]

   if 1.20000000000000006e100 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 34.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 34.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 84.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{-4 \cdot \left(a \cdot c\right)}\\ \mathbf{if}\;b \leq -6.5 \cdot 10^{+153}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{-1}{b}\\ \end{array}\\ \mathbf{elif}\;b \leq 3.9 \cdot 10^{-147}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(b + t\_0\right) \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* -4.0 (* a c)))))
   (if (<= b -6.5e+153)
     (if (>= b 0.0) (/ (- (- b) t_0) (* 2.0 a)) (* c (/ -1.0 b)))
     (if (<= b 3.9e-147)
       (if (>= b 0.0)
         (* (+ b t_0) (/ -0.5 a))
         (/ (+ c c) (- (sqrt (fma (* -4.0 a) c (* b b))) b)))
       (if (>= b 0.0)
         (/ (* -2.0 b) (* 2.0 a))
         (/ (* 2.0 c) (* -2.0 (/ (* a c) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-4.0 * (a * c)));
	double tmp_1;
	if (b <= -6.5e+153) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - t_0) / (2.0 * a);
		} else {
			tmp_2 = c * (-1.0 / b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.9e-147) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (b + t_0) * (-0.5 / a);
		} else {
			tmp_3 = (c + c) / (sqrt(fma((-4.0 * a), c, (b * b))) - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(-4.0 * Float64(a * c)))
	tmp_1 = 0.0
	if (b <= -6.5e+153)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
		else
			tmp_2 = Float64(c * Float64(-1.0 / b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 3.9e-147)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(b + t_0) * Float64(-0.5 / a));
		else
			tmp_3 = Float64(Float64(c + c) / Float64(sqrt(fma(Float64(-4.0 * a), c, Float64(b * b))) - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -6.5e+153], If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(c * N[(-1.0 / b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 3.9e-147], If[GreaterEqual[b, 0.0], N[(N[(b + t$95$0), $MachinePrecision] * N[(-0.5 / a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -6.49999999999999972e153

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

      2. lower-*.f64 56.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot \color{blue}{c}\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 56.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lower-*.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   7. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      3. *-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot 2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      4. associate-/l* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      6. lower-/.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      7. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      8. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(-b\right)}}\\ \end{array} \]

      9. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\color{blue}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(\mathsf{neg}\left(b\right)\right)}}\\ \end{array} \]

      10. sub-flip-reverse N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

      11. lower--.f64 41.2

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

   9. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-/.f64 53.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{-1}{b}}\\ \end{array} \]

   12. Applied rewrites 53.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]

   if -6.49999999999999972e153 < b < 3.8999999999999998e-147

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}}\\ \end{array} \]

      2. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}}\\ \end{array} \]

      3. lift-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      4. lift--.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} + \left(-b\right)}\\ \end{array} \]

      5. sub-to-mult N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2} \cdot c}{\sqrt{\left(1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}\right) \cdot \left(b \cdot b\right)} + \left(-b\right)}\\ \end{array} \]

      6. sqrt-prod N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\color{blue}{2 \cdot c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      7. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \sqrt{b \cdot b} + \left(-b\right)}\\ \end{array} \]

      8. rem-sqrt-square-rev N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot \color{blue}{c}}{\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}} \cdot \left|b\right| + \left(-b\right)}\\ \end{array} \]

      9. lower-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \frac{\left(4 \cdot a\right) \cdot c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]

   3. Applied rewrites 73.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{\mathsf{fma}\left(\sqrt{1 - \left(a \cdot 4\right) \cdot \frac{c}{b \cdot b}}, \left|b\right|, -b\right)}}\\ \end{array} \]

   5. Applied rewrites 71.7%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b\right) \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ } \end{array}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\left(b + \sqrt{-4 \cdot \left(a \cdot c\right)}\right)} \cdot \frac{\frac{-1}{2}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]
   7. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(b + \color{blue}{\sqrt{-4 \cdot \left(a \cdot c\right)}}\right) \cdot \frac{\frac{-1}{2}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(b + \sqrt{-4 \cdot \left(a \cdot c\right)}\right) \cdot \frac{\frac{-1}{2}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(b + \sqrt{-4 \cdot \left(a \cdot c\right)}\right) \cdot \frac{\frac{-1}{2}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      4. lower-*.f64 56.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(b + \sqrt{-4 \cdot \left(a \cdot c\right)}\right) \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   8. Applied rewrites 56.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\left(b + \sqrt{-4 \cdot \left(a \cdot c\right)}\right)} \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   if 3.8999999999999998e-147 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 34.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 34.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 78.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{-4 \cdot \left(a \cdot c\right)}\\ t_1 := \frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{if}\;b \leq -280000000:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{-1}{b}\\ \end{array}\\ \mathbf{elif}\;b \leq 3.9 \cdot 10^{-147}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* -4.0 (* a c)))) (t_1 (/ (- (- b) t_0) (* 2.0 a))))
   (if (<= b -280000000.0)
     (if (>= b 0.0) t_1 (* c (/ -1.0 b)))
     (if (<= b 3.9e-147)
       (if (>= b 0.0) t_1 (/ (* 2.0 c) (+ (- b) t_0)))
       (if (>= b 0.0)
         (/ (* -2.0 b) (* 2.0 a))
         (/ (* 2.0 c) (* -2.0 (/ (* a c) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-4.0 * (a * c)));
	double t_1 = (-b - t_0) / (2.0 * a);
	double tmp_1;
	if (b <= -280000000.0) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = c * (-1.0 / b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.9e-147) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_1;
		} else {
			tmp_3 = (2.0 * c) / (-b + t_0);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = sqrt(((-4.0d0) * (a * c)))
    t_1 = (-b - t_0) / (2.0d0 * a)
    if (b <= (-280000000.0d0)) then
        if (b >= 0.0d0) then
            tmp_2 = t_1
        else
            tmp_2 = c * ((-1.0d0) / b)
        end if
        tmp_1 = tmp_2
    else if (b <= 3.9d-147) then
        if (b >= 0.0d0) then
            tmp_3 = t_1
        else
            tmp_3 = (2.0d0 * c) / (-b + t_0)
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = ((-2.0d0) * b) / (2.0d0 * a)
    else
        tmp_1 = (2.0d0 * c) / ((-2.0d0) * ((a * c) / b))
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt((-4.0 * (a * c)));
	double t_1 = (-b - t_0) / (2.0 * a);
	double tmp_1;
	if (b <= -280000000.0) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = c * (-1.0 / b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.9e-147) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_1;
		} else {
			tmp_3 = (2.0 * c) / (-b + t_0);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt((-4.0 * (a * c)))
	t_1 = (-b - t_0) / (2.0 * a)
	tmp_1 = 0
	if b <= -280000000.0:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = t_1
		else:
			tmp_2 = c * (-1.0 / b)
		tmp_1 = tmp_2
	elif b <= 3.9e-147:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = t_1
		else:
			tmp_3 = (2.0 * c) / (-b + t_0)
		tmp_1 = tmp_3
	elif b >= 0.0:
		tmp_1 = (-2.0 * b) / (2.0 * a)
	else:
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b))
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(-4.0 * Float64(a * c)))
	t_1 = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a))
	tmp_1 = 0.0
	if (b <= -280000000.0)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = t_1;
		else
			tmp_2 = Float64(c * Float64(-1.0 / b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 3.9e-147)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = t_1;
		else
			tmp_3 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = sqrt((-4.0 * (a * c)));
	t_1 = (-b - t_0) / (2.0 * a);
	tmp_2 = 0.0;
	if (b <= -280000000.0)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = t_1;
		else
			tmp_3 = c * (-1.0 / b);
		end
		tmp_2 = tmp_3;
	elseif (b <= 3.9e-147)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = t_1;
		else
			tmp_4 = (2.0 * c) / (-b + t_0);
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = (-2.0 * b) / (2.0 * a);
	else
		tmp_2 = (2.0 * c) / (-2.0 * ((a * c) / b));
	end
	tmp_5 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -280000000.0], If[GreaterEqual[b, 0.0], t$95$1, N[(c * N[(-1.0 / b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 3.9e-147], If[GreaterEqual[b, 0.0], t$95$1, N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$0), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.8e8

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

      2. lower-*.f64 56.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot \color{blue}{c}\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 56.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lower-*.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   7. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      3. *-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot 2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      4. associate-/l* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      6. lower-/.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      7. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      8. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(-b\right)}}\\ \end{array} \]

      9. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\color{blue}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(\mathsf{neg}\left(b\right)\right)}}\\ \end{array} \]

      10. sub-flip-reverse N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

      11. lower--.f64 41.2

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

   9. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-/.f64 53.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{-1}{b}}\\ \end{array} \]

   12. Applied rewrites 53.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]

   if -2.8e8 < b < 3.8999999999999998e-147

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

      2. lower-*.f64 56.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot \color{blue}{c}\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 56.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lower-*.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   7. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   if 3.8999999999999998e-147 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 34.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 34.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 78.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\left(-4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \leq -280000000:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{-1}{b}\\ \end{array}\\ \mathbf{elif}\;b \leq 3.9 \cdot 10^{-147}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(t\_0 + b\right) \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* (* -4.0 a) c))))
   (if (<= b -280000000.0)
     (if (>= b 0.0)
       (/ (- (- b) (sqrt (* -4.0 (* a c)))) (* 2.0 a))
       (* c (/ -1.0 b)))
     (if (<= b 3.9e-147)
       (if (>= b 0.0) (* (+ t_0 b) (/ -0.5 a)) (/ (+ c c) (- t_0 b)))
       (if (>= b 0.0)
         (/ (* -2.0 b) (* 2.0 a))
         (/ (* 2.0 c) (* -2.0 (/ (* a c) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((-4.0 * a) * c));
	double tmp_1;
	if (b <= -280000000.0) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - sqrt((-4.0 * (a * c)))) / (2.0 * a);
		} else {
			tmp_2 = c * (-1.0 / b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.9e-147) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (t_0 + b) * (-0.5 / a);
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

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) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = sqrt((((-4.0d0) * a) * c))
    if (b <= (-280000000.0d0)) then
        if (b >= 0.0d0) then
            tmp_2 = (-b - sqrt(((-4.0d0) * (a * c)))) / (2.0d0 * a)
        else
            tmp_2 = c * ((-1.0d0) / b)
        end if
        tmp_1 = tmp_2
    else if (b <= 3.9d-147) then
        if (b >= 0.0d0) then
            tmp_3 = (t_0 + b) * ((-0.5d0) / a)
        else
            tmp_3 = (c + c) / (t_0 - b)
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = ((-2.0d0) * b) / (2.0d0 * a)
    else
        tmp_1 = (2.0d0 * c) / ((-2.0d0) * ((a * c) / b))
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((-4.0 * a) * c));
	double tmp_1;
	if (b <= -280000000.0) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - Math.sqrt((-4.0 * (a * c)))) / (2.0 * a);
		} else {
			tmp_2 = c * (-1.0 / b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.9e-147) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (t_0 + b) * (-0.5 / a);
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((-4.0 * a) * c))
	tmp_1 = 0
	if b <= -280000000.0:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = (-b - math.sqrt((-4.0 * (a * c)))) / (2.0 * a)
		else:
			tmp_2 = c * (-1.0 / b)
		tmp_1 = tmp_2
	elif b <= 3.9e-147:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = (t_0 + b) * (-0.5 / a)
		else:
			tmp_3 = (c + c) / (t_0 - b)
		tmp_1 = tmp_3
	elif b >= 0.0:
		tmp_1 = (-2.0 * b) / (2.0 * a)
	else:
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b))
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(-4.0 * a) * c))
	tmp_1 = 0.0
	if (b <= -280000000.0)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-b) - sqrt(Float64(-4.0 * Float64(a * c)))) / Float64(2.0 * a));
		else
			tmp_2 = Float64(c * Float64(-1.0 / b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 3.9e-147)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(t_0 + b) * Float64(-0.5 / a));
		else
			tmp_3 = Float64(Float64(c + c) / Float64(t_0 - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = sqrt(((-4.0 * a) * c));
	tmp_2 = 0.0;
	if (b <= -280000000.0)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (-b - sqrt((-4.0 * (a * c)))) / (2.0 * a);
		else
			tmp_3 = c * (-1.0 / b);
		end
		tmp_2 = tmp_3;
	elseif (b <= 3.9e-147)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (t_0 + b) * (-0.5 / a);
		else
			tmp_4 = (c + c) / (t_0 - b);
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = (-2.0 * b) / (2.0 * a);
	else
		tmp_2 = (2.0 * c) / (-2.0 * ((a * c) / b));
	end
	tmp_5 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -280000000.0], If[GreaterEqual[b, 0.0], N[(N[((-b) - N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(c * N[(-1.0 / b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 3.9e-147], If[GreaterEqual[b, 0.0], N[(N[(t$95$0 + b), $MachinePrecision] * N[(-0.5 / a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.8e8

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

      2. lower-*.f64 56.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot \color{blue}{c}\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 56.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lower-*.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   7. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      3. *-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot 2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      4. associate-/l* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      6. lower-/.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      7. lift-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      8. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(-b\right)}}\\ \end{array} \]

      9. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\color{blue}{\sqrt{-4 \cdot \left(a \cdot c\right)} + \left(\mathsf{neg}\left(b\right)\right)}}\\ \end{array} \]

      10. sub-flip-reverse N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

      11. lower--.f64 41.2

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{2}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}}\\ \end{array} \]

   9. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \frac{2}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-/.f64 53.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \color{blue}{\frac{-1}{b}}\\ \end{array} \]

   12. Applied rewrites 53.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{c \cdot \frac{-1}{b}}\\ \end{array} \]

   if -2.8e8 < b < 3.8999999999999998e-147

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

      2. lower-*.f64 56.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot \color{blue}{c}\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 56.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lower-*.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   7. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   8. Step-by-step derivation

   9. Applied rewrites 41.2%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(\sqrt{\left(-4 \cdot a\right) \cdot c} + b\right) \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ } \end{array}} \]

   if 3.8999999999999998e-147 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 34.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 34.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 59.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\left(-4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \leq 3.9 \cdot 10^{-147}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(t\_0 + b\right) \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* (* -4.0 a) c))))
   (if (<= b 3.9e-147)
     (if (>= b 0.0) (* (+ t_0 b) (/ -0.5 a)) (/ (+ c c) (- t_0 b)))
     (if (>= b 0.0)
       (/ (* -2.0 b) (* 2.0 a))
       (/ (* 2.0 c) (* -2.0 (/ (* a c) b)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((-4.0 * a) * c));
	double tmp_1;
	if (b <= 3.9e-147) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (t_0 + b) * (-0.5 / a);
		} else {
			tmp_2 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

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) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    t_0 = sqrt((((-4.0d0) * a) * c))
    if (b <= 3.9d-147) then
        if (b >= 0.0d0) then
            tmp_2 = (t_0 + b) * ((-0.5d0) / a)
        else
            tmp_2 = (c + c) / (t_0 - b)
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = ((-2.0d0) * b) / (2.0d0 * a)
    else
        tmp_1 = (2.0d0 * c) / ((-2.0d0) * ((a * c) / b))
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((-4.0 * a) * c));
	double tmp_1;
	if (b <= 3.9e-147) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (t_0 + b) * (-0.5 / a);
		} else {
			tmp_2 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((-4.0 * a) * c))
	tmp_1 = 0
	if b <= 3.9e-147:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = (t_0 + b) * (-0.5 / a)
		else:
			tmp_2 = (c + c) / (t_0 - b)
		tmp_1 = tmp_2
	elif b >= 0.0:
		tmp_1 = (-2.0 * b) / (2.0 * a)
	else:
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b))
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(-4.0 * a) * c))
	tmp_1 = 0.0
	if (b <= 3.9e-147)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(t_0 + b) * Float64(-0.5 / a));
		else
			tmp_2 = Float64(Float64(c + c) / Float64(t_0 - b));
		end
		tmp_1 = tmp_2;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_1
end

MATLAB

function tmp_4 = code(a, b, c)
	t_0 = sqrt(((-4.0 * a) * c));
	tmp_2 = 0.0;
	if (b <= 3.9e-147)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (t_0 + b) * (-0.5 / a);
		else
			tmp_3 = (c + c) / (t_0 - b);
		end
		tmp_2 = tmp_3;
	elseif (b >= 0.0)
		tmp_2 = (-2.0 * b) / (2.0 * a);
	else
		tmp_2 = (2.0 * c) / (-2.0 * ((a * c) / b));
	end
	tmp_4 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, 3.9e-147], If[GreaterEqual[b, 0.0], N[(N[(t$95$0 + b), $MachinePrecision] * N[(-0.5 / a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if b < 3.8999999999999998e-147

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

      2. lower-*.f64 56.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot \color{blue}{c}\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   4. Applied rewrites 56.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

      2. lower-*.f64 41.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   7. Applied rewrites 41.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   8. Step-by-step derivation

   9. Applied rewrites 41.2%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\left(\sqrt{\left(-4 \cdot a\right) \cdot c} + b\right) \cdot \frac{-0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ } \end{array}} \]

   if 3.8999999999999998e-147 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 34.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 34.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 53.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := -0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{if}\;b \leq -870000:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \left(a \cdot \frac{1}{c}\right)}}\\ \end{array}\\ \mathbf{elif}\;b \leq -5.4 \cdot 10^{-306}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array}\\ \mathbf{elif}\;b \leq 3.9 \cdot 10^{-147}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (* -0.5 (sqrt (* -4.0 (/ c a))))))
   (if (<= b -870000.0)
     (if (>= b 0.0) t_0 (/ -2.0 (sqrt (* -4.0 (* a (/ 1.0 c))))))
     (if (<= b -5.4e-306)
       (if (>= b 0.0) t_0 (* 2.0 (/ c (sqrt (- (* 4.0 (* a c)))))))
       (if (<= b 3.9e-147)
         (if (>= b 0.0)
           (* -0.5 (/ (sqrt (* -4.0 (* a c))) a))
           (/ -2.0 (sqrt (* -4.0 (/ a c)))))
         (if (>= b 0.0)
           (/ (* -2.0 b) (* 2.0 a))
           (/ (* 2.0 c) (* -2.0 (/ (* a c) b)))))))))

C

double code(double a, double b, double c) {
	double t_0 = -0.5 * sqrt((-4.0 * (c / a)));
	double tmp_1;
	if (b <= -870000.0) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0;
		} else {
			tmp_2 = -2.0 / sqrt((-4.0 * (a * (1.0 / c))));
		}
		tmp_1 = tmp_2;
	} else if (b <= -5.4e-306) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = 2.0 * (c / sqrt(-(4.0 * (a * c))));
		}
		tmp_1 = tmp_3;
	} else if (b <= 3.9e-147) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
		} else {
			tmp_4 = -2.0 / sqrt((-4.0 * (a / c)));
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

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) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
    if (b <= (-870000.0d0)) then
        if (b >= 0.0d0) then
            tmp_2 = t_0
        else
            tmp_2 = (-2.0d0) / sqrt(((-4.0d0) * (a * (1.0d0 / c))))
        end if
        tmp_1 = tmp_2
    else if (b <= (-5.4d-306)) then
        if (b >= 0.0d0) then
            tmp_3 = t_0
        else
            tmp_3 = 2.0d0 * (c / sqrt(-(4.0d0 * (a * c))))
        end if
        tmp_1 = tmp_3
    else if (b <= 3.9d-147) then
        if (b >= 0.0d0) then
            tmp_4 = (-0.5d0) * (sqrt(((-4.0d0) * (a * c))) / a)
        else
            tmp_4 = (-2.0d0) / sqrt(((-4.0d0) * (a / c)))
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = ((-2.0d0) * b) / (2.0d0 * a)
    else
        tmp_1 = (2.0d0 * c) / ((-2.0d0) * ((a * c) / b))
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = -0.5 * Math.sqrt((-4.0 * (c / a)));
	double tmp_1;
	if (b <= -870000.0) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0;
		} else {
			tmp_2 = -2.0 / Math.sqrt((-4.0 * (a * (1.0 / c))));
		}
		tmp_1 = tmp_2;
	} else if (b <= -5.4e-306) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = 2.0 * (c / Math.sqrt(-(4.0 * (a * c))));
		}
		tmp_1 = tmp_3;
	} else if (b <= 3.9e-147) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -0.5 * (Math.sqrt((-4.0 * (a * c))) / a);
		} else {
			tmp_4 = -2.0 / Math.sqrt((-4.0 * (a / c)));
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (2.0 * a);
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = -0.5 * math.sqrt((-4.0 * (c / a)))
	tmp_1 = 0
	if b <= -870000.0:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = t_0
		else:
			tmp_2 = -2.0 / math.sqrt((-4.0 * (a * (1.0 / c))))
		tmp_1 = tmp_2
	elif b <= -5.4e-306:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = t_0
		else:
			tmp_3 = 2.0 * (c / math.sqrt(-(4.0 * (a * c))))
		tmp_1 = tmp_3
	elif b <= 3.9e-147:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = -0.5 * (math.sqrt((-4.0 * (a * c))) / a)
		else:
			tmp_4 = -2.0 / math.sqrt((-4.0 * (a / c)))
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = (-2.0 * b) / (2.0 * a)
	else:
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b))
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))))
	tmp_1 = 0.0
	if (b <= -870000.0)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = t_0;
		else
			tmp_2 = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a * Float64(1.0 / c)))));
		end
		tmp_1 = tmp_2;
	elseif (b <= -5.4e-306)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = t_0;
		else
			tmp_3 = Float64(2.0 * Float64(c / sqrt(Float64(-Float64(4.0 * Float64(a * c))))));
		end
		tmp_1 = tmp_3;
	elseif (b <= 3.9e-147)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(-0.5 * Float64(sqrt(Float64(-4.0 * Float64(a * c))) / a));
		else
			tmp_4 = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a / c))));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = -0.5 * sqrt((-4.0 * (c / a)));
	tmp_2 = 0.0;
	if (b <= -870000.0)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = t_0;
		else
			tmp_3 = -2.0 / sqrt((-4.0 * (a * (1.0 / c))));
		end
		tmp_2 = tmp_3;
	elseif (b <= -5.4e-306)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = t_0;
		else
			tmp_4 = 2.0 * (c / sqrt(-(4.0 * (a * c))));
		end
		tmp_2 = tmp_4;
	elseif (b <= 3.9e-147)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
		else
			tmp_5 = -2.0 / sqrt((-4.0 * (a / c)));
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = (-2.0 * b) / (2.0 * a);
	else
		tmp_2 = (2.0 * c) / (-2.0 * ((a * c) / b));
	end
	tmp_6 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(-0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -870000.0], If[GreaterEqual[b, 0.0], t$95$0, N[(-2.0 / N[Sqrt[N[(-4.0 * N[(a * N[(1.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, -5.4e-306], If[GreaterEqual[b, 0.0], t$95$0, N[(2.0 * N[(c / N[Sqrt[(-N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 3.9e-147], If[GreaterEqual[b, 0.0], N[(-0.5 * N[(N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-2.0 / N[Sqrt[N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -8.7e5

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lift-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

       2. mult-flip N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot \frac{1}{c}\right)}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot \frac{1}{c}\right)}}}\\ \end{array} \]

       4. lower-/.f64 16.8

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \left(a \cdot \color{blue}{\frac{1}{c}}\right)}}\\ \end{array} \]

   12. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot \frac{1}{c}\right)}}}\\ \end{array} \]

   if -8.7e5 < b < -5.40000000000000018e-306

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in b around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{2 \cdot \frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \color{blue}{\frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      3. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\color{blue}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      4. lower-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-\color{blue}{4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      6. lower-*.f64 21.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}\\ \end{array} \]

   10. Applied rewrites 21.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   if -5.40000000000000018e-306 < b < 3.8999999999999998e-147

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   11. Taylor expanded in a around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   12. Step-by-step derivation

       1. lower-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       2. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       4. lower-*.f64 22.3

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   13. Applied rewrites 22.3%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   if 3.8999999999999998e-147 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 34.6

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 34.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 11: 29.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ t_1 := \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \end{array}\\ t_2 := \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{-303}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot t\_2\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array}\\ \mathbf{elif}\;t\_1 \leq 10^{+212}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;0.5 \cdot t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* (* 4.0 a) c))))
        (t_1
         (if (>= b 0.0)
           (/ (- (- b) t_0) (* 2.0 a))
           (/ (* 2.0 c) (+ (- b) t_0))))
        (t_2 (sqrt (* -4.0 (/ c a)))))
   (if (<= t_1 -2e-303)
     (if (>= b 0.0) (* -0.5 t_2) (* 2.0 (/ c (sqrt (- (* 4.0 (* a c)))))))
     (if (<= t_1 1e+212)
       (if (>= b 0.0)
         (* -0.5 (/ (sqrt (* -4.0 (* a c))) a))
         (/ -2.0 (sqrt (* -4.0 (/ a c)))))
       (if (>= b 0.0) (* 0.5 t_2) (/ (* 2.0 c) (* -2.0 (/ (* a c) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	double t_1 = tmp;
	double t_2 = sqrt((-4.0 * (c / a)));
	double tmp_2;
	if (t_1 <= -2e-303) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -0.5 * t_2;
		} else {
			tmp_3 = 2.0 * (c / sqrt(-(4.0 * (a * c))));
		}
		tmp_2 = tmp_3;
	} else if (t_1 <= 1e+212) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
		} else {
			tmp_4 = -2.0 / sqrt((-4.0 * (a / c)));
		}
		tmp_2 = tmp_4;
	} else if (b >= 0.0) {
		tmp_2 = 0.5 * t_2;
	} else {
		tmp_2 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_2;
}

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) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = sqrt(((b * b) - ((4.0d0 * a) * c)))
    if (b >= 0.0d0) then
        tmp = (-b - t_0) / (2.0d0 * a)
    else
        tmp = (2.0d0 * c) / (-b + t_0)
    end if
    t_1 = tmp
    t_2 = sqrt(((-4.0d0) * (c / a)))
    if (t_1 <= (-2d-303)) then
        if (b >= 0.0d0) then
            tmp_3 = (-0.5d0) * t_2
        else
            tmp_3 = 2.0d0 * (c / sqrt(-(4.0d0 * (a * c))))
        end if
        tmp_2 = tmp_3
    else if (t_1 <= 1d+212) then
        if (b >= 0.0d0) then
            tmp_4 = (-0.5d0) * (sqrt(((-4.0d0) * (a * c))) / a)
        else
            tmp_4 = (-2.0d0) / sqrt(((-4.0d0) * (a / c)))
        end if
        tmp_2 = tmp_4
    else if (b >= 0.0d0) then
        tmp_2 = 0.5d0 * t_2
    else
        tmp_2 = (2.0d0 * c) / ((-2.0d0) * ((a * c) / b))
    end if
    code = tmp_2
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	double t_1 = tmp;
	double t_2 = Math.sqrt((-4.0 * (c / a)));
	double tmp_2;
	if (t_1 <= -2e-303) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -0.5 * t_2;
		} else {
			tmp_3 = 2.0 * (c / Math.sqrt(-(4.0 * (a * c))));
		}
		tmp_2 = tmp_3;
	} else if (t_1 <= 1e+212) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -0.5 * (Math.sqrt((-4.0 * (a * c))) / a);
		} else {
			tmp_4 = -2.0 / Math.sqrt((-4.0 * (a / c)));
		}
		tmp_2 = tmp_4;
	} else if (b >= 0.0) {
		tmp_2 = 0.5 * t_2;
	} else {
		tmp_2 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_2;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - ((4.0 * a) * c)))
	tmp = 0
	if b >= 0.0:
		tmp = (-b - t_0) / (2.0 * a)
	else:
		tmp = (2.0 * c) / (-b + t_0)
	t_1 = tmp
	t_2 = math.sqrt((-4.0 * (c / a)))
	tmp_2 = 0
	if t_1 <= -2e-303:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = -0.5 * t_2
		else:
			tmp_3 = 2.0 * (c / math.sqrt(-(4.0 * (a * c))))
		tmp_2 = tmp_3
	elif t_1 <= 1e+212:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = -0.5 * (math.sqrt((-4.0 * (a * c))) / a)
		else:
			tmp_4 = -2.0 / math.sqrt((-4.0 * (a / c)))
		tmp_2 = tmp_4
	elif b >= 0.0:
		tmp_2 = 0.5 * t_2
	else:
		tmp_2 = (2.0 * c) / (-2.0 * ((a * c) / b))
	return tmp_2

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
	end
	t_1 = tmp
	t_2 = sqrt(Float64(-4.0 * Float64(c / a)))
	tmp_2 = 0.0
	if (t_1 <= -2e-303)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(-0.5 * t_2);
		else
			tmp_3 = Float64(2.0 * Float64(c / sqrt(Float64(-Float64(4.0 * Float64(a * c))))));
		end
		tmp_2 = tmp_3;
	elseif (t_1 <= 1e+212)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(-0.5 * Float64(sqrt(Float64(-4.0 * Float64(a * c))) / a));
		else
			tmp_4 = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a / c))));
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = Float64(0.5 * t_2);
	else
		tmp_2 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_2
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (-b - t_0) / (2.0 * a);
	else
		tmp = (2.0 * c) / (-b + t_0);
	end
	t_1 = tmp;
	t_2 = sqrt((-4.0 * (c / a)));
	tmp_3 = 0.0;
	if (t_1 <= -2e-303)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = -0.5 * t_2;
		else
			tmp_4 = 2.0 * (c / sqrt(-(4.0 * (a * c))));
		end
		tmp_3 = tmp_4;
	elseif (t_1 <= 1e+212)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
		else
			tmp_5 = -2.0 / sqrt((-4.0 * (a / c)));
		end
		tmp_3 = tmp_5;
	elseif (b >= 0.0)
		tmp_3 = 0.5 * t_2;
	else
		tmp_3 = (2.0 * c) / (-2.0 * ((a * c) / b));
	end
	tmp_6 = tmp_3;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$0), $MachinePrecision]), $MachinePrecision]]}, Block[{t$95$2 = N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$1, -2e-303], If[GreaterEqual[b, 0.0], N[(-0.5 * t$95$2), $MachinePrecision], N[(2.0 * N[(c / N[Sqrt[(-N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], If[LessEqual[t$95$1, 1e+212], If[GreaterEqual[b, 0.0], N[(-0.5 * N[(N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-2.0 / N[Sqrt[N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(0.5 * t$95$2), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (if (>=.f64 b #s(literal 0 binary64)) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) (/.f64 (*.f64 #s(literal 2 binary64) c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))))) < -1.99999999999999986e-303

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in b around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{2 \cdot \frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \color{blue}{\frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      3. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\color{blue}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      4. lower-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-\color{blue}{4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      6. lower-*.f64 21.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}\\ \end{array} \]

   10. Applied rewrites 21.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   if -1.99999999999999986e-303 < (if (>=.f64 b #s(literal 0 binary64)) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) (/.f64 (*.f64 #s(literal 2 binary64) c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))))) < 9.9999999999999991e211

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   11. Taylor expanded in a around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   12. Step-by-step derivation

       1. lower-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       2. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       4. lower-*.f64 22.3

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   13. Applied rewrites 22.3%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   if 9.9999999999999991e211 < (if (>=.f64 b #s(literal 0 binary64)) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) (/.f64 (*.f64 #s(literal 2 binary64) c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c))))))

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 12: 27.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := -0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{if}\;b \leq -870000:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \left(a \cdot \frac{1}{c}\right)}}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.58 \cdot 10^{-307}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;0.5 \cdot \left(c \cdot \sqrt{\frac{-4}{a \cdot c}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (* -0.5 (sqrt (* -4.0 (/ c a))))))
   (if (<= b -870000.0)
     (if (>= b 0.0) t_0 (/ -2.0 (sqrt (* -4.0 (* a (/ 1.0 c))))))
     (if (<= b 1.58e-307)
       (if (>= b 0.0) t_0 (* 2.0 (/ c (sqrt (- (* 4.0 (* a c)))))))
       (if (>= b 0.0)
         (* 0.5 (* c (sqrt (/ -4.0 (* a c)))))
         (/ (* 2.0 c) (* -2.0 (/ (* a c) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = -0.5 * sqrt((-4.0 * (c / a)));
	double tmp_1;
	if (b <= -870000.0) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0;
		} else {
			tmp_2 = -2.0 / sqrt((-4.0 * (a * (1.0 / c))));
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.58e-307) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = 2.0 * (c / sqrt(-(4.0 * (a * c))));
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = 0.5 * (c * sqrt((-4.0 / (a * c))));
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

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) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
    if (b <= (-870000.0d0)) then
        if (b >= 0.0d0) then
            tmp_2 = t_0
        else
            tmp_2 = (-2.0d0) / sqrt(((-4.0d0) * (a * (1.0d0 / c))))
        end if
        tmp_1 = tmp_2
    else if (b <= 1.58d-307) then
        if (b >= 0.0d0) then
            tmp_3 = t_0
        else
            tmp_3 = 2.0d0 * (c / sqrt(-(4.0d0 * (a * c))))
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = 0.5d0 * (c * sqrt(((-4.0d0) / (a * c))))
    else
        tmp_1 = (2.0d0 * c) / ((-2.0d0) * ((a * c) / b))
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = -0.5 * Math.sqrt((-4.0 * (c / a)));
	double tmp_1;
	if (b <= -870000.0) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0;
		} else {
			tmp_2 = -2.0 / Math.sqrt((-4.0 * (a * (1.0 / c))));
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.58e-307) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = 2.0 * (c / Math.sqrt(-(4.0 * (a * c))));
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = 0.5 * (c * Math.sqrt((-4.0 / (a * c))));
	} else {
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b));
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = -0.5 * math.sqrt((-4.0 * (c / a)))
	tmp_1 = 0
	if b <= -870000.0:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = t_0
		else:
			tmp_2 = -2.0 / math.sqrt((-4.0 * (a * (1.0 / c))))
		tmp_1 = tmp_2
	elif b <= 1.58e-307:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = t_0
		else:
			tmp_3 = 2.0 * (c / math.sqrt(-(4.0 * (a * c))))
		tmp_1 = tmp_3
	elif b >= 0.0:
		tmp_1 = 0.5 * (c * math.sqrt((-4.0 / (a * c))))
	else:
		tmp_1 = (2.0 * c) / (-2.0 * ((a * c) / b))
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))))
	tmp_1 = 0.0
	if (b <= -870000.0)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = t_0;
		else
			tmp_2 = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a * Float64(1.0 / c)))));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.58e-307)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = t_0;
		else
			tmp_3 = Float64(2.0 * Float64(c / sqrt(Float64(-Float64(4.0 * Float64(a * c))))));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(0.5 * Float64(c * sqrt(Float64(-4.0 / Float64(a * c)))));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * Float64(Float64(a * c) / b)));
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = -0.5 * sqrt((-4.0 * (c / a)));
	tmp_2 = 0.0;
	if (b <= -870000.0)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = t_0;
		else
			tmp_3 = -2.0 / sqrt((-4.0 * (a * (1.0 / c))));
		end
		tmp_2 = tmp_3;
	elseif (b <= 1.58e-307)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = t_0;
		else
			tmp_4 = 2.0 * (c / sqrt(-(4.0 * (a * c))));
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = 0.5 * (c * sqrt((-4.0 / (a * c))));
	else
		tmp_2 = (2.0 * c) / (-2.0 * ((a * c) / b));
	end
	tmp_5 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(-0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -870000.0], If[GreaterEqual[b, 0.0], t$95$0, N[(-2.0 / N[Sqrt[N[(-4.0 * N[(a * N[(1.0 / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.58e-307], If[GreaterEqual[b, 0.0], t$95$0, N[(2.0 * N[(c / N[Sqrt[(-N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(0.5 * N[(c * N[Sqrt[N[(-4.0 / N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -8.7e5

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lift-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

       2. mult-flip N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot \frac{1}{c}\right)}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot \frac{1}{c}\right)}}}\\ \end{array} \]

       4. lower-/.f64 16.8

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \left(a \cdot \color{blue}{\frac{1}{c}}\right)}}\\ \end{array} \]

   12. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot \frac{1}{c}\right)}}}\\ \end{array} \]

   if -8.7e5 < b < 1.57999999999999992e-307

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in b around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{2 \cdot \frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \color{blue}{\frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      3. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\color{blue}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      4. lower-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-\color{blue}{4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      6. lower-*.f64 21.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}\\ \end{array} \]

   10. Applied rewrites 21.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   if 1.57999999999999992e-307 < b

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in c around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \frac{c \cdot \sqrt{-4 \cdot \frac{a}{c}}}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\frac{c \cdot \sqrt{-4 \cdot \frac{a}{c}}}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c \cdot \sqrt{-4 \cdot \frac{a}{c}}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c \cdot \sqrt{-4 \cdot \frac{a}{c}}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c \cdot \sqrt{-4 \cdot \frac{a}{c}}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c \cdot \sqrt{-4 \cdot \frac{a}{c}}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      6. lower-/.f64 8.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{c \cdot \sqrt{-4 \cdot \frac{a}{c}}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 8.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \frac{c \cdot \sqrt{-4 \cdot \frac{a}{c}}}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in a around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{1}{2} \cdot \color{blue}{\left(c \cdot \sqrt{\frac{-4}{a \cdot c}}\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{1}{2} \cdot \left(c \cdot \color{blue}{\sqrt{\frac{-4}{a \cdot c}}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{1}{2} \cdot \left(c \cdot \sqrt{\frac{-4}{a \cdot c}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{1}{2} \cdot \left(c \cdot \sqrt{\frac{-4}{a \cdot c}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{1}{2} \cdot \left(c \cdot \sqrt{\frac{-4}{a \cdot c}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      5. lower-*.f64 16.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;0.5 \cdot \left(c \cdot \sqrt{\frac{-4}{a \cdot c}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   10. Applied rewrites 16.2%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;0.5 \cdot \color{blue}{\left(c \cdot \sqrt{\frac{-4}{a \cdot c}}\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 13: 25.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \end{array} \leq -2 \cdot 10^{-303}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* (* 4.0 a) c)))))
   (if (<=
        (if (>= b 0.0) (/ (- (- b) t_0) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) t_0)))
        -2e-303)
     (if (>= b 0.0)
       (* -0.5 (sqrt (* -4.0 (/ c a))))
       (* 2.0 (/ c (sqrt (- (* 4.0 (* a c)))))))
     (if (>= b 0.0)
       (* -0.5 (/ (sqrt (* -4.0 (* a c))) a))
       (/ -2.0 (sqrt (* -4.0 (/ a c))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	double tmp_2;
	if (tmp <= -2e-303) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -0.5 * sqrt((-4.0 * (c / a)));
		} else {
			tmp_3 = 2.0 * (c / sqrt(-(4.0 * (a * c))));
		}
		tmp_2 = tmp_3;
	} else if (b >= 0.0) {
		tmp_2 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
	} else {
		tmp_2 = -2.0 / sqrt((-4.0 * (a / c)));
	}
	return tmp_2;
}

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) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = sqrt(((b * b) - ((4.0d0 * a) * c)))
    if (b >= 0.0d0) then
        tmp = (-b - t_0) / (2.0d0 * a)
    else
        tmp = (2.0d0 * c) / (-b + t_0)
    end if
    if (tmp <= (-2d-303)) then
        if (b >= 0.0d0) then
            tmp_3 = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
        else
            tmp_3 = 2.0d0 * (c / sqrt(-(4.0d0 * (a * c))))
        end if
        tmp_2 = tmp_3
    else if (b >= 0.0d0) then
        tmp_2 = (-0.5d0) * (sqrt(((-4.0d0) * (a * c))) / a)
    else
        tmp_2 = (-2.0d0) / sqrt(((-4.0d0) * (a / c)))
    end if
    code = tmp_2
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	double tmp_2;
	if (tmp <= -2e-303) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -0.5 * Math.sqrt((-4.0 * (c / a)));
		} else {
			tmp_3 = 2.0 * (c / Math.sqrt(-(4.0 * (a * c))));
		}
		tmp_2 = tmp_3;
	} else if (b >= 0.0) {
		tmp_2 = -0.5 * (Math.sqrt((-4.0 * (a * c))) / a);
	} else {
		tmp_2 = -2.0 / Math.sqrt((-4.0 * (a / c)));
	}
	return tmp_2;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - ((4.0 * a) * c)))
	tmp = 0
	if b >= 0.0:
		tmp = (-b - t_0) / (2.0 * a)
	else:
		tmp = (2.0 * c) / (-b + t_0)
	tmp_2 = 0
	if tmp <= -2e-303:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = -0.5 * math.sqrt((-4.0 * (c / a)))
		else:
			tmp_3 = 2.0 * (c / math.sqrt(-(4.0 * (a * c))))
		tmp_2 = tmp_3
	elif b >= 0.0:
		tmp_2 = -0.5 * (math.sqrt((-4.0 * (a * c))) / a)
	else:
		tmp_2 = -2.0 / math.sqrt((-4.0 * (a / c)))
	return tmp_2

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
	end
	tmp_2 = 0.0
	if (tmp <= -2e-303)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))));
		else
			tmp_3 = Float64(2.0 * Float64(c / sqrt(Float64(-Float64(4.0 * Float64(a * c))))));
		end
		tmp_2 = tmp_3;
	elseif (b >= 0.0)
		tmp_2 = Float64(-0.5 * Float64(sqrt(Float64(-4.0 * Float64(a * c))) / a));
	else
		tmp_2 = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a / c))));
	end
	return tmp_2
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (-b - t_0) / (2.0 * a);
	else
		tmp = (2.0 * c) / (-b + t_0);
	end
	tmp_3 = 0.0;
	if (tmp <= -2e-303)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = -0.5 * sqrt((-4.0 * (c / a)));
		else
			tmp_4 = 2.0 * (c / sqrt(-(4.0 * (a * c))));
		end
		tmp_3 = tmp_4;
	elseif (b >= 0.0)
		tmp_3 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
	else
		tmp_3 = -2.0 / sqrt((-4.0 * (a / c)));
	end
	tmp_5 = tmp_3;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$0), $MachinePrecision]), $MachinePrecision]], -2e-303], If[GreaterEqual[b, 0.0], N[(-0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(c / N[Sqrt[(-N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision])], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(-0.5 * N[(N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-2.0 / N[Sqrt[N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (if (>=.f64 b #s(literal 0 binary64)) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) (/.f64 (*.f64 #s(literal 2 binary64) c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))))) < -1.99999999999999986e-303

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in b around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{2 \cdot \frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \color{blue}{\frac{c}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      3. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\color{blue}{\sqrt{\mathsf{neg}\left(4 \cdot \left(a \cdot c\right)\right)}}}\\ \end{array} \]

      4. lower-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      5. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-\color{blue}{4 \cdot \left(a \cdot c\right)}}}\\ \end{array} \]

      6. lower-*.f64 21.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \color{blue}{\left(a \cdot c\right)}}}\\ \end{array} \]

   10. Applied rewrites 21.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]

   if -1.99999999999999986e-303 < (if (>=.f64 b #s(literal 0 binary64)) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) (/.f64 (*.f64 #s(literal 2 binary64) c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c))))))

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   11. Taylor expanded in a around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   12. Step-by-step derivation

       1. lower-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       2. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       4. lower-*.f64 22.3

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   13. Applied rewrites 22.3%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 25.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \end{array} \leq -2 \cdot 10^{-303}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{a \cdot \sqrt{\frac{-4}{a \cdot c}}}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* (* 4.0 a) c)))))
   (if (<=
        (if (>= b 0.0) (/ (- (- b) t_0) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) t_0)))
        -2e-303)
     (if (>= b 0.0)
       (* -0.5 (sqrt (* -4.0 (/ c a))))
       (/ -2.0 (* a (sqrt (/ -4.0 (* a c))))))
     (if (>= b 0.0)
       (* -0.5 (/ (sqrt (* -4.0 (* a c))) a))
       (/ -2.0 (sqrt (* -4.0 (/ a c))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	double tmp_2;
	if (tmp <= -2e-303) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -0.5 * sqrt((-4.0 * (c / a)));
		} else {
			tmp_3 = -2.0 / (a * sqrt((-4.0 / (a * c))));
		}
		tmp_2 = tmp_3;
	} else if (b >= 0.0) {
		tmp_2 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
	} else {
		tmp_2 = -2.0 / sqrt((-4.0 * (a / c)));
	}
	return tmp_2;
}

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) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = sqrt(((b * b) - ((4.0d0 * a) * c)))
    if (b >= 0.0d0) then
        tmp = (-b - t_0) / (2.0d0 * a)
    else
        tmp = (2.0d0 * c) / (-b + t_0)
    end if
    if (tmp <= (-2d-303)) then
        if (b >= 0.0d0) then
            tmp_3 = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
        else
            tmp_3 = (-2.0d0) / (a * sqrt(((-4.0d0) / (a * c))))
        end if
        tmp_2 = tmp_3
    else if (b >= 0.0d0) then
        tmp_2 = (-0.5d0) * (sqrt(((-4.0d0) * (a * c))) / a)
    else
        tmp_2 = (-2.0d0) / sqrt(((-4.0d0) * (a / c)))
    end if
    code = tmp_2
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - ((4.0 * a) * c)));
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	double tmp_2;
	if (tmp <= -2e-303) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -0.5 * Math.sqrt((-4.0 * (c / a)));
		} else {
			tmp_3 = -2.0 / (a * Math.sqrt((-4.0 / (a * c))));
		}
		tmp_2 = tmp_3;
	} else if (b >= 0.0) {
		tmp_2 = -0.5 * (Math.sqrt((-4.0 * (a * c))) / a);
	} else {
		tmp_2 = -2.0 / Math.sqrt((-4.0 * (a / c)));
	}
	return tmp_2;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - ((4.0 * a) * c)))
	tmp = 0
	if b >= 0.0:
		tmp = (-b - t_0) / (2.0 * a)
	else:
		tmp = (2.0 * c) / (-b + t_0)
	tmp_2 = 0
	if tmp <= -2e-303:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = -0.5 * math.sqrt((-4.0 * (c / a)))
		else:
			tmp_3 = -2.0 / (a * math.sqrt((-4.0 / (a * c))))
		tmp_2 = tmp_3
	elif b >= 0.0:
		tmp_2 = -0.5 * (math.sqrt((-4.0 * (a * c))) / a)
	else:
		tmp_2 = -2.0 / math.sqrt((-4.0 * (a / c)))
	return tmp_2

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
	end
	tmp_2 = 0.0
	if (tmp <= -2e-303)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))));
		else
			tmp_3 = Float64(-2.0 / Float64(a * sqrt(Float64(-4.0 / Float64(a * c)))));
		end
		tmp_2 = tmp_3;
	elseif (b >= 0.0)
		tmp_2 = Float64(-0.5 * Float64(sqrt(Float64(-4.0 * Float64(a * c))) / a));
	else
		tmp_2 = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a / c))));
	end
	return tmp_2
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = sqrt(((b * b) - ((4.0 * a) * c)));
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (-b - t_0) / (2.0 * a);
	else
		tmp = (2.0 * c) / (-b + t_0);
	end
	tmp_3 = 0.0;
	if (tmp <= -2e-303)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = -0.5 * sqrt((-4.0 * (c / a)));
		else
			tmp_4 = -2.0 / (a * sqrt((-4.0 / (a * c))));
		end
		tmp_3 = tmp_4;
	elseif (b >= 0.0)
		tmp_3 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
	else
		tmp_3 = -2.0 / sqrt((-4.0 * (a / c)));
	end
	tmp_5 = tmp_3;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + t$95$0), $MachinePrecision]), $MachinePrecision]], -2e-303], If[GreaterEqual[b, 0.0], N[(-0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-2.0 / N[(a * N[Sqrt[N[(-4.0 / N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(-0.5 * N[(N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(-2.0 / N[Sqrt[N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (if (>=.f64 b #s(literal 0 binary64)) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) (/.f64 (*.f64 #s(literal 2 binary64) c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))))) < -1.99999999999999986e-303

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   11. Taylor expanded in a around inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{a \cdot \sqrt{\frac{-4}{a \cdot c}}}}\\ \end{array} \]
   12. Step-by-step derivation

       1. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{a \cdot \color{blue}{\sqrt{\frac{-4}{a \cdot c}}}}\\ \end{array} \]

       2. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{a \cdot \sqrt{\frac{-4}{a \cdot c}}}\\ \end{array} \]

       3. lower-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{a \cdot \sqrt{\frac{-4}{a \cdot c}}}\\ \end{array} \]

       4. lower-*.f64 22.9

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{a \cdot \sqrt{\frac{-4}{a \cdot c}}}\\ \end{array} \]

   13. Applied rewrites 22.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{a \cdot \sqrt{\frac{-4}{a \cdot c}}}}\\ \end{array} \]

   if -1.99999999999999986e-303 < (if (>=.f64 b #s(literal 0 binary64)) (/.f64 (-.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c)))) (*.f64 #s(literal 2 binary64) a)) (/.f64 (*.f64 #s(literal 2 binary64) c) (+.f64 (neg.f64 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 (*.f64 #s(literal 4 binary64) a) c))))))

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   11. Taylor expanded in a around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   12. Step-by-step derivation

       1. lower-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       2. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       4. lower-*.f64 22.3

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   13. Applied rewrites 22.3%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 15: 23.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \mathbf{if}\;c \leq -4.1 \cdot 10^{-233}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ -2.0 (sqrt (* -4.0 (/ a c))))))
   (if (<= c -4.1e-233)
     (if (>= b 0.0) (* -0.5 (sqrt (* -4.0 (/ c a)))) t_0)
     (if (>= b 0.0) (* -0.5 (/ (sqrt (* -4.0 (* a c))) a)) t_0))))

C

double code(double a, double b, double c) {
	double t_0 = -2.0 / sqrt((-4.0 * (a / c)));
	double tmp_1;
	if (c <= -4.1e-233) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -0.5 * sqrt((-4.0 * (c / a)));
		} else {
			tmp_2 = t_0;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
	} else {
		tmp_1 = t_0;
	}
	return tmp_1;
}

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) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    t_0 = (-2.0d0) / sqrt(((-4.0d0) * (a / c)))
    if (c <= (-4.1d-233)) then
        if (b >= 0.0d0) then
            tmp_2 = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
        else
            tmp_2 = t_0
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = (-0.5d0) * (sqrt(((-4.0d0) * (a * c))) / a)
    else
        tmp_1 = t_0
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = -2.0 / Math.sqrt((-4.0 * (a / c)));
	double tmp_1;
	if (c <= -4.1e-233) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -0.5 * Math.sqrt((-4.0 * (c / a)));
		} else {
			tmp_2 = t_0;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = -0.5 * (Math.sqrt((-4.0 * (a * c))) / a);
	} else {
		tmp_1 = t_0;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = -2.0 / math.sqrt((-4.0 * (a / c)))
	tmp_1 = 0
	if c <= -4.1e-233:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = -0.5 * math.sqrt((-4.0 * (c / a)))
		else:
			tmp_2 = t_0
		tmp_1 = tmp_2
	elif b >= 0.0:
		tmp_1 = -0.5 * (math.sqrt((-4.0 * (a * c))) / a)
	else:
		tmp_1 = t_0
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a / c))))
	tmp_1 = 0.0
	if (c <= -4.1e-233)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))));
		else
			tmp_2 = t_0;
		end
		tmp_1 = tmp_2;
	elseif (b >= 0.0)
		tmp_1 = Float64(-0.5 * Float64(sqrt(Float64(-4.0 * Float64(a * c))) / a));
	else
		tmp_1 = t_0;
	end
	return tmp_1
end

MATLAB

function tmp_4 = code(a, b, c)
	t_0 = -2.0 / sqrt((-4.0 * (a / c)));
	tmp_2 = 0.0;
	if (c <= -4.1e-233)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = -0.5 * sqrt((-4.0 * (c / a)));
		else
			tmp_3 = t_0;
		end
		tmp_2 = tmp_3;
	elseif (b >= 0.0)
		tmp_2 = -0.5 * (sqrt((-4.0 * (a * c))) / a);
	else
		tmp_2 = t_0;
	end
	tmp_4 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(-2.0 / N[Sqrt[N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -4.1e-233], If[GreaterEqual[b, 0.0], N[(-0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0], If[GreaterEqual[b, 0.0], N[(-0.5 * N[(N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if c < -4.1000000000000004e-233

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   if -4.1000000000000004e-233 < c

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   11. Taylor expanded in a around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   12. Step-by-step derivation

       1. lower-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       2. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

       4. lower-*.f64 22.3

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   13. Applied rewrites 22.3%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \frac{\sqrt{-4 \cdot \left(a \cdot c\right)}}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 16: 23.2% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{-4 \cdot \frac{a}{c}}\\ t_1 := -0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{if}\;a \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{t\_0}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{t\_0}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* -4.0 (/ a c)))) (t_1 (* -0.5 (sqrt (* -4.0 (/ c a))))))
   (if (<= a -1e-310)
     (if (>= b 0.0) t_1 (/ 2.0 t_0))
     (if (>= b 0.0) t_1 (/ -2.0 t_0)))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-4.0 * (a / c)));
	double t_1 = -0.5 * sqrt((-4.0 * (c / a)));
	double tmp_1;
	if (a <= -1e-310) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = 2.0 / t_0;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = t_1;
	} else {
		tmp_1 = -2.0 / t_0;
	}
	return tmp_1;
}

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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    t_0 = sqrt(((-4.0d0) * (a / c)))
    t_1 = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
    if (a <= (-1d-310)) then
        if (b >= 0.0d0) then
            tmp_2 = t_1
        else
            tmp_2 = 2.0d0 / t_0
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = t_1
    else
        tmp_1 = (-2.0d0) / t_0
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt((-4.0 * (a / c)));
	double t_1 = -0.5 * Math.sqrt((-4.0 * (c / a)));
	double tmp_1;
	if (a <= -1e-310) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = 2.0 / t_0;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = t_1;
	} else {
		tmp_1 = -2.0 / t_0;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt((-4.0 * (a / c)))
	t_1 = -0.5 * math.sqrt((-4.0 * (c / a)))
	tmp_1 = 0
	if a <= -1e-310:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = t_1
		else:
			tmp_2 = 2.0 / t_0
		tmp_1 = tmp_2
	elif b >= 0.0:
		tmp_1 = t_1
	else:
		tmp_1 = -2.0 / t_0
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(-4.0 * Float64(a / c)))
	t_1 = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))))
	tmp_1 = 0.0
	if (a <= -1e-310)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = t_1;
		else
			tmp_2 = Float64(2.0 / t_0);
		end
		tmp_1 = tmp_2;
	elseif (b >= 0.0)
		tmp_1 = t_1;
	else
		tmp_1 = Float64(-2.0 / t_0);
	end
	return tmp_1
end

MATLAB

function tmp_4 = code(a, b, c)
	t_0 = sqrt((-4.0 * (a / c)));
	t_1 = -0.5 * sqrt((-4.0 * (c / a)));
	tmp_2 = 0.0;
	if (a <= -1e-310)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = t_1;
		else
			tmp_3 = 2.0 / t_0;
		end
		tmp_2 = tmp_3;
	elseif (b >= 0.0)
		tmp_2 = t_1;
	else
		tmp_2 = -2.0 / t_0;
	end
	tmp_4 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(-0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -1e-310], If[GreaterEqual[b, 0.0], t$95$1, N[(2.0 / t$95$0), $MachinePrecision]], If[GreaterEqual[b, 0.0], t$95$1, N[(-2.0 / t$95$0), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if a < -9.999999999999969e-311

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.3%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]

   if -9.999999999999969e-311 < a

   1. Initial program 71.8%

      \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   2. Taylor expanded in b around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

      2. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

      3. lower-*.f64 37.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

   4. Applied rewrites 37.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

      4. lower-/.f64 9.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   7. Applied rewrites 9.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   8. Taylor expanded in c around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
   9. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      3. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

      4. lower-/.f64 16.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

   10. Applied rewrites 16.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 17: 16.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0)
   (* -0.5 (sqrt (* -4.0 (/ c a))))
   (/ -2.0 (sqrt (* -4.0 (/ a c))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -0.5 * sqrt((-4.0 * (c / a)));
	} else {
		tmp = -2.0 / sqrt((-4.0 * (a / c)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, 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 >= 0.0d0) then
        tmp = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
    else
        tmp = (-2.0d0) / sqrt(((-4.0d0) * (a / c)))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -0.5 * Math.sqrt((-4.0 * (c / a)));
	} else {
		tmp = -2.0 / Math.sqrt((-4.0 * (a / c)));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = -0.5 * math.sqrt((-4.0 * (c / a)))
	else:
		tmp = -2.0 / math.sqrt((-4.0 * (a / c)))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))));
	else
		tmp = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a / c))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = -0.5 * sqrt((-4.0 * (c / a)));
	else
		tmp = -2.0 / sqrt((-4.0 * (a / c)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Initial program 71.8%

   \[\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

2. Taylor expanded in b around inf

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]
3. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

   2. lower-/.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \color{blue}{\frac{a \cdot c}{b}}}\\ \end{array} \]

   3. lower-*.f64 37.3

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{\color{blue}{a \cdot c}}{b}}\\ \end{array} \]

4. Applied rewrites 37.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}}\\ \end{array} \]

5. Taylor expanded in a around inf

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]
6. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \color{blue}{\sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   2. lower-sqrt.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   3. lower-*.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

   4. lower-/.f64 9.3

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

7. Applied rewrites 9.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot \frac{a \cdot c}{b}}\\ \end{array} \]

8. Taylor expanded in c around -inf

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
9. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

   2. lower-sqrt.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\color{blue}{\sqrt{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

   3. lower-*.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{\color{blue}{-4 \cdot \frac{a}{c}}}}\\ \end{array} \]

   4. lower-/.f64 16.8

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \color{blue}{\frac{a}{c}}}}\\ \end{array} \]

10. Applied rewrites 16.8%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\sqrt{-4 \cdot \frac{a}{c}}}\\ \end{array} \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2025151 
(FPCore (a b c)
  :name "jeff quadratic root 1"
  :precision binary64
  (if (>= b 0.0) (/ (- (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))))))