jeff quadratic root 2

Percentage Accurate: 71.6% → 90.3%

Time: 5.3s

Alternatives: 13

Speedup: 0.9×

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: 71.6% 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: 90.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma b b (* (* -4.0 a) c)))))
   (if (<= b -1e+128)
     (if (>= b 0.0) (/ (- b) a) (/ (* -2.0 b) (* 2.0 a)))
     (if (<= b 4.8e+97)
       (if (>= b 0.0) (/ (* -2.0 c) (+ b t_0)) (* 0.5 (/ (- t_0 b) a)))
       (if (>= b 0.0)
         (/ (* 2.0 c) (- (- b) b))
         (* 0.5 (sqrt (* (/ c a) -4.0))))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.0000000000000001e128

   1. Initial program 46.6%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 96.8

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 96.8%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 96.8%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 96.8

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

   11. Applied rewrites 96.8%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 96.8

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

   14. Applied rewrites 96.8%

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

   if -1.0000000000000001e128 < b < 4.8e97

   1. Initial program 86.5%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 86.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 86.5%

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

   if 4.8e97 < b

   1. Initial program 52.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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 52.2

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 52.2%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 94.9%

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

   9. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2} \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-4}\right)\\ \end{array} \]
   10. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{1}{2} \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-4}\right)}\\ \end{array} \]

       2. sqrt-unprod N/A

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

       3. lower-sqrt.f64 N/A

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

       4. lower-*.f64 N/A

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

       5. lift-/.f64 94.9

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

   11. Applied rewrites 94.9%

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

Alternative 2: 85.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\left(-4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \leq -1 \cdot 10^{+128}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \leq 3.4 \cdot 10^{-300}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(-0.5, \frac{b}{a}, \sqrt{\frac{c}{a} \cdot -1}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}{a} \cdot 0.5\\ \end{array}\\ \mathbf{elif}\;b \leq 2.7 \cdot 10^{-100}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \mathsf{fma}\left(a \cdot \frac{c}{b}, -2, b\right)}\\ \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 (* (* -4.0 a) c))))
   (if (<= b -1e+128)
     (if (>= b 0.0) (/ (- b) a) (/ (* -2.0 b) (* 2.0 a)))
     (if (<= b 3.4e-300)
       (if (>= b 0.0)
         (fma -0.5 (/ b a) (sqrt (* (/ c a) -1.0)))
         (* (/ (- (sqrt (fma (* -4.0 a) c (* b b))) b) a) 0.5))
       (if (<= b 2.7e-100)
         (if (>= b 0.0)
           (/ (* 2.0 c) (- (- b) t_0))
           (/ (+ (- b) (- b)) (* 2.0 a)))
         (if (>= b 0.0)
           (/ (* 2.0 c) (- (- b) (fma (* a (/ c b)) -2.0 b)))
           (/ (+ (- b) t_0) (* 2.0 a))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((-4.0 * a) * c));
	double tmp_1;
	if (b <= -1e+128) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.4e-300) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = fma(-0.5, (b / a), sqrt(((c / a) * -1.0)));
		} else {
			tmp_3 = ((sqrt(fma((-4.0 * a), c, (b * b))) - b) / a) * 0.5;
		}
		tmp_1 = tmp_3;
	} else if (b <= 2.7e-100) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = (2.0 * c) / (-b - t_0);
		} else {
			tmp_4 = (-b + -b) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-b - fma((a * (c / b)), -2.0, b));
	} else {
		tmp_1 = (-b + t_0) / (2.0 * a);
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(-4.0 * a) * c))
	tmp_1 = 0.0
	if (b <= -1e+128)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(-b) / a);
		else
			tmp_2 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
		end
		tmp_1 = tmp_2;
	elseif (b <= 3.4e-300)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = fma(-0.5, Float64(b / a), sqrt(Float64(Float64(c / a) * -1.0)));
		else
			tmp_3 = Float64(Float64(Float64(sqrt(fma(Float64(-4.0 * a), c, Float64(b * b))) - b) / a) * 0.5);
		end
		tmp_1 = tmp_3;
	elseif (b <= 2.7e-100)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - t_0));
		else
			tmp_4 = Float64(Float64(Float64(-b) + Float64(-b)) / Float64(2.0 * a));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - fma(Float64(a * Float64(c / b)), -2.0, b)));
	else
		tmp_1 = Float64(Float64(Float64(-b) + t_0) / Float64(2.0 * a));
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -1.0000000000000001e128

   1. Initial program 46.6%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 96.8

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 96.8%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 96.8%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 96.8

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

   11. Applied rewrites 96.8%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 96.8

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

   14. Applied rewrites 96.8%

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

   if -1.0000000000000001e128 < b < 3.40000000000000018e-300

   1. Initial program 86.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 86.7%

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

   6. Taylor expanded in c around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 86.0

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

   8. Applied rewrites 86.0%

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

   if 3.40000000000000018e-300 < b < 2.70000000000000016e-100

   1. Initial program 79.3%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 79.3

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 79.3%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. 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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   7. Step-by-step derivation

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 71.3

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

   8. Applied rewrites 71.3%

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

   if 2.70000000000000016e-100 < b

   1. Initial program 69.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 83.6

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

   5. Applied rewrites 83.6%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 83.6

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

   8. Applied rewrites 83.6%

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

