jeff quadratic root 2

Percentage Accurate: 72.6% → 89.7%

Time: 4.4s

Alternatives: 12

Speedup: 1.3×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 72.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: 89.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.35000000000000005e40

   1. Initial program 62.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 62.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.3%

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

   8. Taylor expanded in b around -inf

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

      2. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 93.3

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

   10. Applied rewrites 93.3%

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

   11. Taylor expanded in c around 0

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

       2. lower-/.f64 N/A

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

       3. lift-/.f64 93.7

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

   13. Applied rewrites 93.7%

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

   14. Taylor expanded in a around 0

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

       1. lower-*.f64 93.7

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

   16. Applied rewrites 93.7%

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

   if -1.35000000000000005e40 < b < 2.9e49

   1. Initial program 85.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. 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}} \]
   3. Step-by-step derivation

   4. Applied rewrites 85.3%

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

   if 2.9e49 < b

   1. Initial program 60.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 93.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 93.6%

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

   8. 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}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right) + \frac{-1}{2} \cdot \frac{b}{a}\\ \end{array} \]
   9. Step-by-step derivation

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

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

      2. metadata-eval N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. sqrt-prod N/A

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

      7. lift-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-sqrt.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lift-/.f64 93.6

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

   10. Applied rewrites 93.6%

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

   11. Taylor expanded in c around -inf

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

       1. sqrt-prod N/A

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

       3. *-commutative N/A

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

       4. associate-*r/ N/A

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

       5. mul-1-neg N/A

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

       6. lower-/.f64 N/A

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

       7. lower-neg.f64 93.6

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

   13. Applied rewrites 93.6%

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

Alternative 2: 83.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{-4 \cdot \left(a \cdot c\right)}\\ \mathbf{if}\;b \leq -1.35 \cdot 10^{+40}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot b}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \end{array}\\ \mathbf{elif}\;b \leq -1 \cdot 10^{-204}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{\mathsf{fma}\left(-2, \frac{a \cdot c}{b}, b + b\right)} \cdot -2\\ \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 1.86 \cdot 10^{+46}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{t\_0 + b} \cdot -2\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_0 - b}{a} \cdot 0.5\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - b}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* -4.0 (* a c)))))
   (if (<= b -1.35e+40)
     (if (>= b 0.0) (/ (* 2.0 c) (* -2.0 b)) (- (/ c b) (/ b a)))
     (if (<= b -1e-204)
       (if (>= b 0.0)
         (* (/ c (fma -2.0 (/ (* a c) b) (+ b b))) -2.0)
         (* (/ (- (sqrt (fma (* -4.0 a) c (* b b))) b) a) 0.5))
       (if (<= b 1.86e+46)
         (if (>= b 0.0) (* (/ c (+ t_0 b)) -2.0) (* (/ (- t_0 b) a) 0.5))
         (if (>= b 0.0) (/ (* 2.0 c) (- (- b) b)) (sqrt (/ (- c) a))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt((-4.0 * (a * c)));
	double tmp_1;
	if (b <= -1.35e+40) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_2 = (c / b) - (b / a);
		}
		tmp_1 = tmp_2;
	} else if (b <= -1e-204) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (c / fma(-2.0, ((a * c) / b), (b + b))) * -2.0;
		} else {
			tmp_3 = ((sqrt(fma((-4.0 * a), c, (b * b))) - b) / a) * 0.5;
		}
		tmp_1 = tmp_3;
	} else if (b <= 1.86e+46) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = (c / (t_0 + b)) * -2.0;
		} else {
			tmp_4 = ((t_0 - b) / a) * 0.5;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-b - b);
	} else {
		tmp_1 = sqrt((-c / a));
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(-4.0 * Float64(a * c)))
	tmp_1 = 0.0
	if (b <= -1.35e+40)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
		else
			tmp_2 = Float64(Float64(c / b) - Float64(b / a));
		end
		tmp_1 = tmp_2;
	elseif (b <= -1e-204)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(c / fma(-2.0, Float64(Float64(a * c) / b), Float64(b + b))) * -2.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 <= 1.86e+46)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(c / Float64(t_0 + b)) * -2.0);
		else
			tmp_4 = Float64(Float64(Float64(t_0 - b) / a) * 0.5);
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b));
	else
		tmp_1 = sqrt(Float64(Float64(-c) / a));
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -1.35000000000000005e40

   1. Initial program 62.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 62.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.3%

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

   8. Taylor expanded in b around -inf

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

      2. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 93.3

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

   10. Applied rewrites 93.3%

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

   11. Taylor expanded in c around 0

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

       2. lower-/.f64 N/A

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

       3. lift-/.f64 93.7

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

   13. Applied rewrites 93.7%

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

   14. Taylor expanded in a around 0

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

       1. lower-*.f64 93.7

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

   16. Applied rewrites 93.7%

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

   if -1.35000000000000005e40 < b < -1e-204

   1. Initial program 87.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. 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}} \]
   3. Step-by-step derivation

   4. Applied rewrites 87.7%

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

   5. Taylor expanded in a around 0

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

      1. lower-fma.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. count-2-rev N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{\mathsf{fma}\left(-2, \frac{a \cdot c}{b}, b + b\right)} \cdot -2\\ \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 87.7

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

   7. Applied rewrites 87.7%

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

   if -1e-204 < b < 1.8600000000000001e46

   1. Initial program 83.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. 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}} \]
   3. Step-by-step derivation

   4. Applied rewrites 83.8%

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

   5. Taylor expanded in a around inf

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 60.7

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

   7. Applied rewrites 60.7%

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

   8. Taylor expanded in a around inf

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 60.7

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

   10. Applied rewrites 60.7%

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

   if 1.8600000000000001e46 < b

   1. Initial program 60.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 93.5%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 93.5%

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

   8. 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}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right) + \frac{-1}{2} \cdot \frac{b}{a}\\ \end{array} \]
   9. Step-by-step derivation

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

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

      2. metadata-eval N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. sqrt-prod N/A

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

      7. lift-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-sqrt.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lift-/.f64 93.5

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

   10. Applied rewrites 93.5%

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

   11. Taylor expanded in c around -inf

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

       1. sqrt-prod N/A

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

       3. *-commutative N/A

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

       4. associate-*r/ N/A

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

       5. mul-1-neg N/A

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

       6. lower-/.f64 N/A

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

       7. lower-neg.f64 93.5

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

   13. Applied rewrites 93.5%

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

