jeff quadratic root 2

Percentage Accurate: 72.2% → 88.9%

Time: 5.7s

Alternatives: 18

Speedup: 0.8×

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{2 \cdot c}{\left(-b\right) - t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + t\_0}{2 \cdot a}\\ \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) (/ (* 2.0 c) (- (- b) t_0)) (/ (+ (- b) t_0) (* 2.0 a)))))

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 = (2.0 * c) / (-b - t_0);
	} else {
		tmp = (-b + t_0) / (2.0 * a);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, 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 = (2.0d0 * c) / (-b - t_0)
    else
        tmp = (-b + t_0) / (2.0d0 * a)
    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 = (2.0 * c) / (-b - t_0);
	} else {
		tmp = (-b + t_0) / (2.0 * a);
	}
	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 = (2.0 * c) / (-b - t_0)
	else:
		tmp = (-b + t_0) / (2.0 * a)
	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(2.0 * c) / Float64(Float64(-b) - t_0));
	else
		tmp = Float64(Float64(Float64(-b) + t_0) / Float64(2.0 * a));
	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 = (2.0 * c) / (-b - t_0);
	else
		tmp = (-b + t_0) / (2.0 * a);
	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[(2.0 * c), $MachinePrecision] / N[((-b) - t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[((-b) + t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]]]

Initial Program: 72.2% 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{2 \cdot c}{\left(-b\right) - t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + t\_0}{2 \cdot a}\\ \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) (/ (* 2.0 c) (- (- b) t_0)) (/ (+ (- b) t_0) (* 2.0 a)))))

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 = (2.0 * c) / (-b - t_0);
	} else {
		tmp = (-b + t_0) / (2.0 * a);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, 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 = (2.0d0 * c) / (-b - t_0)
    else
        tmp = (-b + t_0) / (2.0d0 * a)
    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 = (2.0 * c) / (-b - t_0);
	} else {
		tmp = (-b + t_0) / (2.0 * a);
	}
	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 = (2.0 * c) / (-b - t_0)
	else:
		tmp = (-b + t_0) / (2.0 * a)
	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(2.0 * c) / Float64(Float64(-b) - t_0));
	else
		tmp = Float64(Float64(Float64(-b) + t_0) / Float64(2.0 * a));
	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 = (2.0 * c) / (-b - t_0);
	else
		tmp = (-b + t_0) / (2.0 * a);
	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[(2.0 * c), $MachinePrecision] / N[((-b) - t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[((-b) + t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]]]

Alternative 1: 88.9% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -2.00000000000000007e154

   1. Initial program 72.2%

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

   3. Applied rewrites 72.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 72.2%

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

   6. Taylor expanded in b around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-pow.f64 68.2

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

   8. Applied rewrites 68.2%

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

   if -2.00000000000000007e154 < b < 2.8000000000000001e61

   1. Initial program 72.2%

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

   3. Applied rewrites 72.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 72.2%

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

   if 2.8000000000000001e61 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

Alternative 2: 84.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.35 \cdot 10^{+154}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-4 \cdot \left(a \cdot b\right)}{\left(a \cdot a\right) \cdot 4}\\ \end{array}\\ \mathbf{elif}\;b \leq 2.8 \cdot 10^{+61}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b} \cdot -2\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(c \cdot -4, a, b \cdot b\right)} - b}{a + a}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot b}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.35e+154)
   (if (>= b 0.0)
     (/ (* 2.0 c) (- (- b) (sqrt (* -4.0 (* a c)))))
     (/ (* -4.0 (* a b)) (* (* a a) 4.0)))
   (if (<= b 2.8e+61)
     (if (>= b 0.0)
       (* (/ c (+ (sqrt (fma (* -4.0 a) c (* b b))) b)) -2.0)
       (/ (- (sqrt (fma (* c -4.0) a (* b b))) b) (+ a a)))
     (if (>= b 0.0)
       (/ (* 2.0 c) (* -2.0 b))
       (* -0.5 (sqrt (* -4.0 (/ c a))))))))

C