Alternative 3: 85.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\left(-4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \leq -1 \cdot 10^{+128}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \leq -4 \cdot 10^{-310}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{fma}\left(-0.5, \frac{b}{a}, -\sqrt{\frac{c}{a} \cdot -1}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}{a} \cdot 0.5\\ \end{array}\\ \mathbf{elif}\;b \leq 2.7 \cdot 10^{-100}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \mathsf{fma}\left(a \cdot \frac{c}{b}, -2, b\right)}\\ \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 (* (* -4.0 a) c))))
   (if (<= b -1e+128)
     (if (>= b 0.0) (/ (- b) a) (/ (* -2.0 b) (* 2.0 a)))
     (if (<= b -4e-310)
       (if (>= b 0.0)
         (fma -0.5 (/ b a) (- (sqrt (* (/ c a) -1.0))))
         (* (/ (- (sqrt (fma (* -4.0 a) c (* b b))) b) a) 0.5))
       (if (<= b 2.7e-100)
         (if (>= b 0.0)
           (/ (* 2.0 c) (- (- b) t_0))
           (/ (+ (- b) (- b)) (* 2.0 a)))
         (if (>= b 0.0)
           (/ (* 2.0 c) (- (- b) (fma (* a (/ c b)) -2.0 b)))
           (/ (+ (- b) t_0) (* 2.0 a))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((-4.0 * a) * c));
	double tmp_1;
	if (b <= -1e+128) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= -4e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = fma(-0.5, (b / a), -sqrt(((c / a) * -1.0)));
		} else {
			tmp_3 = ((sqrt(fma((-4.0 * a), c, (b * b))) - b) / a) * 0.5;
		}
		tmp_1 = tmp_3;
	} else if (b <= 2.7e-100) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = (2.0 * c) / (-b - t_0);
		} else {
			tmp_4 = (-b + -b) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-b - fma((a * (c / b)), -2.0, b));
	} else {
		tmp_1 = (-b + t_0) / (2.0 * a);
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(-4.0 * a) * c))
	tmp_1 = 0.0
	if (b <= -1e+128)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(-b) / a);
		else
			tmp_2 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
		end
		tmp_1 = tmp_2;
	elseif (b <= -4e-310)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = fma(-0.5, Float64(b / a), Float64(-sqrt(Float64(Float64(c / a) * -1.0))));
		else
			tmp_3 = Float64(Float64(Float64(sqrt(fma(Float64(-4.0 * a), c, Float64(b * b))) - b) / a) * 0.5);
		end
		tmp_1 = tmp_3;
	elseif (b <= 2.7e-100)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - t_0));
		else
			tmp_4 = Float64(Float64(Float64(-b) + Float64(-b)) / Float64(2.0 * a));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - fma(Float64(a * Float64(c / b)), -2.0, b)));
	else
		tmp_1 = Float64(Float64(Float64(-b) + t_0) / Float64(2.0 * a));
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -1.0000000000000001e128

   1. Initial program 46.6%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 96.8

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 96.8%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 96.8%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 96.8

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

   11. Applied rewrites 96.8%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 96.8

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

   14. Applied rewrites 96.8%

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

   if -1.0000000000000001e128 < b < -3.999999999999988e-310

   1. Initial program 86.9%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 86.9%

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

   6. Taylor expanded in c around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 86.9

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

   8. Applied rewrites 86.9%

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

   9. Taylor expanded in c around -inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 N/A

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

       3. sqrt-prod N/A

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

       4. lift-/.f64 N/A

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

       5. lift-*.f64 N/A

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

       6. lift-sqrt.f64 86.9

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

   11. Applied rewrites 86.9%

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

   if -3.999999999999988e-310 < b < 2.70000000000000016e-100

   1. Initial program 79.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 79.1

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 79.1%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. 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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   7. Step-by-step derivation

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 71.5

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

   8. Applied rewrites 71.5%

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

   if 2.70000000000000016e-100 < b

   1. Initial program 69.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 83.6

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

   5. Applied rewrites 83.6%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 83.6

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

   8. Applied rewrites 83.6%

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