Alternative 3: 78.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = sqrt(((-4.0d0) * (a * c)))
    if (b <= (-5.5d-36)) then
        if (b >= 0.0d0) then
            tmp_2 = (2.0d0 * c) / ((-2.0d0) * b)
        else
            tmp_2 = (c / b) - (b / a)
        end if
        tmp_1 = tmp_2
    else if (b <= 1.86d+46) then
        if (b >= 0.0d0) then
            tmp_3 = (c / (t_0 + b)) * (-2.0d0)
        else
            tmp_3 = ((t_0 - b) / a) * 0.5d0
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (2.0d0 * c) / (-b - b)
    else
        tmp_1 = sqrt((-c / a))
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -5.49999999999999984e-36

   1. Initial program 67.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 67.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.4%

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

   8. Taylor expanded in b around -inf

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

      2. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 89.0

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

   10. Applied rewrites 89.0%

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

   11. Taylor expanded in c around 0

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

       2. lower-/.f64 N/A

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

       3. lift-/.f64 89.3

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

   13. Applied rewrites 89.3%

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

   14. Taylor expanded in a around 0

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

       1. lower-*.f64 89.3

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

   16. Applied rewrites 89.3%

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

   if -5.49999999999999984e-36 < b < 1.8600000000000001e46

   1. Initial program 84.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. 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}} \]
   3. Step-by-step derivation

   4. Applied rewrites 84.3%

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

   5. Taylor expanded in a around inf

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 67.6

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

   7. Applied rewrites 67.6%

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

   8. Taylor expanded in a around inf

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 60.8

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

   10. Applied rewrites 60.8%

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

   if 1.8600000000000001e46 < b

   1. Initial program 60.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 93.5%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 93.5%

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

   8. 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}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right) + \frac{-1}{2} \cdot \frac{b}{a}\\ \end{array} \]
   9. Step-by-step derivation

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

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

      2. metadata-eval N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. sqrt-prod N/A

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

      7. lift-/.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-sqrt.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lift-/.f64 93.5

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

   10. Applied rewrites 93.5%

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

   11. Taylor expanded in c around -inf

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

       1. sqrt-prod N/A

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

       3. *-commutative N/A

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

       4. associate-*r/ N/A

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

       5. mul-1-neg N/A

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

       6. lower-/.f64 N/A

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

       7. lower-neg.f64 93.5

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

   13. Applied rewrites 93.5%

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

Alternative 4: 78.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* (* a c) -4.0))))
   (if (<= b -2.4e-36)
     (if (>= b 0.0) (/ (* 2.0 c) (* -2.0 b)) (- (/ c b) (/ b a)))
     (if (<= b 3e+24)
       (if (>= b 0.0) (/ (+ c c) (- t_0)) (/ t_0 (+ a a)))
       (if (>= b 0.0) (/ (+ c c) (- (- b) b)) (/ (+ (- b) b) (+ a a)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((a * c) * -4.0));
	double tmp_1;
	if (b <= -2.4e-36) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_2 = (c / b) - (b / a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3e+24) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (c + c) / -t_0;
		} else {
			tmp_3 = t_0 / (a + a);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (c + c) / (-b - b);
	} 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
    t_0 = sqrt(((a * c) * (-4.0d0)))
    if (b <= (-2.4d-36)) then
        if (b >= 0.0d0) then
            tmp_2 = (2.0d0 * c) / ((-2.0d0) * b)
        else
            tmp_2 = (c / b) - (b / a)
        end if
        tmp_1 = tmp_2
    else if (b <= 3d+24) then
        if (b >= 0.0d0) then
            tmp_3 = (c + c) / -t_0
        else
            tmp_3 = t_0 / (a + a)
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (c + c) / (-b - b)
    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 = Math.sqrt(((a * c) * -4.0));
	double tmp_1;
	if (b <= -2.4e-36) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_2 = (c / b) - (b / a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3e+24) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (c + c) / -t_0;
		} else {
			tmp_3 = t_0 / (a + a);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (c + c) / (-b - b);
	} else {
		tmp_1 = (-b + b) / (a + a);
	}
	return tmp_1;
}