double code(double a, double b, double c) {
	double tmp_1;
	if (b <= -1.35e+154) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-b - sqrt((-4.0 * (a * c))));
		} else {
			tmp_2 = (-4.0 * (a * b)) / ((a * a) * 4.0);
		}
		tmp_1 = tmp_2;
	} else if (b <= 2.8e+61) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (c / (sqrt(fma((-4.0 * a), c, (b * b))) + b)) * -2.0;
		} else {
			tmp_3 = (sqrt(fma((c * -4.0), a, (b * b))) - b) / (a + a);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-2.0 * b);
	} else {
		tmp_1 = -0.5 * sqrt((-4.0 * (c / a)));
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	tmp_1 = 0.0
	if (b <= -1.35e+154)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - sqrt(Float64(-4.0 * Float64(a * c)))));
		else
			tmp_2 = Float64(Float64(-4.0 * Float64(a * b)) / Float64(Float64(a * a) * 4.0));
		end
		tmp_1 = tmp_2;
	elseif (b <= 2.8e+61)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(c / Float64(sqrt(fma(Float64(-4.0 * a), c, Float64(b * b))) + b)) * -2.0);
		else
			tmp_3 = Float64(Float64(sqrt(fma(Float64(c * -4.0), a, Float64(b * b))) - b) / Float64(a + a));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
	else
		tmp_1 = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))));
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.35e+154], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] / N[(N[(a * a), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 2.8e+61], If[GreaterEqual[b, 0.0], N[(N[(c / N[(N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(c * -4.0), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.35000000000000003e154

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. div-add N/A

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

      4. common-denominator N/A

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

      5. lower-/.f64 N/A

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

   9. Applied rewrites 35.8%

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

   10. Taylor expanded in b around -inf

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

       1. lower-*.f64 N/A

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

       2. lower-*.f64 42.9

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

   12. Applied rewrites 42.9%

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

   if -1.35000000000000003e154 < b < 2.8000000000000001e61

   1. Initial program 72.2%

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

   3. Applied rewrites 72.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

   5. Applied rewrites 72.2%

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

   if 2.8000000000000001e61 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

Alternative 3: 84.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma (* c -4.0) a (* b b)))))
   (if (<= b -1.35e+154)
     (if (>= b 0.0)
       (/ (* 2.0 c) (- (- b) (sqrt (* -4.0 (* a c)))))
       (/ (* -4.0 (* a b)) (* (* a a) 4.0)))
     (if (<= b 2.8e+61)
       (if (>= b 0.0) (* (/ -2.0 (+ b t_0)) c) (/ (- t_0 b) (+ a a)))
       (if (>= b 0.0)
         (/ (* 2.0 c) (* -2.0 b))
         (* -0.5 (sqrt (* -4.0 (/ c a)))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma((c * -4.0), a, (b * b)));
	double tmp_1;
	if (b <= -1.35e+154) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-b - sqrt((-4.0 * (a * c))));
		} else {
			tmp_2 = (-4.0 * (a * b)) / ((a * a) * 4.0);
		}
		tmp_1 = tmp_2;
	} else if (b <= 2.8e+61) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-2.0 / (b + t_0)) * c;
		} else {
			tmp_3 = (t_0 - b) / (a + a);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-2.0 * b);
	} else {
		tmp_1 = -0.5 * sqrt((-4.0 * (c / a)));
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(Float64(c * -4.0), a, Float64(b * b)))
	tmp_1 = 0.0
	if (b <= -1.35e+154)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - sqrt(Float64(-4.0 * Float64(a * c)))));
		else
			tmp_2 = Float64(Float64(-4.0 * Float64(a * b)) / Float64(Float64(a * a) * 4.0));
		end
		tmp_1 = tmp_2;
	elseif (b <= 2.8e+61)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(-2.0 / Float64(b + t_0)) * c);
		else
			tmp_3 = Float64(Float64(t_0 - b) / Float64(a + a));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
	else
		tmp_1 = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))));
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.35000000000000003e154

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. div-add N/A

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

      4. common-denominator N/A

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

      5. lower-/.f64 N/A

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

   9. Applied rewrites 35.8%

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

   10. Taylor expanded in b around -inf

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

       1. lower-*.f64 N/A

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

       2. lower-*.f64 42.9

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

   12. Applied rewrites 42.9%

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

   if -1.35000000000000003e154 < b < 2.8000000000000001e61

   1. Initial program 72.2%

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

   3. Applied rewrites 72.1%

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

   if 2.8000000000000001e61 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

Alternative 4: 79.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* -4.0 (/ c a)))))
   (if (<= b -1.35e+154)
     (if (>= b 0.0)
       (/ (* 2.0 c) (- (- b) (sqrt (* -4.0 (* a c)))))
       (/ (* -4.0 (* a b)) (* (* a a) 4.0)))
     (if (<= b -5e-267)
       (if (>= b 0.0)
         (* (/ 2.0 (* a t_0)) c)
         (/ (- (sqrt (fma (* c -4.0) a (* b b))) b) (+ a a)))
       (if (<= b 5.9e-103)
         (if (>= b 0.0)
           (* (/ -2.0 (+ (sqrt (* (* a c) -4.0)) b)) c)
           (/ (- (sqrt (* (* -4.0 c) a)) b) (+ a a)))
         (if (>= b 0.0) (/ (* 2.0 c) (* -2.0 b)) (* 0.5 t_0)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-4.0 * (c / a)));
	double tmp_1;
	if (b <= -1.35e+154) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-b - sqrt((-4.0 * (a * c))));
		} else {
			tmp_2 = (-4.0 * (a * b)) / ((a * a) * 4.0);
		}
		tmp_1 = tmp_2;
	} else if (b <= -5e-267) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (2.0 / (a * t_0)) * c;
		} else {
			tmp_3 = (sqrt(fma((c * -4.0), a, (b * b))) - b) / (a + a);
		}
		tmp_1 = tmp_3;
	} else if (b <= 5.9e-103) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = (-2.0 / (sqrt(((a * c) * -4.0)) + b)) * c;
		} else {
			tmp_4 = (sqrt(((-4.0 * c) * a)) - b) / (a + a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-2.0 * b);
	} else {
		tmp_1 = 0.5 * t_0;
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(-4.0 * Float64(c / a)))
	tmp_1 = 0.0
	if (b <= -1.35e+154)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - sqrt(Float64(-4.0 * Float64(a * c)))));
		else
			tmp_2 = Float64(Float64(-4.0 * Float64(a * b)) / Float64(Float64(a * a) * 4.0));
		end
		tmp_1 = tmp_2;
	elseif (b <= -5e-267)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(2.0 / Float64(a * t_0)) * c);
		else
			tmp_3 = Float64(Float64(sqrt(fma(Float64(c * -4.0), a, Float64(b * b))) - b) / Float64(a + a));
		end
		tmp_1 = tmp_3;
	elseif (b <= 5.9e-103)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(-2.0 / Float64(sqrt(Float64(Float64(a * c) * -4.0)) + b)) * c);
		else
			tmp_4 = Float64(Float64(sqrt(Float64(Float64(-4.0 * c) * a)) - b) / Float64(a + a));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
	else
		tmp_1 = Float64(0.5 * t_0);
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -1.35000000000000003e154

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. div-add N/A

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

      4. common-denominator N/A

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

      5. lower-/.f64 N/A

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

   9. Applied rewrites 35.8%

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

   10. Taylor expanded in b around -inf

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

       1. lower-*.f64 N/A

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

       2. lower-*.f64 42.9

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

   12. Applied rewrites 42.9%

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

   if -1.35000000000000003e154 < b < -4.9999999999999999e-267

   1. Initial program 72.2%

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

   3. Applied rewrites 72.1%

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

   4. Taylor expanded in a around -inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 43.7

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

   6. Applied rewrites 43.7%

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

   if -4.9999999999999999e-267 < b < 5.8999999999999999e-103

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

   9. Applied rewrites 41.5%

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

       1. lift-/.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. *-commutative N/A

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

       4. associate-/l* N/A

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

       5. *-commutative N/A

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

       6. lower-*.f64 N/A

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

   11. Applied rewrites 41.5%

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

   if 5.8999999999999999e-103 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 5: 71.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fabs (* (* a c) -4.0)))))
   (if (<= b -3.2e-24)
     (if (>= b 0.0)
       (/ (* 2.0 c) (- (- b) (sqrt (* -4.0 (* a c)))))
       (/ (* -4.0 (* a b)) (* (* a a) 4.0)))
     (if (<= b 5.9e-103)
       (if (>= b 0.0) (/ (* -2.0 c) (+ t_0 b)) (/ (- t_0 b) (+ a a)))
       (if (>= b 0.0)
         (/ (* 2.0 c) (* -2.0 b))
         (* 0.5 (sqrt (* -4.0 (/ c a)))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fabs(((a * c) * -4.0)));
	double tmp_1;
	if (b <= -3.2e-24) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-b - sqrt((-4.0 * (a * c))));
		} else {
			tmp_2 = (-4.0 * (a * b)) / ((a * a) * 4.0);
		}
		tmp_1 = tmp_2;
	} else if (b <= 5.9e-103) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-2.0 * c) / (t_0 + b);
		} else {
			tmp_3 = (t_0 - b) / (a + a);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-2.0 * b);
	} else {
		tmp_1 = 0.5 * sqrt((-4.0 * (c / a)));
	}
	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(abs(((a * c) * (-4.0d0))))
    if (b <= (-3.2d-24)) then
        if (b >= 0.0d0) then
            tmp_2 = (2.0d0 * c) / (-b - sqrt(((-4.0d0) * (a * c))))
        else
            tmp_2 = ((-4.0d0) * (a * b)) / ((a * a) * 4.0d0)
        end if
        tmp_1 = tmp_2
    else if (b <= 5.9d-103) then
        if (b >= 0.0d0) then
            tmp_3 = ((-2.0d0) * c) / (t_0 + b)
        else
            tmp_3 = (t_0 - b) / (a + a)
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (2.0d0 * c) / ((-2.0d0) * b)
    else
        tmp_1 = 0.5d0 * sqrt(((-4.0d0) * (c / a)))
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