Alternative 4: 80.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (+ (- b) (- b)) (+ a a))))
   (if (<= b -8.2e-62)
     (if (>= b 0.0) (/ (- b) a) (/ (* -2.0 b) (* 2.0 a)))
     (if (<= b -4e-310)
       (if (>= b 0.0)
         (- (sqrt (* (/ c a) -1.0)))
         (/ (+ (- b) (sqrt (* (* -4.0 a) c))) (* 2.0 a)))
       (if (<= b 2.7e-100)
         (if (>= b 0.0) (/ (- (fma 0.5 b (- (sqrt (* a (- c)))))) a) t_0)
         (if (>= b 0.0) (/ (* 2.0 c) (- (- b) b)) t_0))))))

C

double code(double a, double b, double c) {
	double t_0 = (-b + -b) / (a + a);
	double tmp_1;
	if (b <= -8.2e-62) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= -4e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -sqrt(((c / a) * -1.0));
		} else {
			tmp_3 = (-b + sqrt(((-4.0 * a) * c))) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} else if (b <= 2.7e-100) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -fma(0.5, b, -sqrt((a * -c))) / a;
		} else {
			tmp_4 = t_0;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-b - b);
	} else {
		tmp_1 = t_0;
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = Float64(Float64(Float64(-b) + Float64(-b)) / Float64(a + a))
	tmp_1 = 0.0
	if (b <= -8.2e-62)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(-b) / a);
		else
			tmp_2 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
		end
		tmp_1 = tmp_2;
	elseif (b <= -4e-310)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(-sqrt(Float64(Float64(c / a) * -1.0)));
		else
			tmp_3 = Float64(Float64(Float64(-b) + sqrt(Float64(Float64(-4.0 * a) * c))) / Float64(2.0 * a));
		end
		tmp_1 = tmp_3;
	elseif (b <= 2.7e-100)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(-fma(0.5, b, Float64(-sqrt(Float64(a * Float64(-c)))))) / a);
		else
			tmp_4 = t_0;
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b));
	else
		tmp_1 = t_0;
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -8.2e-62

   1. Initial program 67.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 86.8

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 86.8%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 86.8%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 86.8

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

   11. Applied rewrites 86.8%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 86.8

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

   14. Applied rewrites 86.8%

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

   if -8.2e-62 < b < -3.999999999999988e-310

   1. Initial program 82.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{neg}\left(\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-1}\right) + \frac{1}{2} \cdot b}{a}\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-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 N/A

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

      8. sqrt-unprod N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 82.1

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

   5. Applied rewrites 82.1%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 68.9

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

   8. Applied rewrites 68.9%

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

   9. Taylor expanded in a around -inf

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

       1. sqrt-prod N/A

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

       2. lift-/.f64 N/A

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

       3. lift-*.f64 N/A

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

       4. lift-sqrt.f64 68.9

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

   11. Applied rewrites 68.9%

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

   if -3.999999999999988e-310 < b < 2.70000000000000016e-100

   1. Initial program 79.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 79.1

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 79.1%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 16.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

      2. count-2-rev N/A

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

      3. lower-+.f64 16.1

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

   10. Applied rewrites 16.1%

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

   11. Taylor expanded in a around -inf

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

       1. mul-1-neg N/A

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

       2. mul-1-neg N/A

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

       3. sqrt-prod N/A

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

       4. +-commutative N/A

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

       5. distribute-neg-frac N/A

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

       6. lower-/.f64 N/A

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

   13. Applied rewrites 69.5%

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

   if 2.70000000000000016e-100 < b

   1. Initial program 69.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 69.0

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 69.0%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 83.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

      2. count-2-rev N/A

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

      3. lower-+.f64 83.4

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

   10. Applied rewrites 83.4%

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