Python

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

Julia

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

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = sqrt(((a * c) * -4.0));
	tmp_2 = 0.0;
	if (b <= -2.4e-36)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (2.0 * c) / (-2.0 * b);
		else
			tmp_3 = (c / b) - (b / a);
		end
		tmp_2 = tmp_3;
	elseif (b <= 3e+24)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (c + c) / -t_0;
		else
			tmp_4 = t_0 / (a + a);
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = (c + c) / (-b - b);
	else
		tmp_2 = (-b + b) / (a + a);
	end
	tmp_5 = tmp_2;
end

Wolfram

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

   1. Initial program 67.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 67.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.4%

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

   8. Taylor expanded in b around -inf

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

      2. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 88.9

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

   10. Applied rewrites 88.9%

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

   11. Taylor expanded in c around 0

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

       2. lower-/.f64 N/A

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

       3. lift-/.f64 89.3

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

   13. Applied rewrites 89.3%

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

   14. Taylor expanded in a around 0

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

       1. lower-*.f64 89.3

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

   16. Applied rewrites 89.3%

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

   if -2.4e-36 < b < 2.99999999999999995e24

   1. Initial program 83.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 55.5%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 21.3%

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

   8. 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} \]
   9. 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 47.1

         \[\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} \]

   10. Applied rewrites 47.1%

       \[\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. Step-by-step derivation

       1. lift-*.f64 N/A

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

       2. count-2-rev N/A

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

       3. lower-+.f64 47.1

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

       4. lift-*.f64 N/A

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

       5. count-2-rev N/A

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

       6. lower-+.f64 47.1

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

   12. Applied rewrites 47.1%

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

   13. Taylor expanded in a around inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 N/A

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

       3. sqrt-prod N/A

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

       4. lift-*.f64 N/A

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

       5. lift-*.f64 N/A

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

       6. lift-sqrt.f64 58.7

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

   15. Applied rewrites 58.7%

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

   if 2.99999999999999995e24 < b

   1. Initial program 62.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 92.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 92.2%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 92.2

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

      4. lift-*.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 92.2

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

   9. Applied rewrites 92.2%

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

Alternative 5: 73.8% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -2.4e-36

   1. Initial program 67.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 67.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.4%

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

   8. Taylor expanded in b around -inf

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

      2. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 88.9

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

   10. Applied rewrites 88.9%

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

   11. Taylor expanded in c around 0

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

       2. lower-/.f64 N/A

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

       3. lift-/.f64 89.3

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

   13. Applied rewrites 89.3%

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

   14. Taylor expanded in a around 0

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

       1. lower-*.f64 89.3

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

   16. Applied rewrites 89.3%

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

   if -2.4e-36 < b

   1. Initial program 75.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 70.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 51.1%

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

   8. 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} \]
   9. 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.0

         \[\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} \]

   10. Applied rewrites 66.0%

       \[\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. Step-by-step derivation

       1. lift-*.f64 N/A

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

       2. count-2-rev N/A

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

       3. lower-+.f64 66.0

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

       4. lift-*.f64 N/A

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

       5. count-2-rev N/A

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

       6. lower-+.f64 66.0

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

   12. Applied rewrites 66.0%

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

Alternative 6: 70.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{-2 \cdot b}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \end{array}\\ t_1 := \sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{if}\;b \leq -3.4 \cdot 10^{-156}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b \leq 7.6 \cdot 10^{-290}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-\frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;-t\_1\\ \end{array}\\ \mathbf{elif}\;b \leq 3.7 \cdot 10^{-206}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{-2 \cdot b}{2 \cdot a}\\ \end{array}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (if (>= b 0.0) (/ (* 2.0 c) (* -2.0 b)) (- (/ c b) (/ b a))))
        (t_1 (sqrt (* (/ c a) -1.0))))
   (if (<= b -3.4e-156)
     t_0
     (if (<= b 7.6e-290)
       (if (>= b 0.0) (- (/ b a)) (- t_1))
       (if (<= b 3.7e-206)
         (if (>= b 0.0) t_1 (/ (* -2.0 b) (* 2.0 a)))
         t_0)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = (2.0 * c) / (-2.0 * b);
	} else {
		tmp = (c / b) - (b / a);
	}
	double t_0 = tmp;
	double t_1 = sqrt(((c / a) * -1.0));
	double tmp_1;
	if (b <= -3.4e-156) {
		tmp_1 = t_0;
	} else if (b <= 7.6e-290) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -(b / a);
		} else {
			tmp_2 = -t_1;
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.7e-206) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_1;
		} else {
			tmp_3 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} 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) :: t_1
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    if (b >= 0.0d0) then
        tmp = (2.0d0 * c) / ((-2.0d0) * b)
    else
        tmp = (c / b) - (b / a)
    end if
    t_0 = tmp
    t_1 = sqrt(((c / a) * (-1.0d0)))
    if (b <= (-3.4d-156)) then
        tmp_1 = t_0
    else if (b <= 7.6d-290) then
        if (b >= 0.0d0) then
            tmp_2 = -(b / a)
        else
            tmp_2 = -t_1
        end if
        tmp_1 = tmp_2
    else if (b <= 3.7d-206) then
        if (b >= 0.0d0) then
            tmp_3 = t_1
        else
            tmp_3 = ((-2.0d0) * b) / (2.0d0 * a)
        end if
        tmp_1 = tmp_3
    else
        tmp_1 = t_0
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = (2.0 * c) / (-2.0 * b);
	} else {
		tmp = (c / b) - (b / a);
	}
	double t_0 = tmp;
	double t_1 = Math.sqrt(((c / a) * -1.0));
	double tmp_1;
	if (b <= -3.4e-156) {
		tmp_1 = t_0;
	} else if (b <= 7.6e-290) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -(b / a);
		} else {
			tmp_2 = -t_1;
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.7e-206) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_1;
		} else {
			tmp_3 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} else {
		tmp_1 = t_0;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = (2.0 * c) / (-2.0 * b)
	else:
		tmp = (c / b) - (b / a)
	t_0 = tmp
	t_1 = math.sqrt(((c / a) * -1.0))
	tmp_1 = 0
	if b <= -3.4e-156:
		tmp_1 = t_0
	elif b <= 7.6e-290:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = -(b / a)
		else:
			tmp_2 = -t_1
		tmp_1 = tmp_2
	elif b <= 3.7e-206:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = t_1
		else:
			tmp_3 = (-2.0 * b) / (2.0 * a)
		tmp_1 = tmp_3
	else:
		tmp_1 = t_0
	return tmp_1

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
	else
		tmp = Float64(Float64(c / b) - Float64(b / a));
	end
	t_0 = tmp
	t_1 = sqrt(Float64(Float64(c / a) * -1.0))
	tmp_1 = 0.0
	if (b <= -3.4e-156)
		tmp_1 = t_0;
	elseif (b <= 7.6e-290)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(-Float64(b / a));
		else
			tmp_2 = Float64(-t_1);
		end
		tmp_1 = tmp_2;
	elseif (b <= 3.7e-206)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = t_1;
		else
			tmp_3 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
		end
		tmp_1 = tmp_3;
	else
		tmp_1 = t_0;
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (2.0 * c) / (-2.0 * b);
	else
		tmp = (c / b) - (b / a);
	end
	t_0 = tmp;
	t_1 = sqrt(((c / a) * -1.0));
	tmp_2 = 0.0;
	if (b <= -3.4e-156)
		tmp_2 = t_0;
	elseif (b <= 7.6e-290)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = -(b / a);
		else
			tmp_3 = -t_1;
		end
		tmp_2 = tmp_3;
	elseif (b <= 3.7e-206)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = t_1;
		else
			tmp_4 = (-2.0 * b) / (2.0 * a);
		end
		tmp_2 = tmp_4;
	else
		tmp_2 = t_0;
	end
	tmp_5 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision]]}, Block[{t$95$1 = N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -3.4e-156], t$95$0, If[LessEqual[b, 7.6e-290], If[GreaterEqual[b, 0.0], (-N[(b / a), $MachinePrecision]), (-t$95$1)], If[LessEqual[b, 3.7e-206], If[GreaterEqual[b, 0.0], t$95$1, N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]], t$95$0]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.3999999999999999e-156 or 3.69999999999999998e-206 < b

   1. Initial program 71.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 73.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 39.8%

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

   8. Taylor expanded in b around -inf

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

      2. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 77.1

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

   10. Applied rewrites 77.1%

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

   11. Taylor expanded in c around 0

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

       2. lower-/.f64 N/A

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

       3. lift-/.f64 77.3

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

   13. Applied rewrites 77.3%

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

   14. Taylor expanded in a around 0

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

       1. lower-*.f64 77.3

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

   16. Applied rewrites 77.3%

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

   if -3.3999999999999999e-156 < b < 7.5999999999999995e-290

   1. Initial program 77.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 69.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 3.4%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lift-/.f64 3.3

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

   10. Applied rewrites 3.3%

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

   11. Taylor expanded in a around -inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 N/A

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

       3. sqrt-unprod N/A

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

       4. lower-sqrt.f64 N/A

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

       5. lower-*.f64 N/A

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

       6. lower-/.f64 31.8

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

   13. Applied rewrites 31.8%

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

   if 7.5999999999999995e-290 < b < 3.69999999999999998e-206

   1. Initial program 78.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 8.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 8.7%

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

   8. 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) + b}{2 \cdot a}\\ \end{array} \]
   9. 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) + b}{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) + b}{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) + b}{2 \cdot a}\\ \end{array} \]

      4. lift-sqrt.f64 34.2

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

   10. Applied rewrites 34.2%

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

   11. Taylor expanded in b around -inf

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

       1. lower-*.f64 34.2

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

   13. Applied rewrites 34.2%

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