function code(a, b, c)
	t_0 = sqrt(abs(Float64(Float64(a * c) * -4.0)))
	tmp_1 = 0.0
	if (b <= -3.2e-24)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - sqrt(Float64(-4.0 * Float64(a * c)))));
		else
			tmp_2 = Float64(Float64(-4.0 * Float64(a * b)) / Float64(Float64(a * a) * 4.0));
		end
		tmp_1 = tmp_2;
	elseif (b <= 5.9e-103)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(-2.0 * c) / Float64(t_0 + b));
		else
			tmp_3 = Float64(Float64(t_0 - b) / Float64(a + a));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
	else
		tmp_1 = Float64(0.5 * sqrt(Float64(-4.0 * Float64(c / a))));
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = sqrt(abs(((a * c) * -4.0)));
	tmp_2 = 0.0;
	if (b <= -3.2e-24)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (2.0 * c) / (-b - sqrt((-4.0 * (a * c))));
		else
			tmp_3 = (-4.0 * (a * b)) / ((a * a) * 4.0);
		end
		tmp_2 = tmp_3;
	elseif (b <= 5.9e-103)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (-2.0 * c) / (t_0 + b);
		else
			tmp_4 = (t_0 - b) / (a + a);
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = (2.0 * c) / (-2.0 * b);
	else
		tmp_2 = 0.5 * sqrt((-4.0 * (c / a)));
	end
	tmp_5 = tmp_2;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -3.20000000000000012e-24

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. div-add N/A

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

      4. common-denominator N/A

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

      5. lower-/.f64 N/A

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

   9. Applied rewrites 35.8%

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

   10. Taylor expanded in b around -inf

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

       1. lower-*.f64 N/A

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

       2. lower-*.f64 42.9

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

   12. Applied rewrites 42.9%

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

   if -3.20000000000000012e-24 < b < 5.8999999999999999e-103

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

   9. Applied rewrites 41.5%

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

       1. rem-square-sqrt N/A

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

       2. lift-sqrt.f64 N/A

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

       3. lift-sqrt.f64 N/A

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

       4. sqr-abs-rev N/A

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

       5. mul-fabs N/A

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

       6. lift-sqrt.f64 N/A

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

       7. lift-sqrt.f64 N/A

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

       8. rem-square-sqrt N/A

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

       9. lower-fabs.f64 45.9

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

   11. Applied rewrites 45.9%

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

       1. rem-square-sqrt N/A

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

       2. lift-sqrt.f64 N/A

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

       3. lift-sqrt.f64 N/A

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

       4. sqr-abs-rev N/A

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

       5. mul-fabs N/A

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

       6. lift-sqrt.f64 N/A

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

       7. lift-sqrt.f64 N/A

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

       8. rem-square-sqrt N/A

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

       9. lower-fabs.f64 50.8

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

   13. Applied rewrites 50.8%

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

   if 5.8999999999999999e-103 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 6: 70.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.6 \cdot 10^{-24}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-4 \cdot \left(a \cdot b\right)}{\left(a \cdot a\right) \cdot 4}\\ \end{array}\\ \mathbf{elif}\;b \leq 5.9 \cdot 10^{-103}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2}{\sqrt{\left(a \cdot c\right) \cdot -4} + b} \cdot c\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot c\right) \cdot a} - b}{a + a}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot b}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{-4 \cdot \frac{c}{a}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.6e-24)
   (if (>= b 0.0)
     (/ (* 2.0 c) (- (- b) (sqrt (* -4.0 (* a c)))))
     (/ (* -4.0 (* a b)) (* (* a a) 4.0)))
   (if (<= b 5.9e-103)
     (if (>= b 0.0)
       (* (/ -2.0 (+ (sqrt (* (* a c) -4.0)) b)) c)
       (/ (- (sqrt (* (* -4.0 c) a)) b) (+ a a)))
     (if (>= b 0.0)
       (/ (* 2.0 c) (* -2.0 b))
       (* 0.5 (sqrt (* -4.0 (/ c a))))))))