Alternative 5: 80.3% accurate, 0.9× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double t_0 = (2.0 * c) / (-b - b);
	double t_1 = (-b + -b) / (a + a);
	double tmp_1;
	if (b <= -2.35e-63) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= -4e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = sqrt(((a * c) * -4.0)) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} else if (b <= 2.7e-100) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -fma(0.5, b, -sqrt((a * -c))) / a;
		} else {
			tmp_4 = t_1;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = t_0;
	} else {
		tmp_1 = t_1;
	}
	return tmp_1;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -2.35e-63

   1. Initial program 67.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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 86.7

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 86.7%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 86.7%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 86.7

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

   11. Applied rewrites 86.7%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 86.7

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

   14. Applied rewrites 86.7%

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

   if -2.35e-63 < b < -3.999999999999988e-310

   1. Initial program 82.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 22.2

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 22.2%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 22.2%

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

   9. Taylor expanded in a around inf

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

       1. sqrt-unprod N/A

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

       2. lower-sqrt.f64 N/A

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

       3. lower-*.f64 N/A

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

       4. lift-*.f64 66.4

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

   11. Applied rewrites 66.4%

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

   if -3.999999999999988e-310 < b < 2.70000000000000016e-100

   1. Initial program 79.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 79.1

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 79.1%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 16.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

      2. count-2-rev N/A

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

      3. lower-+.f64 16.1

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

   10. Applied rewrites 16.1%

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

   11. Taylor expanded in a around -inf

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

       1. mul-1-neg N/A

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

       2. mul-1-neg N/A

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

       3. sqrt-prod N/A

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

       4. +-commutative N/A

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

       5. distribute-neg-frac N/A

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

       6. lower-/.f64 N/A

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

   13. Applied rewrites 69.5%

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

   if 2.70000000000000016e-100 < b

   1. Initial program 69.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 69.0

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 69.0%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 83.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

      2. count-2-rev N/A

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

      3. lower-+.f64 83.4

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

   10. Applied rewrites 83.4%

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

Alternative 6: 80.8% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -8.2e-62

   1. Initial program 67.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 86.8

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 86.8%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 86.8%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 86.8

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

   11. Applied rewrites 86.8%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 86.8

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

   14. Applied rewrites 86.8%

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

   if -8.2e-62 < b < 2.70000000000000016e-100

   1. Initial program 80.8%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{neg}\left(\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-1}\right) + \frac{1}{2} \cdot b}{a}\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-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 N/A

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

      8. sqrt-unprod N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 76.7

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

   5. Applied rewrites 76.7%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 69.1

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

   8. Applied rewrites 69.1%

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

   if 2.70000000000000016e-100 < b

   1. Initial program 69.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 83.6

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

   5. Applied rewrites 83.6%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 83.6

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

   8. Applied rewrites 83.6%

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

Alternative 7: 76.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (* 2.0 c) (- (- b) b))))
   (if (<= b -2.35e-63)
     (if (>= b 0.0) (/ (- b) a) (/ (* -2.0 b) (* 2.0 a)))
     (if (<= b 3.4e-300)
       (if (>= b 0.0) t_0 (/ (sqrt (* (* a c) -4.0)) (* 2.0 a)))
       (if (<= b 5.5e-164)
         (if (>= b 0.0)
           (- (sqrt (* (/ c a) -1.0)))
           (/ (+ (- b) (sqrt (* b b))) (* 2.0 a)))
         (if (>= b 0.0) t_0 (/ (+ (- b) (- b)) (+ a a))))))))

C