Alternative 7: 70.8% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* (/ c a) -1.0))))
   (if (<= b -3.4e-156)
     (if (>= b 0.0) (/ (* 2.0 c) (* -2.0 b)) (- (/ c b) (/ b a)))
     (if (<= b 7.6e-290)
       (if (>= b 0.0) (- (/ b a)) (- t_0))
       (if (<= b 3.7e-206)
         (if (>= b 0.0) t_0 (/ (* -2.0 b) (* 2.0 a)))
         (if (>= b 0.0) (/ (+ c c) (- (- b) b)) (/ (+ (- b) b) (+ a a))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((c / a) * -1.0));
	double tmp_1;
	if (b <= -3.4e-156) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_2 = (c / b) - (b / a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 7.6e-290) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -(b / a);
		} else {
			tmp_3 = -t_0;
		}
		tmp_1 = tmp_3;
	} else if (b <= 3.7e-206) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = t_0;
		} else {
			tmp_4 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c + c) / (-b - b);
	} 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 = sqrt(((c / a) * (-1.0d0)))
    if (b <= (-3.4d-156)) then
        if (b >= 0.0d0) then
            tmp_2 = (2.0d0 * c) / ((-2.0d0) * b)
        else
            tmp_2 = (c / b) - (b / a)
        end if
        tmp_1 = tmp_2
    else if (b <= 7.6d-290) then
        if (b >= 0.0d0) then
            tmp_3 = -(b / a)
        else
            tmp_3 = -t_0
        end if
        tmp_1 = tmp_3
    else if (b <= 3.7d-206) then
        if (b >= 0.0d0) then
            tmp_4 = t_0
        else
            tmp_4 = ((-2.0d0) * b) / (2.0d0 * a)
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = (c + c) / (-b - b)
    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 = Math.sqrt(((c / a) * -1.0));
	double tmp_1;
	if (b <= -3.4e-156) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_2 = (c / b) - (b / a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 7.6e-290) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -(b / a);
		} else {
			tmp_3 = -t_0;
		}
		tmp_1 = tmp_3;
	} else if (b <= 3.7e-206) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = t_0;
		} else {
			tmp_4 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c + c) / (-b - b);
	} else {
		tmp_1 = (-b + b) / (a + a);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((c / a) * -1.0))
	tmp_1 = 0
	if b <= -3.4e-156:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = (2.0 * c) / (-2.0 * b)
		else:
			tmp_2 = (c / b) - (b / a)
		tmp_1 = tmp_2
	elif b <= 7.6e-290:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = -(b / a)
		else:
			tmp_3 = -t_0
		tmp_1 = tmp_3
	elif b <= 3.7e-206:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = t_0
		else:
			tmp_4 = (-2.0 * b) / (2.0 * a)
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = (c + c) / (-b - b)
	else:
		tmp_1 = (-b + b) / (a + a)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(c / a) * -1.0))
	tmp_1 = 0.0
	if (b <= -3.4e-156)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
		else
			tmp_2 = Float64(Float64(c / b) - Float64(b / a));
		end
		tmp_1 = tmp_2;
	elseif (b <= 7.6e-290)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(-Float64(b / a));
		else
			tmp_3 = Float64(-t_0);
		end
		tmp_1 = tmp_3;
	elseif (b <= 3.7e-206)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = t_0;
		else
			tmp_4 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c + c) / Float64(Float64(-b) - b));
	else
		tmp_1 = Float64(Float64(Float64(-b) + b) / Float64(a + a));
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = sqrt(((c / a) * -1.0));
	tmp_2 = 0.0;
	if (b <= -3.4e-156)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (2.0 * c) / (-2.0 * b);
		else
			tmp_3 = (c / b) - (b / a);
		end
		tmp_2 = tmp_3;
	elseif (b <= 7.6e-290)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = -(b / a);
		else
			tmp_4 = -t_0;
		end
		tmp_2 = tmp_4;
	elseif (b <= 3.7e-206)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = t_0;
		else
			tmp_5 = (-2.0 * b) / (2.0 * a);
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = (c + c) / (-b - b);
	else
		tmp_2 = (-b + b) / (a + a);
	end
	tmp_6 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -3.4e-156], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 7.6e-290], If[GreaterEqual[b, 0.0], (-N[(b / a), $MachinePrecision]), (-t$95$0)], If[LessEqual[b, 3.7e-206], If[GreaterEqual[b, 0.0], t$95$0, N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(c + c), $MachinePrecision] / N[((-b) - b), $MachinePrecision]), $MachinePrecision], N[(N[((-b) + b), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -3.3999999999999999e-156

   1. Initial program 71.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 71.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.6%

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

   8. Taylor expanded in b around -inf

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

      2. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 79.6

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

   10. Applied rewrites 79.6%

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

   11. Taylor expanded in c around 0

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

       2. lower-/.f64 N/A

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

       3. lift-/.f64 79.9

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

   13. Applied rewrites 79.9%

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

   14. Taylor expanded in a around 0

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

       1. lower-*.f64 79.9

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

   16. Applied rewrites 79.9%

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

   if -3.3999999999999999e-156 < b < 7.5999999999999995e-290

   1. Initial program 77.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 69.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 3.4%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lift-/.f64 3.3

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

   10. Applied rewrites 3.3%

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

   11. Taylor expanded in a around -inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 N/A

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

       3. sqrt-unprod N/A

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

       4. lower-sqrt.f64 N/A

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

       5. lower-*.f64 N/A

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

       6. lower-/.f64 31.8

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

   13. Applied rewrites 31.8%

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

   if 7.5999999999999995e-290 < b < 3.69999999999999998e-206

   1. Initial program 78.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 8.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 8.7%

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

   8. 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) + b}{2 \cdot a}\\ \end{array} \]
   9. 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) + b}{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) + b}{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) + b}{2 \cdot a}\\ \end{array} \]

      4. lift-sqrt.f64 34.2

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

   10. Applied rewrites 34.2%

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

   11. Taylor expanded in b around -inf

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

       1. lower-*.f64 34.2

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

   13. Applied rewrites 34.2%

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

   if 3.69999999999999998e-206 < b

   1. Initial program 71.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 74.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 74.8%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 74.8

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

      4. lift-*.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 74.8

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

   9. Applied rewrites 74.8%

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