C

double code(double a, double b, double c) {
	double tmp_1;
	if (b <= -2.6e-24) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-b - sqrt((-4.0 * (a * c))));
		} else {
			tmp_2 = (-4.0 * (a * b)) / ((a * a) * 4.0);
		}
		tmp_1 = tmp_2;
	} else if (b <= 5.9e-103) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-2.0 / (sqrt(((a * c) * -4.0)) + b)) * c;
		} else {
			tmp_3 = (sqrt(((-4.0 * c) * a)) - b) / (a + a);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-2.0 * b);
	} else {
		tmp_1 = 0.5 * sqrt((-4.0 * (c / a)));
	}
	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) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    if (b <= (-2.6d-24)) then
        if (b >= 0.0d0) then
            tmp_2 = (2.0d0 * c) / (-b - sqrt(((-4.0d0) * (a * c))))
        else
            tmp_2 = ((-4.0d0) * (a * b)) / ((a * a) * 4.0d0)
        end if
        tmp_1 = tmp_2
    else if (b <= 5.9d-103) then
        if (b >= 0.0d0) then
            tmp_3 = ((-2.0d0) / (sqrt(((a * c) * (-4.0d0))) + b)) * c
        else
            tmp_3 = (sqrt((((-4.0d0) * c) * a)) - b) / (a + a)
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (2.0d0 * c) / ((-2.0d0) * b)
    else
        tmp_1 = 0.5d0 * sqrt(((-4.0d0) * (c / a)))
    end if
    code = tmp_1
end function

Java

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

Python

def code(a, b, c):
	tmp_1 = 0
	if b <= -2.6e-24:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = (2.0 * c) / (-b - math.sqrt((-4.0 * (a * c))))
		else:
			tmp_2 = (-4.0 * (a * b)) / ((a * a) * 4.0)
		tmp_1 = tmp_2
	elif b <= 5.9e-103:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = (-2.0 / (math.sqrt(((a * c) * -4.0)) + b)) * c
		else:
			tmp_3 = (math.sqrt(((-4.0 * c) * a)) - b) / (a + a)
		tmp_1 = tmp_3
	elif b >= 0.0:
		tmp_1 = (2.0 * c) / (-2.0 * b)
	else:
		tmp_1 = 0.5 * math.sqrt((-4.0 * (c / a)))
	return tmp_1

Julia