double code(double a, double b, double c) {
	double t_0 = (2.0 * c) / (-b - b);
	double tmp_1;
	if (b <= -2.35e-63) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.4e-300) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = sqrt(((a * c) * -4.0)) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} else if (b <= 5.5e-164) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -sqrt(((c / a) * -1.0));
		} else {
			tmp_4 = (-b + sqrt((b * b))) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = t_0;
	} else {
		tmp_1 = (-b + -b) / (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) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = (2.0d0 * c) / (-b - b)
    if (b <= (-2.35d-63)) then
        if (b >= 0.0d0) then
            tmp_2 = -b / a
        else
            tmp_2 = ((-2.0d0) * b) / (2.0d0 * a)
        end if
        tmp_1 = tmp_2
    else if (b <= 3.4d-300) then
        if (b >= 0.0d0) then
            tmp_3 = t_0
        else
            tmp_3 = sqrt(((a * c) * (-4.0d0))) / (2.0d0 * a)
        end if
        tmp_1 = tmp_3
    else if (b <= 5.5d-164) then
        if (b >= 0.0d0) then
            tmp_4 = -sqrt(((c / a) * (-1.0d0)))
        else
            tmp_4 = (-b + sqrt((b * b))) / (2.0d0 * a)
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = t_0
    else
        tmp_1 = (-b + -b) / (a + 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) / (-b - b);
	double tmp_1;
	if (b <= -2.35e-63) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.4e-300) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = Math.sqrt(((a * c) * -4.0)) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} else if (b <= 5.5e-164) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -Math.sqrt(((c / a) * -1.0));
		} else {
			tmp_4 = (-b + Math.sqrt((b * b))) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = t_0;
	} else {
		tmp_1 = (-b + -b) / (a + a);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = (2.0 * c) / (-b - b)
	tmp_1 = 0
	if b <= -2.35e-63:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = -b / a
		else:
			tmp_2 = (-2.0 * b) / (2.0 * a)
		tmp_1 = tmp_2
	elif b <= 3.4e-300:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = t_0
		else:
			tmp_3 = math.sqrt(((a * c) * -4.0)) / (2.0 * a)
		tmp_1 = tmp_3
	elif b <= 5.5e-164:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = -math.sqrt(((c / a) * -1.0))
		else:
			tmp_4 = (-b + math.sqrt((b * b))) / (2.0 * a)
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = t_0
	else:
		tmp_1 = (-b + -b) / (a + a)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b))
	tmp_1 = 0.0
	if (b <= -2.35e-63)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(-b) / a);
		else
			tmp_2 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
		end
		tmp_1 = tmp_2;
	elseif (b <= 3.4e-300)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = t_0;
		else
			tmp_3 = Float64(sqrt(Float64(Float64(a * c) * -4.0)) / Float64(2.0 * a));
		end
		tmp_1 = tmp_3;
	elseif (b <= 5.5e-164)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(-sqrt(Float64(Float64(c / a) * -1.0)));
		else
			tmp_4 = Float64(Float64(Float64(-b) + sqrt(Float64(b * b))) / Float64(2.0 * a));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = t_0;
	else
		tmp_1 = Float64(Float64(Float64(-b) + Float64(-b)) / Float64(a + a));
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = (2.0 * c) / (-b - b);
	tmp_2 = 0.0;
	if (b <= -2.35e-63)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = -b / a;
		else
			tmp_3 = (-2.0 * b) / (2.0 * a);
		end
		tmp_2 = tmp_3;
	elseif (b <= 3.4e-300)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = t_0;
		else
			tmp_4 = sqrt(((a * c) * -4.0)) / (2.0 * a);
		end
		tmp_2 = tmp_4;
	elseif (b <= 5.5e-164)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = -sqrt(((c / a) * -1.0));
		else
			tmp_5 = (-b + sqrt((b * b))) / (2.0 * a);
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = t_0;
	else
		tmp_2 = (-b + -b) / (a + a);
	end
	tmp_6 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -2.35e-63], If[GreaterEqual[b, 0.0], N[((-b) / a), $MachinePrecision], N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 3.4e-300], If[GreaterEqual[b, 0.0], t$95$0, N[(N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 5.5e-164], If[GreaterEqual[b, 0.0], (-N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]), N[(N[((-b) + N[Sqrt[N[(b * b), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], t$95$0, N[(N[((-b) + (-b)), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -2.35e-63

   1. Initial program 67.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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 86.7

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 86.7%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 86.7%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 86.7

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

   11. Applied rewrites 86.7%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 86.7

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

   14. Applied rewrites 86.7%

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

   if -2.35e-63 < b < 3.40000000000000018e-300

   1. Initial program 81.8%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 23.9

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 23.9%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 21.6%

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

   9. Taylor expanded in a around inf

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

       1. sqrt-unprod N/A

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

       2. lower-sqrt.f64 N/A

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

       3. lower-*.f64 N/A

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

       4. lift-*.f64 64.4

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

   11. Applied rewrites 64.4%

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

   if 3.40000000000000018e-300 < b < 5.50000000000000027e-164

   1. Initial program 75.4%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{neg}\left(\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-1}\right) + \frac{1}{2} \cdot b}{a}\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-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 N/A

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

      8. sqrt-unprod N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 74.1

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

   5. Applied rewrites 74.1%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 74.1

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

   8. Applied rewrites 74.1%

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

   9. Taylor expanded in a around -inf

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

       1. sqrt-prod N/A

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

       2. lift-/.f64 N/A

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

       3. lift-*.f64 N/A

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

       4. lift-sqrt.f64 35.0

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

   11. Applied rewrites 35.0%

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

   12. Taylor expanded in a around 0

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

       1. pow2 N/A

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

       2. lower-*.f64 35.0

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

   14. Applied rewrites 35.0%

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

   if 5.50000000000000027e-164 < b

   1. Initial program 70.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 70.7

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 70.7%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 78.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

      2. count-2-rev N/A

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

      3. lower-+.f64 78.4

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

   10. Applied rewrites 78.4%

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

Alternative 8: 71.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (* 2.0 c) (- (- b) b))))
   (if (<= b -3.2e-160)
     (if (>= b 0.0) (/ (- b) a) (/ (* -2.0 b) (* 2.0 a)))
     (if (<= b 3.4e-300)
       (if (>= b 0.0) t_0 (* 0.5 (sqrt (* (/ c a) -4.0))))
       (if (<= b 5.5e-164)
         (if (>= b 0.0)
           (- (sqrt (* (/ c a) -1.0)))
           (/ (+ (- b) (sqrt (* b b))) (* 2.0 a)))
         (if (>= b 0.0) t_0 (/ (+ (- b) (- b)) (+ a a))))))))

C

double code(double a, double b, double c) {
	double t_0 = (2.0 * c) / (-b - b);
	double tmp_1;
	if (b <= -3.2e-160) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.4e-300) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = 0.5 * sqrt(((c / a) * -4.0));
		}
		tmp_1 = tmp_3;
	} else if (b <= 5.5e-164) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -sqrt(((c / a) * -1.0));
		} else {
			tmp_4 = (-b + sqrt((b * b))) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = t_0;
	} else {
		tmp_1 = (-b + -b) / (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) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = (2.0d0 * c) / (-b - b)
    if (b <= (-3.2d-160)) then
        if (b >= 0.0d0) then
            tmp_2 = -b / a
        else
            tmp_2 = ((-2.0d0) * b) / (2.0d0 * a)
        end if
        tmp_1 = tmp_2
    else if (b <= 3.4d-300) then
        if (b >= 0.0d0) then
            tmp_3 = t_0
        else
            tmp_3 = 0.5d0 * sqrt(((c / a) * (-4.0d0)))
        end if
        tmp_1 = tmp_3
    else if (b <= 5.5d-164) then
        if (b >= 0.0d0) then
            tmp_4 = -sqrt(((c / a) * (-1.0d0)))
        else
            tmp_4 = (-b + sqrt((b * b))) / (2.0d0 * a)
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = t_0
    else
        tmp_1 = (-b + -b) / (a + 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) / (-b - b);
	double tmp_1;
	if (b <= -3.2e-160) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.4e-300) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = 0.5 * Math.sqrt(((c / a) * -4.0));
		}
		tmp_1 = tmp_3;
	} else if (b <= 5.5e-164) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -Math.sqrt(((c / a) * -1.0));
		} else {
			tmp_4 = (-b + Math.sqrt((b * b))) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = t_0;
	} else {
		tmp_1 = (-b + -b) / (a + a);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = (2.0 * c) / (-b - b)
	tmp_1 = 0
	if b <= -3.2e-160:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = -b / a
		else:
			tmp_2 = (-2.0 * b) / (2.0 * a)
		tmp_1 = tmp_2
	elif b <= 3.4e-300:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = t_0
		else:
			tmp_3 = 0.5 * math.sqrt(((c / a) * -4.0))
		tmp_1 = tmp_3
	elif b <= 5.5e-164:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = -math.sqrt(((c / a) * -1.0))
		else:
			tmp_4 = (-b + math.sqrt((b * b))) / (2.0 * a)
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = t_0
	else:
		tmp_1 = (-b + -b) / (a + a)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b))
	tmp_1 = 0.0
	if (b <= -3.2e-160)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(-b) / a);
		else
			tmp_2 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
		end
		tmp_1 = tmp_2;
	elseif (b <= 3.4e-300)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = t_0;
		else
			tmp_3 = Float64(0.5 * sqrt(Float64(Float64(c / a) * -4.0)));
		end
		tmp_1 = tmp_3;
	elseif (b <= 5.5e-164)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(-sqrt(Float64(Float64(c / a) * -1.0)));
		else
			tmp_4 = Float64(Float64(Float64(-b) + sqrt(Float64(b * b))) / Float64(2.0 * a));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = t_0;
	else
		tmp_1 = Float64(Float64(Float64(-b) + Float64(-b)) / Float64(a + a));
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = (2.0 * c) / (-b - b);
	tmp_2 = 0.0;
	if (b <= -3.2e-160)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = -b / a;
		else
			tmp_3 = (-2.0 * b) / (2.0 * a);
		end
		tmp_2 = tmp_3;
	elseif (b <= 3.4e-300)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = t_0;
		else
			tmp_4 = 0.5 * sqrt(((c / a) * -4.0));
		end
		tmp_2 = tmp_4;
	elseif (b <= 5.5e-164)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = -sqrt(((c / a) * -1.0));
		else
			tmp_5 = (-b + sqrt((b * b))) / (2.0 * a);
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = t_0;
	else
		tmp_2 = (-b + -b) / (a + a);
	end
	tmp_6 = tmp_2;
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -3.20000000000000009e-160

   1. Initial program 70.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 78.7

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 78.7%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 78.7%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 78.7

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

   11. Applied rewrites 78.7%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 78.7

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

   14. Applied rewrites 78.7%

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

   if -3.20000000000000009e-160 < b < 3.40000000000000018e-300

   1. Initial program 76.4%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 14.5

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 14.5%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 10.4%

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

   9. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2} \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-4}\right)\\ \end{array} \]
   10. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{1}{2} \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-4}\right)}\\ \end{array} \]

       2. sqrt-unprod N/A

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

       3. lower-sqrt.f64 N/A

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

       4. lower-*.f64 N/A

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

       5. lift-/.f64 30.9

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

   11. Applied rewrites 30.9%

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

   if 3.40000000000000018e-300 < b < 5.50000000000000027e-164

   1. Initial program 75.4%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{neg}\left(\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-1}\right) + \frac{1}{2} \cdot b}{a}\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-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 N/A

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

      8. sqrt-unprod N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 74.1

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

   5. Applied rewrites 74.1%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 74.1

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

   8. Applied rewrites 74.1%

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

   9. Taylor expanded in a around -inf

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

       1. sqrt-prod N/A

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

       2. lift-/.f64 N/A

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

       3. lift-*.f64 N/A

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

       4. lift-sqrt.f64 35.0

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

   11. Applied rewrites 35.0%

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

   12. Taylor expanded in a around 0

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

       1. pow2 N/A

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

       2. lower-*.f64 35.0

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

   14. Applied rewrites 35.0%

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

   if 5.50000000000000027e-164 < b

   1. Initial program 70.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 70.7

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 70.7%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 78.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

      2. count-2-rev N/A

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

      3. lower-+.f64 78.4

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

   10. Applied rewrites 78.4%

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