Alternative 8: 70.7% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* (/ c a) -1.0))) (t_1 (- (/ b a))))
   (if (<= b -3.4e-156)
     (if (>= b 0.0) t_1 (/ (- b) a))
     (if (<= b 7.6e-290)
       (if (>= b 0.0) t_1 (- t_0))
       (if (<= b 3.7e-206)
         (if (>= b 0.0) t_0 (/ (* -2.0 b) (* 2.0 a)))
         (if (>= b 0.0) (* (/ c (+ b b)) -2.0) (* (/ (- b b) a) 0.5)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((c / a) * -1.0));
	double t_1 = -(b / a);
	double tmp_1;
	if (b <= -3.4e-156) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = -b / a;
		}
		tmp_1 = tmp_2;
	} else if (b <= 7.6e-290) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_1;
		} else {
			tmp_3 = -t_0;
		}
		tmp_1 = tmp_3;
	} else if (b <= 3.7e-206) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = t_0;
		} else {
			tmp_4 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / (b + b)) * -2.0;
	} else {
		tmp_1 = ((b - b) / a) * 0.5;
	}
	return tmp_1;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = sqrt(((c / a) * (-1.0d0)))
    t_1 = -(b / a)
    if (b <= (-3.4d-156)) then
        if (b >= 0.0d0) then
            tmp_2 = t_1
        else
            tmp_2 = -b / a
        end if
        tmp_1 = tmp_2
    else if (b <= 7.6d-290) then
        if (b >= 0.0d0) then
            tmp_3 = t_1
        else
            tmp_3 = -t_0
        end if
        tmp_1 = tmp_3
    else if (b <= 3.7d-206) then
        if (b >= 0.0d0) then
            tmp_4 = t_0
        else
            tmp_4 = ((-2.0d0) * b) / (2.0d0 * a)
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = (c / (b + b)) * (-2.0d0)
    else
        tmp_1 = ((b - b) / a) * 0.5d0
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((c / a) * -1.0));
	double t_1 = -(b / a);
	double tmp_1;
	if (b <= -3.4e-156) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_1;
		} else {
			tmp_2 = -b / a;
		}
		tmp_1 = tmp_2;
	} else if (b <= 7.6e-290) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_1;
		} else {
			tmp_3 = -t_0;
		}
		tmp_1 = tmp_3;
	} else if (b <= 3.7e-206) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = t_0;
		} else {
			tmp_4 = (-2.0 * b) / (2.0 * a);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / (b + b)) * -2.0;
	} else {
		tmp_1 = ((b - b) / a) * 0.5;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((c / a) * -1.0))
	t_1 = -(b / a)
	tmp_1 = 0
	if b <= -3.4e-156:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = t_1
		else:
			tmp_2 = -b / a
		tmp_1 = tmp_2
	elif b <= 7.6e-290:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = t_1
		else:
			tmp_3 = -t_0
		tmp_1 = tmp_3
	elif b <= 3.7e-206:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = t_0
		else:
			tmp_4 = (-2.0 * b) / (2.0 * a)
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = (c / (b + b)) * -2.0
	else:
		tmp_1 = ((b - b) / a) * 0.5
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(c / a) * -1.0))
	t_1 = Float64(-Float64(b / a))
	tmp_1 = 0.0
	if (b <= -3.4e-156)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = t_1;
		else
			tmp_2 = Float64(Float64(-b) / a);
		end
		tmp_1 = tmp_2;
	elseif (b <= 7.6e-290)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = t_1;
		else
			tmp_3 = Float64(-t_0);
		end
		tmp_1 = tmp_3;
	elseif (b <= 3.7e-206)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = t_0;
		else
			tmp_4 = Float64(Float64(-2.0 * b) / Float64(2.0 * a));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / Float64(b + b)) * -2.0);
	else
		tmp_1 = Float64(Float64(Float64(b - b) / a) * 0.5);
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = sqrt(((c / a) * -1.0));
	t_1 = -(b / a);
	tmp_2 = 0.0;
	if (b <= -3.4e-156)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = t_1;
		else
			tmp_3 = -b / a;
		end
		tmp_2 = tmp_3;
	elseif (b <= 7.6e-290)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = t_1;
		else
			tmp_4 = -t_0;
		end
		tmp_2 = tmp_4;
	elseif (b <= 3.7e-206)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = t_0;
		else
			tmp_5 = (-2.0 * b) / (2.0 * a);
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = (c / (b + b)) * -2.0;
	else
		tmp_2 = ((b - b) / a) * 0.5;
	end
	tmp_6 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = (-N[(b / a), $MachinePrecision])}, If[LessEqual[b, -3.4e-156], If[GreaterEqual[b, 0.0], t$95$1, N[((-b) / a), $MachinePrecision]], If[LessEqual[b, 7.6e-290], If[GreaterEqual[b, 0.0], t$95$1, (-t$95$0)], If[LessEqual[b, 3.7e-206], If[GreaterEqual[b, 0.0], t$95$0, N[(N[(-2.0 * b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(c / N[(b + b), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision], N[(N[(N[(b - b), $MachinePrecision] / a), $MachinePrecision] * 0.5), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -3.3999999999999999e-156

   1. Initial program 71.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 71.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.6%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lift-/.f64 2.6

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

   10. Applied rewrites 2.6%

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

   11. Taylor expanded in b around -inf

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

       1. mul-1-neg N/A

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

       2. distribute-neg-frac N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 79.4

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

   13. Applied rewrites 79.4%

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

   if -3.3999999999999999e-156 < b < 7.5999999999999995e-290

   1. Initial program 77.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 69.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 3.4%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lift-/.f64 3.3

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

   10. Applied rewrites 3.3%

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

   11. Taylor expanded in a around -inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 N/A

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

       3. sqrt-unprod N/A

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

       4. lower-sqrt.f64 N/A

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

       5. lower-*.f64 N/A

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

       6. lower-/.f64 31.8

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

   13. Applied rewrites 31.8%

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

   if 7.5999999999999995e-290 < b < 3.69999999999999998e-206

   1. Initial program 78.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 8.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 8.7%

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

   8. 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) + b}{2 \cdot a}\\ \end{array} \]
   9. 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) + b}{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) + b}{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) + b}{2 \cdot a}\\ \end{array} \]

      4. lift-sqrt.f64 34.2

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

   10. Applied rewrites 34.2%

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

   11. Taylor expanded in b around -inf

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

       1. lower-*.f64 34.2

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

   13. Applied rewrites 34.2%

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

   if 3.69999999999999998e-206 < b

   1. Initial program 71.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. 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}} \]
   3. Step-by-step derivation

   4. Applied rewrites 71.7%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 74.8%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 74.8%

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