function code(a, b, c)
	tmp_1 = 0.0
	if (b <= -2.6e-24)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - sqrt(Float64(-4.0 * Float64(a * c)))));
		else
			tmp_2 = Float64(Float64(-4.0 * Float64(a * b)) / Float64(Float64(a * a) * 4.0));
		end
		tmp_1 = tmp_2;
	elseif (b <= 5.9e-103)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(-2.0 / Float64(sqrt(Float64(Float64(a * c) * -4.0)) + b)) * c);
		else
			tmp_3 = Float64(Float64(sqrt(Float64(Float64(-4.0 * c) * a)) - b) / Float64(a + a));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
	else
		tmp_1 = Float64(0.5 * sqrt(Float64(-4.0 * Float64(c / a))));
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	tmp_2 = 0.0;
	if (b <= -2.6e-24)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (2.0 * c) / (-b - sqrt((-4.0 * (a * c))));
		else
			tmp_3 = (-4.0 * (a * b)) / ((a * a) * 4.0);
		end
		tmp_2 = tmp_3;
	elseif (b <= 5.9e-103)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (-2.0 / (sqrt(((a * c) * -4.0)) + b)) * c;
		else
			tmp_4 = (sqrt(((-4.0 * c) * a)) - b) / (a + a);
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = (2.0 * c) / (-2.0 * b);
	else
		tmp_2 = 0.5 * sqrt((-4.0 * (c / a)));
	end
	tmp_5 = tmp_2;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.6e-24], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - N[Sqrt[N[(-4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] / N[(N[(a * a), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 5.9e-103], If[GreaterEqual[b, 0.0], N[(N[(-2.0 / N[(N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.6e-24

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

      1. lift-/.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. div-add N/A

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

      4. common-denominator N/A

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

      5. lower-/.f64 N/A

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

   9. Applied rewrites 35.8%

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

   10. Taylor expanded in b around -inf

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

       1. lower-*.f64 N/A

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

       2. lower-*.f64 42.9

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

   12. Applied rewrites 42.9%

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

   if -2.6e-24 < b < 5.8999999999999999e-103

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

   9. Applied rewrites 41.5%

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

       1. lift-/.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. *-commutative N/A

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

       4. associate-/l* N/A

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

       5. *-commutative N/A

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

       6. lower-*.f64 N/A

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

   11. Applied rewrites 41.5%

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

   if 5.8999999999999999e-103 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 7: 60.4% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 5.9e-103)
   (if (>= b 0.0)
     (* (/ -2.0 (+ (sqrt (* (* a c) -4.0)) b)) c)
     (/ (- (sqrt (* (* -4.0 c) a)) b) (+ a a)))
   (if (>= b 0.0) (/ (* 2.0 c) (* -2.0 b)) (* 0.5 (sqrt (* -4.0 (/ c a)))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 5.9e-103], If[GreaterEqual[b, 0.0], N[(N[(-2.0 / N[(N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if b < 5.8999999999999999e-103

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

   9. Applied rewrites 41.5%

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

       1. lift-/.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. *-commutative N/A

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

       4. associate-/l* N/A

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

       5. *-commutative N/A

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

       6. lower-*.f64 N/A

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

   11. Applied rewrites 41.5%

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

   if 5.8999999999999999e-103 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 8: 60.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-4.0 * (c / a)));
	double tmp_1;
	if (b <= -4e-310) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-2.0 * c) / (2.0 * ((a * c) / b));
		} else {
			tmp_2 = (sqrt(((-4.0 * c) * a)) - b) / (a + a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 5.9e-103) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -2.0 * (c / sqrt(-(4.0 * (a * c))));
		} else {
			tmp_3 = -0.5 * t_0;
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-2.0 * b);
	} else {
		tmp_1 = 0.5 * 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
    real(8) :: tmp_3
    t_0 = sqrt(((-4.0d0) * (c / a)))
    if (b <= (-4d-310)) then
        if (b >= 0.0d0) then
            tmp_2 = ((-2.0d0) * c) / (2.0d0 * ((a * c) / b))
        else
            tmp_2 = (sqrt((((-4.0d0) * c) * a)) - b) / (a + a)
        end if
        tmp_1 = tmp_2
    else if (b <= 5.9d-103) then
        if (b >= 0.0d0) then
            tmp_3 = (-2.0d0) * (c / sqrt(-(4.0d0 * (a * c))))
        else
            tmp_3 = (-0.5d0) * t_0
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (2.0d0 * c) / ((-2.0d0) * b)
    else
        tmp_1 = 0.5d0 * 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 * (c / a)));
	double tmp_1;
	if (b <= -4e-310) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-2.0 * c) / (2.0 * ((a * c) / b));
		} else {
			tmp_2 = (Math.sqrt(((-4.0 * c) * a)) - b) / (a + a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 5.9e-103) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -2.0 * (c / Math.sqrt(-(4.0 * (a * c))));
		} else {
			tmp_3 = -0.5 * t_0;
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-2.0 * b);
	} else {
		tmp_1 = 0.5 * t_0;
	}
	return tmp_1;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -3.999999999999988e-310

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

   9. Applied rewrites 41.5%

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

   10. Taylor expanded in b around -inf

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

       1. lower-*.f64 N/A

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

       2. lower-/.f64 N/A

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

       3. lower-*.f64 21.6

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

   12. Applied rewrites 21.6%

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

   if -3.999999999999988e-310 < b < 5.8999999999999999e-103

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

   8. Taylor expanded in b around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 21.3

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

   10. Applied rewrites 21.3%

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

   if 5.8999999999999999e-103 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 9: 60.2% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 5.9e-103)
   (if (>= b 0.0)
     (/ (* -2.0 c) (sqrt (- (* 4.0 (* a c)))))
     (* (/ 0.5 a) (- (sqrt (* (* a c) -4.0)) b)))
   (if (>= b 0.0) (/ (* 2.0 c) (* -2.0 b)) (* 0.5 (sqrt (* -4.0 (/ c a)))))))

C

double code(double a, double b, double c) {
	double tmp_1;
	if (b <= 5.9e-103) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-2.0 * c) / sqrt(-(4.0 * (a * c)));
		} else {
			tmp_2 = (0.5 / a) * (sqrt(((a * c) * -4.0)) - b);
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-2.0 * b);
	} else {
		tmp_1 = 0.5 * sqrt((-4.0 * (c / a)));
	}
	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) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    if (b <= 5.9d-103) then
        if (b >= 0.0d0) then
            tmp_2 = ((-2.0d0) * c) / sqrt(-(4.0d0 * (a * c)))
        else
            tmp_2 = (0.5d0 / a) * (sqrt(((a * c) * (-4.0d0))) - b)
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = (2.0d0 * c) / ((-2.0d0) * b)
    else
        tmp_1 = 0.5d0 * sqrt(((-4.0d0) * (c / a)))
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 5.9e-103], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * c), $MachinePrecision] / N[Sqrt[(-N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision])], $MachinePrecision]), $MachinePrecision], N[(N[(0.5 / a), $MachinePrecision] * N[(N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if b < 5.8999999999999999e-103

   1. Initial program 72.2%

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

   2. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 57.3

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

   4. Applied rewrites 57.3%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 41.5

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

   7. Applied rewrites 41.5%

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

   9. Applied rewrites 41.5%

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

       1. lift-/.f64 N/A

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

       2. mult-flip N/A

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

       3. lift-+.f64 N/A

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

       4. count-2-rev N/A

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

       5. lift-*.f64 N/A

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

       6. *-commutative N/A

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

       7. lower-*.f64 N/A

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

       8. lift-*.f64 N/A

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

       9. count-2-rev N/A

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

       10. lift-+.f64 N/A

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

       11. lift-+.f64 N/A

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

       12. count-2-rev N/A

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

       13. associate-/r* N/A

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

       14. metadata-eval N/A

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

       15. lift-/.f64 41.4

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

   11. Applied rewrites 41.4%

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

   12. Taylor expanded in b around 0

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

       1. lower-sqrt.f64 N/A

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

       2. lower-neg.f64 N/A

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

       3. lower-*.f64 N/A

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

       4. lower-*.f64 34.1

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

   14. Applied rewrites 34.1%

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

   if 5.8999999999999999e-103 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 10: 53.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-4.0 * (c / a)));
	double t_1 = (2.0 * c) / (-2.0 * b);
	double tmp_1;
	if (b <= -4e-310) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = -0.5 * (c * sqrt((-4.0 / (a * c))));
		}
		tmp_1 = tmp_2;
	} else if (b <= 5.9e-103) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -2.0 * (c / sqrt(-(4.0 * (a * c))));
		} else {
			tmp_3 = -0.5 * t_0;
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = t_1;
	} else {
		tmp_1 = 0.5 * 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
    real(8) :: tmp_3
    t_0 = sqrt(((-4.0d0) * (c / a)))
    t_1 = (2.0d0 * c) / ((-2.0d0) * b)
    if (b <= (-4d-310)) then
        if (b >= 0.0d0) then
            tmp_2 = t_1
        else
            tmp_2 = (-0.5d0) * (c * sqrt(((-4.0d0) / (a * c))))
        end if
        tmp_1 = tmp_2
    else if (b <= 5.9d-103) then
        if (b >= 0.0d0) then
            tmp_3 = (-2.0d0) * (c / sqrt(-(4.0d0 * (a * c))))
        else
            tmp_3 = (-0.5d0) * t_0
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = t_1
    else
        tmp_1 = 0.5d0 * 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 * (c / a)));
	double t_1 = (2.0 * c) / (-2.0 * b);
	double tmp_1;
	if (b <= -4e-310) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = -0.5 * (c * Math.sqrt((-4.0 / (a * c))));
		}
		tmp_1 = tmp_2;
	} else if (b <= 5.9e-103) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -2.0 * (c / Math.sqrt(-(4.0 * (a * c))));
		} else {
			tmp_3 = -0.5 * t_0;
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = t_1;
	} else {
		tmp_1 = 0.5 * t_0;
	}
	return tmp_1;
}