Alternative 9: 80.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -8.2e-62)
   (if (>= b 0.0) (/ (- b) a) (/ (* -2.0 b) (* 2.0 a)))
   (if (<= b 2.7e-100)
     (if (>= b 0.0)
       (- (/ (fma 0.5 b (- (sqrt (* (* a c) -1.0)))) a))
       (/ (+ (- b) (sqrt (* (* -4.0 a) c))) (* 2.0 a)))
     (if (>= b 0.0) (/ (* 2.0 c) (- (- b) b)) (/ (+ (- b) (- b)) (+ a a))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -8.2e-62

   1. Initial program 67.1%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 86.8

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 86.8%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 86.8%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 86.8

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

   11. Applied rewrites 86.8%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 86.8

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

   14. Applied rewrites 86.8%

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

   if -8.2e-62 < b < 2.70000000000000016e-100

   1. Initial program 80.8%

      \[\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. Add Preprocessing

   3. Taylor expanded in a around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\mathsf{neg}\left(\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-1}\right) + \frac{1}{2} \cdot b}{a}\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-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 N/A

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

      8. sqrt-unprod N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 76.7

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

   5. Applied rewrites 76.7%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 69.1

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

   8. Applied rewrites 69.1%

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

   if 2.70000000000000016e-100 < b

   1. Initial program 69.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 69.0

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 69.0%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 83.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

      2. count-2-rev N/A

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

      3. lower-+.f64 83.4

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

   10. Applied rewrites 83.4%

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

Alternative 10: 69.1% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -3.20000000000000009e-160

   1. Initial program 70.7%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 78.7

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 78.7%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 78.7%

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

   9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   10. Step-by-step derivation

       1. associate-*r/ N/A

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

       2. mul-1-neg N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 78.7

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

   11. Applied rewrites 78.7%

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

   12. Taylor expanded in b around -inf

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

       1. lower-*.f64 78.7

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

   14. Applied rewrites 78.7%

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

   if -3.20000000000000009e-160 < 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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 62.2

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 62.2%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 58.7%

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

   9. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2} \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-4}\right)\\ \end{array} \]
   10. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{1}{2} \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-4}\right)}\\ \end{array} \]

       2. sqrt-unprod N/A

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

       3. lower-sqrt.f64 N/A

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

       4. lower-*.f64 N/A

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

       5. lift-/.f64 62.0

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

   11. Applied rewrites 62.0%

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