Alternative 9: 69.6% accurate, 1.5× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -3.4e-156)
   (if (>= b 0.0) (/ (* 2.0 c) (* -2.0 b)) (- (/ c b) (/ b a)))
   (if (>= b 0.0) (/ (* 2.0 c) (- (- b) b)) (- (sqrt (* (/ c a) -1.0))))))

C

double code(double a, double b, double c) {
	double tmp_1;
	if (b <= -3.4e-156) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_2 = (c / b) - (b / a);
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-b - b);
	} else {
		tmp_1 = -sqrt(((c / a) * -1.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.4d-156)) then
        if (b >= 0.0d0) then
            tmp_2 = (2.0d0 * c) / ((-2.0d0) * b)
        else
            tmp_2 = (c / b) - (b / a)
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = (2.0d0 * c) / (-b - b)
    else
        tmp_1 = -sqrt(((c / a) * (-1.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.4e-156) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (2.0 * c) / (-2.0 * b);
		} else {
			tmp_2 = (c / b) - (b / a);
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / (-b - b);
	} else {
		tmp_1 = -Math.sqrt(((c / a) * -1.0));
	}
	return tmp_1;
}

Python

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

Julia

function code(a, b, c)
	tmp_1 = 0.0
	if (b <= -3.4e-156)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(2.0 * c) / Float64(-2.0 * b));
		else
			tmp_2 = Float64(Float64(c / b) - Float64(b / 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(-sqrt(Float64(Float64(c / a) * -1.0)));
	end
	return tmp_1
end

MATLAB

function tmp_4 = code(a, b, c)
	tmp_2 = 0.0;
	if (b <= -3.4e-156)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (2.0 * c) / (-2.0 * b);
		else
			tmp_3 = (c / b) - (b / a);
		end
		tmp_2 = tmp_3;
	elseif (b >= 0.0)
		tmp_2 = (2.0 * c) / (-b - b);
	else
		tmp_2 = -sqrt(((c / a) * -1.0));
	end
	tmp_4 = tmp_2;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -3.4e-156], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) - b), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision])]]