Python

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

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(-4.0 * Float64(c / a)))
	t_1 = Float64(Float64(2.0 * c) / Float64(-2.0 * b))
	tmp_1 = 0.0
	if (b <= -4e-310)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = t_1;
		else
			tmp_2 = Float64(-0.5 * Float64(c * sqrt(Float64(-4.0 / Float64(a * c)))));
		end
		tmp_1 = tmp_2;
	elseif (b <= 5.9e-103)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(-2.0 * Float64(c / sqrt(Float64(-Float64(4.0 * Float64(a * c))))));
		else
			tmp_3 = Float64(-0.5 * t_0);
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = t_1;
	else
		tmp_1 = Float64(0.5 * t_0);
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = sqrt((-4.0 * (c / a)));
	t_1 = (2.0 * c) / (-2.0 * b);
	tmp_2 = 0.0;
	if (b <= -4e-310)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = t_1;
		else
			tmp_3 = -0.5 * (c * sqrt((-4.0 / (a * c))));
		end
		tmp_2 = tmp_3;
	elseif (b <= 5.9e-103)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = -2.0 * (c / sqrt(-(4.0 * (a * c))));
		else
			tmp_4 = -0.5 * t_0;
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = t_1;
	else
		tmp_2 = 0.5 * t_0;
	end
	tmp_5 = tmp_2;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -3.999999999999988e-310

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

   8. Taylor expanded in c around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 47.5

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

   10. Applied rewrites 47.5%

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

   if -3.999999999999988e-310 < b < 5.8999999999999999e-103

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

   8. Taylor expanded in b around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 21.3

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

   10. Applied rewrites 21.3%

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

   if 5.8999999999999999e-103 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 11: 49.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* -4.0 (/ c a))))
        (t_1
         (if (>= b 0.0)
           (/ (+ c c) (* -2.0 b))
           (/ (sqrt (* (* a c) -4.0)) (+ a a)))))
   (if (<= b -1.65e-51)
     (if (>= b 0.0) (/ (* 2.0 c) (* -2.0 b)) (* 0.5 t_0))
     (if (<= b -4e-310)
       t_1
       (if (<= b 1.5e-126)
         (if (>= b 0.0) (/ -2.0 (sqrt (* -4.0 (/ a c)))) (* -0.5 t_0))
         t_1)))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-4.0 * (c / a)));
	double tmp;
	if (b >= 0.0) {
		tmp = (c + c) / (-2.0 * b);
	} else {
		tmp = sqrt(((a * c) * -4.0)) / (a + a);
	}
	double t_1 = tmp;
	double tmp_2;
	if (b <= -1.65e-51) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_3 = 0.5 * t_0;
		}
		tmp_2 = tmp_3;
	} else if (b <= -4e-310) {
		tmp_2 = t_1;
	} else if (b <= 1.5e-126) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -2.0 / sqrt((-4.0 * (a / c)));
		} else {
			tmp_4 = -0.5 * t_0;
		}
		tmp_2 = tmp_4;
	} else {
		tmp_2 = t_1;
	}
	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) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = sqrt(((-4.0d0) * (c / a)))
    if (b >= 0.0d0) then
        tmp = (c + c) / ((-2.0d0) * b)
    else
        tmp = sqrt(((a * c) * (-4.0d0))) / (a + a)
    end if
    t_1 = tmp
    if (b <= (-1.65d-51)) then
        if (b >= 0.0d0) then
            tmp_3 = (2.0d0 * c) / ((-2.0d0) * b)
        else
            tmp_3 = 0.5d0 * t_0
        end if
        tmp_2 = tmp_3
    else if (b <= (-4d-310)) then
        tmp_2 = t_1
    else if (b <= 1.5d-126) then
        if (b >= 0.0d0) then
            tmp_4 = (-2.0d0) / sqrt(((-4.0d0) * (a / c)))
        else
            tmp_4 = (-0.5d0) * t_0
        end if
        tmp_2 = tmp_4
    else
        tmp_2 = t_1
    end if
    code = tmp_2
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt((-4.0 * (c / a)));
	double tmp;
	if (b >= 0.0) {
		tmp = (c + c) / (-2.0 * b);
	} else {
		tmp = Math.sqrt(((a * c) * -4.0)) / (a + a);
	}
	double t_1 = tmp;
	double tmp_2;
	if (b <= -1.65e-51) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_3 = 0.5 * t_0;
		}
		tmp_2 = tmp_3;
	} else if (b <= -4e-310) {
		tmp_2 = t_1;
	} else if (b <= 1.5e-126) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -2.0 / Math.sqrt((-4.0 * (a / c)));
		} else {
			tmp_4 = -0.5 * t_0;
		}
		tmp_2 = tmp_4;
	} else {
		tmp_2 = t_1;
	}
	return tmp_2;
}

Python