Alternative 11: 67.6% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    t_0 = (-b + -b) / (a + a)
    if (a <= 2.7d+123) then
        if (b >= 0.0d0) then
            tmp_2 = (2.0d0 * c) / (-b - b)
        else
            tmp_2 = t_0
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = sqrt((-c / a))
    else
        tmp_1 = t_0
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < 2.70000000000000013e123

   1. Initial program 74.5%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 71.6

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 71.6%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 70.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

      2. count-2-rev N/A

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

      3. lower-+.f64 70.2

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

   10. Applied rewrites 70.2%

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

   if 2.70000000000000013e123 < a

   1. Initial program 52.0%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around -inf

      \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

      2. lift-neg.f64 53.7

         \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   5. Applied rewrites 53.7%

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 47.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

      2. count-2-rev N/A

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

      3. lower-+.f64 47.6

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

   10. Applied rewrites 47.6%

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

   11. Taylor expanded in a around -inf

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

       1. sqrt-prod N/A

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

       2. lower-sqrt.f64 N/A

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

       3. *-commutative N/A

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

       4. associate-*r/ N/A

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

       5. mul-1-neg N/A

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

       6. lower-/.f64 N/A

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

       7. lower-neg.f64 50.8

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

   13. Applied rewrites 50.8%

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

Alternative 12: 67.2% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.6%

   \[\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. Add Preprocessing

3. Taylor expanded in b around -inf

   \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

   2. lift-neg.f64 69.2

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

5. Applied rewrites 69.2%

   \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

6. Taylor expanded in a around 0

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

8. Applied rewrites 67.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \color{blue}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}}\\ \end{array} \]

   2. count-2-rev N/A

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

   3. lower-+.f64 67.2

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