Derivation

1. Split input into 2 regimes

2. if b < -3.3999999999999999e-156

   1. Initial program 71.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 71.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.6%

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

   8. Taylor expanded in b around -inf

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

      2. lower-neg.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. pow2 N/A

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

      9. lift-*.f64 N/A

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

      10. lower-/.f64 79.6

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

   10. Applied rewrites 79.6%

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

   11. Taylor expanded in c around 0

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

       2. lower-/.f64 N/A

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

       3. lift-/.f64 79.9

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

   13. Applied rewrites 79.9%

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

   14. Taylor expanded in a around 0

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

       1. lower-*.f64 79.9

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

   16. Applied rewrites 79.9%

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

   if -3.3999999999999999e-156 < b

   1. Initial program 73.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 68.5%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 57.7%

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

   8. 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}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right)\\ \end{array} \]
   9. 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) - b}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\mathsf{neg}\left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right)}\\ \end{array} \]

      2. lower-neg.f64 N/A

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

      3. sqrt-prod N/A

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

      4. lift-/.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-sqrt.f64 62.4

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

   10. Applied rewrites 62.4%

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

Alternative 10: 69.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := -\frac{b}{a}\\ \mathbf{if}\;b \leq -3.4 \cdot 10^{-156}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array}\\ \mathbf{elif}\;b \leq 5.5 \cdot 10^{-306}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b + b} \cdot -2\\ \mathbf{else}:\\ \;\;\;\;\frac{b - b}{a} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (- (/ b a))))
   (if (<= b -3.4e-156)
     (if (>= b 0.0) t_0 (/ (- b) a))
     (if (<= b 5.5e-306)
       (if (>= b 0.0) t_0 (- (sqrt (* (/ c a) -1.0))))
       (if (>= b 0.0) (* (/ c (+ b b)) -2.0) (* (/ (- b b) a) 0.5))))))