def code(a, b, c):
	t_0 = math.sqrt((-4.0 * (c / a)))
	tmp = 0
	if b >= 0.0:
		tmp = (c + c) / (-2.0 * b)
	else:
		tmp = math.sqrt(((a * c) * -4.0)) / (a + a)
	t_1 = tmp
	tmp_2 = 0
	if b <= -1.65e-51:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = (2.0 * c) / (-2.0 * b)
		else:
			tmp_3 = 0.5 * t_0
		tmp_2 = tmp_3
	elif b <= -4e-310:
		tmp_2 = t_1
	elif b <= 1.5e-126:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = -2.0 / math.sqrt((-4.0 * (a / c)))
		else:
			tmp_4 = -0.5 * t_0
		tmp_2 = tmp_4
	else:
		tmp_2 = t_1
	return tmp_2

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(-4.0 * Float64(c / a)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(c + c) / Float64(-2.0 * b));
	else
		tmp = Float64(sqrt(Float64(Float64(a * c) * -4.0)) / Float64(a + a));
	end
	t_1 = tmp
	tmp_2 = 0.0
	if (b <= -1.65e-51)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
		else
			tmp_3 = Float64(0.5 * t_0);
		end
		tmp_2 = tmp_3;
	elseif (b <= -4e-310)
		tmp_2 = t_1;
	elseif (b <= 1.5e-126)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a / c))));
		else
			tmp_4 = Float64(-0.5 * t_0);
		end
		tmp_2 = tmp_4;
	else
		tmp_2 = t_1;
	end
	return tmp_2
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = sqrt((-4.0 * (c / a)));
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (c + c) / (-2.0 * b);
	else
		tmp = sqrt(((a * c) * -4.0)) / (a + a);
	end
	t_1 = tmp;
	tmp_3 = 0.0;
	if (b <= -1.65e-51)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (2.0 * c) / (-2.0 * b);
		else
			tmp_4 = 0.5 * t_0;
		end
		tmp_3 = tmp_4;
	elseif (b <= -4e-310)
		tmp_3 = t_1;
	elseif (b <= 1.5e-126)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = -2.0 / sqrt((-4.0 * (a / c)));
		else
			tmp_5 = -0.5 * t_0;
		end
		tmp_3 = tmp_5;
	else
		tmp_3 = t_1;
	end
	tmp_6 = tmp_3;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.64999999999999986e-51

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

   if -1.64999999999999986e-51 < b < -3.999999999999988e-310 or 1.5000000000000001e-126 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   6. Applied rewrites 69.6%

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

   7. Taylor expanded in b around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 46.5

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

   9. Applied rewrites 46.5%

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

   11. Applied rewrites 46.5%

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

   if -3.999999999999988e-310 < b < 1.5000000000000001e-126

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

   8. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 16.7

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

   10. Applied rewrites 16.7%

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

Alternative 12: 49.6% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4e-310)
   (if (>= b 0.0)
     (/ (* 2.0 c) (* -2.0 b))
     (* -0.5 (* c (sqrt (/ -4.0 (* a c))))))
   (if (<= b 1.5e-126)
     (if (>= b 0.0)
       (/ -2.0 (sqrt (* -4.0 (/ a c))))
       (* -0.5 (sqrt (* -4.0 (/ c a)))))
     (if (>= b 0.0)
       (/ (+ c c) (* -2.0 b))
       (/ (sqrt (* (* a c) -4.0)) (+ a a))))))

C

double code(double a, double b, double c) {
	double tmp_1;
	if (b <= -4e-310) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_2 = -0.5 * (c * sqrt((-4.0 / (a * c))));
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.5e-126) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -2.0 / sqrt((-4.0 * (a / c)));
		} else {
			tmp_3 = -0.5 * sqrt((-4.0 * (c / a)));
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (c + c) / (-2.0 * b);
	} else {
		tmp_1 = sqrt(((a * c) * -4.0)) / (a + a);
	}
	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) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    if (b <= (-4d-310)) then
        if (b >= 0.0d0) then
            tmp_2 = (2.0d0 * c) / ((-2.0d0) * b)
        else
            tmp_2 = (-0.5d0) * (c * sqrt(((-4.0d0) / (a * c))))
        end if
        tmp_1 = tmp_2
    else if (b <= 1.5d-126) then
        if (b >= 0.0d0) then
            tmp_3 = (-2.0d0) / sqrt(((-4.0d0) * (a / c)))
        else
            tmp_3 = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (c + c) / ((-2.0d0) * b)
    else
        tmp_1 = sqrt(((a * c) * (-4.0d0))) / (a + a)
    end if
    code = tmp_1
end function

Java

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

Python

def code(a, b, c):
	tmp_1 = 0
	if b <= -4e-310:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = (2.0 * c) / (-2.0 * b)
		else:
			tmp_2 = -0.5 * (c * math.sqrt((-4.0 / (a * c))))
		tmp_1 = tmp_2
	elif b <= 1.5e-126:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = -2.0 / math.sqrt((-4.0 * (a / c)))
		else:
			tmp_3 = -0.5 * math.sqrt((-4.0 * (c / a)))
		tmp_1 = tmp_3
	elif b >= 0.0:
		tmp_1 = (c + c) / (-2.0 * b)
	else:
		tmp_1 = math.sqrt(((a * c) * -4.0)) / (a + a)
	return tmp_1

Julia