10. Applied rewrites 67.2%

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

Alternative 13: 35.8% accurate, 2.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -b / a;
	} else {
		tmp = (-2.0 * b) / (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) :: tmp
    if (b >= 0.0d0) then
        tmp = -b / a
    else
        tmp = ((-2.0d0) * b) / (2.0d0 * 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 = -b / a;
	} else {
		tmp = (-2.0 * b) / (2.0 * a);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.6%

   \[\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. Add Preprocessing

3. Taylor expanded in b around -inf

   \[\leadsto \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) + -1 \cdot b}{2 \cdot a}\\ \end{array} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \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) + \left(\mathsf{neg}\left(b\right)\right)}{2 \cdot a}\\ \end{array} \]

   2. lift-neg.f64 69.2

      \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

5. Applied rewrites 69.2%

   \[\leadsto \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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]

6. Taylor expanded in a around 0

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

8. Applied rewrites 67.2%

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

9. 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{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
10. Step-by-step derivation

    1. associate-*r/ N/A

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

    2. mul-1-neg N/A

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

    3. lift-neg.f64 N/A

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

    4. lower-/.f64 35.8

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

11. Applied rewrites 35.8%

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

12. Taylor expanded in b around -inf

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

    1. lower-*.f64 35.8

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

14. Applied rewrites 35.8%

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

Reproduce

herbie shell --seed 2025089 
(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))))