C

double code(double a, double b, double c) {
	double t_0 = -(b / a);
	double tmp_1;
	if (b <= -3.4e-156) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0;
		} else {
			tmp_2 = -b / a;
		}
		tmp_1 = tmp_2;
	} else if (b <= 5.5e-306) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_0;
		} else {
			tmp_3 = -sqrt(((c / a) * -1.0));
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (c / (b + b)) * -2.0;
	} else {
		tmp_1 = ((b - b) / a) * 0.5;
	}
	return tmp_1;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = -(b / a)
    if (b <= (-3.4d-156)) then
        if (b >= 0.0d0) then
            tmp_2 = t_0
        else
            tmp_2 = -b / a
        end if
        tmp_1 = tmp_2
    else if (b <= 5.5d-306) then
        if (b >= 0.0d0) then
            tmp_3 = t_0
        else
            tmp_3 = -sqrt(((c / a) * (-1.0d0)))
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (c / (b + b)) * (-2.0d0)
    else
        tmp_1 = ((b - b) / a) * 0.5d0
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -3.3999999999999999e-156

   1. Initial program 71.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 71.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.6%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lift-/.f64 2.6

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

   10. Applied rewrites 2.6%

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

   11. Taylor expanded in b around -inf

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

       1. mul-1-neg N/A

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

       2. distribute-neg-frac N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 79.4

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

   13. Applied rewrites 79.4%

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

   if -3.3999999999999999e-156 < b < 5.49999999999999992e-306

   1. Initial program 77.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 76.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 3.4%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lift-/.f64 3.3

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

   10. Applied rewrites 3.3%

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

   11. Taylor expanded in a around -inf

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

       1. mul-1-neg N/A

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

       2. lower-neg.f64 N/A

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

       3. sqrt-unprod N/A

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

       4. lower-sqrt.f64 N/A

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

       5. lower-*.f64 N/A

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

       6. lower-/.f64 34.9

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

   13. Applied rewrites 34.9%

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

   if 5.49999999999999992e-306 < b

   1. Initial program 72.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. 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}} \]
   3. Step-by-step derivation

   4. Applied rewrites 72.4%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 67.1%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 67.1%

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

Alternative 11: 67.4% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 5.5 \cdot 10^{-306}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-\frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b + b} \cdot -2\\ \mathbf{else}:\\ \;\;\;\;\frac{b - b}{a} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 5.5e-306)
   (if (>= b 0.0) (- (/ b a)) (/ (- b) a))
   (if (>= b 0.0) (* (/ c (+ b b)) -2.0) (* (/ (- b b) a) 0.5))))

C

double code(double a, double b, double c) {
	double tmp_1;
	if (b <= 5.5e-306) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -(b / a);
		} else {
			tmp_2 = -b / a;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (c / (b + b)) * -2.0;
	} else {
		tmp_1 = ((b - b) / a) * 0.5;
	}
	return tmp_1;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double a, double b, double c) {
	double tmp_1;
	if (b <= 5.5e-306) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -(b / a);
		} else {
			tmp_2 = -b / a;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (c / (b + b)) * -2.0;
	} else {
		tmp_1 = ((b - b) / a) * 0.5;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	tmp_1 = 0
	if b <= 5.5e-306:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = -(b / a)
		else:
			tmp_2 = -b / a
		tmp_1 = tmp_2
	elif b >= 0.0:
		tmp_1 = (c / (b + b)) * -2.0
	else:
		tmp_1 = ((b - b) / a) * 0.5
	return tmp_1

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 5.49999999999999992e-306

   1. Initial program 72.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 72.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 2.7%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lift-/.f64 2.7

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

   10. Applied rewrites 2.7%

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

   11. Taylor expanded in b around -inf

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

       1. mul-1-neg N/A

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

       2. distribute-neg-frac N/A

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

       3. lift-neg.f64 N/A

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

       4. lower-/.f64 67.6

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

   13. Applied rewrites 67.6%

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

   if 5.49999999999999992e-306 < b

   1. Initial program 72.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. 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}} \]
   3. Step-by-step derivation

   4. Applied rewrites 72.4%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 67.1%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 67.1%

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

Alternative 12: 35.2% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = -(b / a)
	else:
		tmp = -b / 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(-b) / 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 = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Initial program 72.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. 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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]
3. Step-by-step derivation

4. Applied rewrites 69.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) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array} \]

5. Taylor expanded in a around 0

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

7. Applied rewrites 34.8%

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

8. Taylor expanded in b around -inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. lift-/.f64 2.7

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

10. Applied rewrites 2.7%

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

11. Taylor expanded in b around -inf

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

    1. mul-1-neg N/A

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

    2. distribute-neg-frac N/A

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

    3. lift-neg.f64 N/A

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

    4. lower-/.f64 35.2

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

13. Applied rewrites 35.2%

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

Reproduce

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