function code(a, b, c)
	tmp_1 = 0.0
	if (b <= -4e-310)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
		else
			tmp_2 = Float64(-0.5 * Float64(c * sqrt(Float64(-4.0 / Float64(a * c)))));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.5e-126)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(-2.0 / sqrt(Float64(-4.0 * Float64(a / c))));
		else
			tmp_3 = Float64(-0.5 * sqrt(Float64(-4.0 * Float64(c / a))));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c + c) / Float64(-2.0 * b));
	else
		tmp_1 = Float64(sqrt(Float64(Float64(a * c) * -4.0)) / Float64(a + a));
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	tmp_2 = 0.0;
	if (b <= -4e-310)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (2.0 * c) / (-2.0 * b);
		else
			tmp_3 = -0.5 * (c * sqrt((-4.0 / (a * c))));
		end
		tmp_2 = tmp_3;
	elseif (b <= 1.5e-126)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = -2.0 / sqrt((-4.0 * (a / c)));
		else
			tmp_4 = -0.5 * sqrt((-4.0 * (c / a)));
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = (c + c) / (-2.0 * b);
	else
		tmp_2 = sqrt(((a * c) * -4.0)) / (a + a);
	end
	tmp_5 = tmp_2;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4e-310], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c * N[Sqrt[N[(-4.0 / N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.5e-126], If[GreaterEqual[b, 0.0], N[(-2.0 / N[Sqrt[N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.999999999999988e-310

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

   8. Taylor expanded in c around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 47.5

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

   10. Applied rewrites 47.5%

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

   if -3.999999999999988e-310 < b < 1.5000000000000001e-126

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

   8. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 16.7

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

   10. Applied rewrites 16.7%

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

   if 1.5000000000000001e-126 < b

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   6. Applied rewrites 69.6%

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

   7. Taylor expanded in b around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 46.5

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

   9. Applied rewrites 46.5%

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

   11. Applied rewrites 46.5%

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

Alternative 13: 48.9% accurate, 1.3× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double t_0 = (2.0 * c) / (-2.0 * b);
	double tmp_1;
	if (a <= 2.1e-296) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0;
		} else {
			tmp_2 = -0.5 * sqrt(fabs(((c / a) * -4.0)));
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = t_0;
	} else {
		tmp_1 = 0.5 * sqrt((-4.0 * (c / a)));
	}
	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 * c) / ((-2.0d0) * b)
    if (a <= 2.1d-296) then
        if (b >= 0.0d0) then
            tmp_2 = t_0
        else
            tmp_2 = (-0.5d0) * sqrt(abs(((c / a) * (-4.0d0))))
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = t_0
    else
        tmp_1 = 0.5d0 * sqrt(((-4.0d0) * (c / a)))
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < 2.0999999999999999e-296

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

      1. rem-square-sqrt N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. sqr-abs-rev N/A

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

      5. mul-fabs N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-sqrt.f64 N/A

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

      8. rem-square-sqrt N/A

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

      9. lower-fabs.f64 42.4

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 42.4

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

   9. Applied rewrites 42.4%

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

   if 2.0999999999999999e-296 < a

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 14: 48.5% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(-4.0 * N[(c / a), $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[If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[((-b) + t$95$1), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]], -2e-118], If[GreaterEqual[b, 0.0], N[(-2.0 / N[Sqrt[N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-0.5 * t$95$0), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(0.5 * t$95$0), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if (if (>=.f64 b #s(literal 0 binary64)) (/.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))))) (/.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))) < -1.99999999999999997e-118

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

   8. Taylor expanded in c around inf

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

      1. lower-/.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 16.7

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

   10. Applied rewrites 16.7%

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

   if -1.99999999999999997e-118 < (if (>=.f64 b #s(literal 0 binary64)) (/.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))))) (/.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)))

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 15: 47.8% accurate, 1.4× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-4.0 * (c / a)));
	double t_1 = (2.0 * c) / (-2.0 * b);
	double tmp_1;
	if (a <= -4e-310) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = -0.5 * t_0;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = t_1;
	} else {
		tmp_1 = 0.5 * 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) * (c / a)))
    t_1 = (2.0d0 * c) / ((-2.0d0) * b)
    if (a <= (-4d-310)) then
        if (b >= 0.0d0) then
            tmp_2 = t_1
        else
            tmp_2 = (-0.5d0) * t_0
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = t_1
    else
        tmp_1 = 0.5d0 * 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 * (c / a)));
	double t_1 = (2.0 * c) / (-2.0 * b);
	double tmp_1;
	if (a <= -4e-310) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = -0.5 * t_0;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = t_1;
	} else {
		tmp_1 = 0.5 * t_0;
	}
	return tmp_1;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -3.999999999999988e-310

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.1

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

   7. Applied rewrites 41.1%

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

   if -3.999999999999988e-310 < a

   1. Initial program 72.2%

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

   2. Taylor expanded in b around inf

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

      1. lower-*.f64 69.6

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

   4. Applied rewrites 69.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 41.5

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

   7. Applied rewrites 41.5%

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

Alternative 16: 41.1% accurate, 1.8× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = (2.0 * c) / (-2.0 * b);
	} else {
		tmp = -0.5 * sqrt((-4.0 * (c / a)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, 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 = (2.0d0 * c) / ((-2.0d0) * b)
    else
        tmp = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 72.2%

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

2. Taylor expanded in b around inf

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

   1. lower-*.f64 69.6

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

4. Applied rewrites 69.6%

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

5. Taylor expanded in a around -inf

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

   1. lower-*.f64 N/A

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

   2. lower-sqrt.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 41.1

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

7. Applied rewrites 41.1%

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

Alternative 17: 41.0% accurate, 1.8× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = (2.0 / (-2.0 * b)) * c;
	} else {
		tmp = -0.5 * sqrt((-4.0 * (c / a)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, 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 = (2.0d0 / ((-2.0d0) * b)) * c
    else
        tmp = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 72.2%

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

2. Taylor expanded in b around inf

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

   1. lower-*.f64 69.6

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

4. Applied rewrites 69.6%

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

5. Taylor expanded in a around -inf

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

   1. lower-*.f64 N/A

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

   2. lower-sqrt.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 41.1

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

7. Applied rewrites 41.1%

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

   1. lift-/.f64 N/A

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

   2. mult-flip N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. associate-*l* N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 N/A

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

   8. mult-flip-rev N/A

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

   9. lower-/.f64 41.0

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

9. Applied rewrites 41.0%

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

Alternative 18: 8.9% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0) (* -1.0 (/ b a)) (* -0.5 (sqrt (* -4.0 (/ c a))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -1.0 * (b / a);
	} else {
		tmp = -0.5 * sqrt((-4.0 * (c / a)));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, 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 = (-1.0d0) * (b / a)
    else
        tmp = (-0.5d0) * sqrt(((-4.0d0) * (c / a)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[GreaterEqual[b, 0.0], N[(-1.0 * N[(b / a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[Sqrt[N[(-4.0 * N[(c / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 72.2%

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

2. Taylor expanded in b around inf

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

   1. lower-*.f64 69.6

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

4. Applied rewrites 69.6%

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

5. Taylor expanded in a around -inf

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

   1. lower-*.f64 N/A

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

   2. lower-sqrt.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 41.1

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

7. Applied rewrites 41.1%

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

8. Taylor expanded in b around -inf

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

   1. lower-*.f64 N/A

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

   2. lower-/.f64 8.9

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

10. Applied rewrites 8.9%

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

Reproduce

herbie shell --seed 2025147 
(FPCore (a b c)
  :name "jeff quadratic root 2"
  :precision binary64
  (if (>= b 0.0) (/ (* 2.0 c) (- (- b) (sqrt (- (* b b) (* (* 4.0 a) c))))) (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a))))