jeff quadratic root 2

Percentage Accurate: 72.7% → 90.7%

Time: 5.6s

Alternatives: 10

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{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.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 90.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma (* -4.0 a) c (* b b)))) (t_1 (+ (- b) (- b))))
   (if (<= b -6.8e+78)
     (if (>= b 0.0) (/ (- b) a) (/ t_1 (+ a a)))
     (if (<= b 7.2e+138)
       (if (>= b 0.0) (/ (* -2.0 c) (+ t_0 b)) (* (/ (- t_0 b) a) 0.5))
       (if (>= b 0.0) (/ (* 2.0 c) (- (+ b b))) (/ t_1 (* 2.0 a)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma((-4.0 * a), c, (b * b)));
	double t_1 = -b + -b;
	double tmp_1;
	if (b <= -6.8e+78) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = t_1 / (a + a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 7.2e+138) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-2.0 * c) / (t_0 + b);
		} 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 = t_1 / (2.0 * a);
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(Float64(-4.0 * a), c, Float64(b * b)))
	t_1 = Float64(Float64(-b) + Float64(-b))
	tmp_1 = 0.0
	if (b <= -6.8e+78)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(-b) / a);
		else
			tmp_2 = Float64(t_1 / Float64(a + a));
		end
		tmp_1 = tmp_2;
	elseif (b <= 7.2e+138)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(-2.0 * c) / Float64(t_0 + b));
		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 = Float64(t_1 / Float64(2.0 * a));
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -6.80000000000000014e78

   1. Initial program 41.1%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 92.9

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

   5. Applied rewrites 92.9%

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

   6. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 92.9

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

   8. Applied rewrites 92.9%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 92.9

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

   10. Applied rewrites 92.9%

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

   if -6.80000000000000014e78 < b < 7.2000000000000002e138

   1. Initial program 85.2%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 85.2%

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

   if 7.2000000000000002e138 < b

   1. Initial program 43.9%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 43.9

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

   5. Applied rewrites 43.9%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 97.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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
3. Recombined 3 regimes into one program.

4. Final simplification 89.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -6.8 \cdot 10^{+78}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{a + a}\\ \end{array}\\ \mathbf{elif}\;b \leq 7.2 \cdot 10^{+138}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}{a} \cdot 0.5\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{-\left(b + b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 86.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (* a (/ c b))))
   (if (<= b -2.8e-84)
     (if (>= b 0.0)
       (/ (* (- 2.0) c) (+ b (sqrt (* b b))))
       (/ (* 2.0 (- t_0 b)) (* 2.0 a)))
     (if (<= b -4e-308)
       (if (>= b 0.0)
         (/ (* 2.0 c) (- (- b) (fma t_0 -2.0 b)))
         (/ (+ (- b) (sqrt (* (* -4.0 a) c))) (* 2.0 a)))
       (if (<= b 7.2e+138)
         (if (>= b 0.0)
           (/ (* -2.0 c) (+ (sqrt (fma (* -4.0 a) c (* b b))) b))
           (fma -0.5 (/ b a) (- (sqrt (* (/ c a) -1.0)))))
         (if (>= b 0.0)
           (/ (* 2.0 c) (- (+ b b)))
           (/ (+ (- b) (- b)) (* 2.0 a))))))))

C

double code(double a, double b, double c) {
	double t_0 = a * (c / b);
	double tmp_1;
	if (b <= -2.8e-84) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-2.0 * c) / (b + sqrt((b * b)));
		} else {
			tmp_2 = (2.0 * (t_0 - b)) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= -4e-308) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (2.0 * c) / (-b - fma(t_0, -2.0, b));
		} else {
			tmp_3 = (-b + sqrt(((-4.0 * a) * c))) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} else if (b <= 7.2e+138) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = (-2.0 * c) / (sqrt(fma((-4.0 * a), c, (b * b))) + b);
		} else {
			tmp_4 = fma(-0.5, (b / a), -sqrt(((c / a) * -1.0)));
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / -(b + b);
	} else {
		tmp_1 = (-b + -b) / (2.0 * a);
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = Float64(a * Float64(c / b))
	tmp_1 = 0.0
	if (b <= -2.8e-84)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-2.0) * c) / Float64(b + sqrt(Float64(b * b))));
		else
			tmp_2 = Float64(Float64(2.0 * Float64(t_0 - b)) / Float64(2.0 * a));
		end
		tmp_1 = tmp_2;
	elseif (b <= -4e-308)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - fma(t_0, -2.0, b)));
		else
			tmp_3 = Float64(Float64(Float64(-b) + sqrt(Float64(Float64(-4.0 * a) * c))) / Float64(2.0 * a));
		end
		tmp_1 = tmp_3;
	elseif (b <= 7.2e+138)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(-2.0 * c) / Float64(sqrt(fma(Float64(-4.0 * a), c, Float64(b * b))) + b));
		else
			tmp_4 = fma(-0.5, Float64(b / a), Float64(-sqrt(Float64(Float64(c / a) * -1.0))));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(2.0 * c) / Float64(-Float64(b + b)));
	else
		tmp_1 = Float64(Float64(Float64(-b) + Float64(-b)) / Float64(2.0 * a));
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -2.79999999999999982e-84

   1. Initial program 58.0%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      4. lift-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. pow2 N/A

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

      12. lift-*.f64 84.7

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

   5. Applied rewrites 84.7%

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

   6. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. distribute-lft-out-- N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. associate-*r/ N/A

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

      8. lift-/.f64 N/A

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

      9. lift-*.f64 84.7

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

   8. Applied rewrites 84.7%

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

   9. Taylor expanded in a around 0

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

       1. pow2 N/A

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

       2. lift-*.f64 84.7

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

   11. Applied rewrites 84.7%

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

   if -2.79999999999999982e-84 < b < -4.00000000000000013e-308

   1. Initial program 67.5%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 67.5

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

   5. Applied rewrites 67.5%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 59.1

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

   8. Applied rewrites 59.1%

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

   if -4.00000000000000013e-308 < b < 7.2000000000000002e138

   1. Initial program 89.1%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 89.1%

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

   6. Taylor expanded in a around -inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot 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} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. mul-1-neg N/A

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

      5. lower-neg.f64 N/A

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

      6. sqrt-unprod N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lift-/.f64 89.1

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

   8. Applied rewrites 89.1%

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

   if 7.2000000000000002e138 < b

   1. Initial program 43.9%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 43.9

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

   5. Applied rewrites 43.9%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 97.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) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
3. Recombined 4 regimes into one program.

4. Final simplification 85.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.8 \cdot 10^{-84}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-2\right) \cdot c}{b + \sqrt{b \cdot b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot \left(a \cdot \frac{c}{b} - b\right)}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \leq -4 \cdot 10^{-308}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \mathsf{fma}\left(a \cdot \frac{c}{b}, -2, b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \sqrt{\left(-4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \leq 7.2 \cdot 10^{+138}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.5, \frac{b}{a}, -\sqrt{\frac{c}{a} \cdot -1}\right)\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{-\left(b + b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 81.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (* a (/ c b))) (t_1 (sqrt (* (* -4.0 a) c))))
   (if (<= b -2.8e-84)
     (if (>= b 0.0)
       (/ (* (- 2.0) c) (+ b (sqrt (* b b))))
       (/ (* 2.0 (- t_0 b)) (* 2.0 a)))
     (if (or (<= b -4e-310) (not (<= b 6.6e-38)))
       (if (>= b 0.0)
         (/ (* 2.0 c) (- (- b) (fma t_0 -2.0 b)))
         (/ (+ (- b) t_1) (* 2.0 a)))
       (if (>= b 0.0)
         (/ (* -2.0 c) (+ t_1 b))
         (* (sqrt (* (/ c a) -4.0)) 0.5))))))

C

double code(double a, double b, double c) {
	double t_0 = a * (c / b);
	double t_1 = sqrt(((-4.0 * a) * c));
	double tmp_1;
	if (b <= -2.8e-84) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-2.0 * c) / (b + sqrt((b * b)));
		} else {
			tmp_2 = (2.0 * (t_0 - b)) / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if ((b <= -4e-310) || !(b <= 6.6e-38)) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (2.0 * c) / (-b - fma(t_0, -2.0, b));
		} else {
			tmp_3 = (-b + t_1) / (2.0 * a);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * c) / (t_1 + b);
	} else {
		tmp_1 = sqrt(((c / a) * -4.0)) * 0.5;
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = Float64(a * Float64(c / b))
	t_1 = sqrt(Float64(Float64(-4.0 * a) * c))
	tmp_1 = 0.0
	if (b <= -2.8e-84)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-2.0) * c) / Float64(b + sqrt(Float64(b * b))));
		else
			tmp_2 = Float64(Float64(2.0 * Float64(t_0 - b)) / Float64(2.0 * a));
		end
		tmp_1 = tmp_2;
	elseif ((b <= -4e-310) || !(b <= 6.6e-38))
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(2.0 * c) / Float64(Float64(-b) - fma(t_0, -2.0, b)));
		else
			tmp_3 = Float64(Float64(Float64(-b) + t_1) / Float64(2.0 * a));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * c) / Float64(t_1 + b));
	else
		tmp_1 = Float64(sqrt(Float64(Float64(c / a) * -4.0)) * 0.5);
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -2.79999999999999982e-84

   1. Initial program 58.0%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      4. lift-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. pow2 N/A

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

      12. lift-*.f64 84.7

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

   5. Applied rewrites 84.7%

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

   6. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. distribute-lft-out-- N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. associate-*r/ N/A

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

      8. lift-/.f64 N/A

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

      9. lift-*.f64 84.7

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

   8. Applied rewrites 84.7%

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

   9. Taylor expanded in a around 0

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

       1. pow2 N/A

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

       2. lift-*.f64 84.7

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

   11. Applied rewrites 84.7%

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

   if -2.79999999999999982e-84 < b < -3.999999999999988e-310 or 6.6000000000000005e-38 < b

   1. Initial program 69.3%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 82.2

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

   5. Applied rewrites 82.2%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lift-*.f64 79.9

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

   8. Applied rewrites 79.9%

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

   if -3.999999999999988e-310 < b < 6.6000000000000005e-38

   1. Initial program 85.5%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 85.5%

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

   6. Taylor expanded in a around inf

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

      1. sqrt-prod N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-sqrt.f64 85.5

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

   8. Applied rewrites 85.5%

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

   9. Taylor expanded in a around inf

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

       1. associate-*r* N/A

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

       2. lower-*.f64 N/A

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

       3. lift-*.f64 80.2

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

   11. Applied rewrites 80.2%

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

4. Final simplification 81.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.8 \cdot 10^{-84}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-2\right) \cdot c}{b + \sqrt{b \cdot b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot \left(a \cdot \frac{c}{b} - b\right)}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \leq -4 \cdot 10^{-310} \lor \neg \left(b \leq 6.6 \cdot 10^{-38}\right):\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - \mathsf{fma}\left(a \cdot \frac{c}{b}, -2, b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \sqrt{\left(-4 \cdot a\right) \cdot c}}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot c}{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{c}{a} \cdot -4} \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 76.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (* 2.0 (- (* a (/ c b)) b))))
   (if (<= b -1.7e-174)
     (if (>= b 0.0) (/ (* (- 2.0) c) (+ b (sqrt (* b b)))) (/ t_0 (* 2.0 a)))
     (if (<= b 4.9e-59)
       (if (>= b 0.0)
         (/ (* -2.0 c) (sqrt (* (* a c) -4.0)))
         (* (* -2.0 (sqrt (* (/ c a) -1.0))) 0.5))
       (if (>= b 0.0) (/ (+ c c) t_0) (/ (+ (- b) (- b)) (* 2.0 a)))))))

C

double code(double a, double b, double c) {
	double t_0 = 2.0 * ((a * (c / b)) - b);
	double tmp_1;
	if (b <= -1.7e-174) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-2.0 * c) / (b + sqrt((b * b)));
		} else {
			tmp_2 = t_0 / (2.0 * a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 4.9e-59) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-2.0 * c) / sqrt(((a * c) * -4.0));
		} else {
			tmp_3 = (-2.0 * sqrt(((c / a) * -1.0))) * 0.5;
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (c + c) / t_0;
	} else {
		tmp_1 = (-b + -b) / (2.0 * 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 = 2.0d0 * ((a * (c / b)) - b)
    if (b <= (-1.7d-174)) then
        if (b >= 0.0d0) then
            tmp_2 = (-2.0d0 * c) / (b + sqrt((b * b)))
        else
            tmp_2 = t_0 / (2.0d0 * a)
        end if
        tmp_1 = tmp_2
    else if (b <= 4.9d-59) then
        if (b >= 0.0d0) then
            tmp_3 = ((-2.0d0) * c) / sqrt(((a * c) * (-4.0d0)))
        else
            tmp_3 = ((-2.0d0) * sqrt(((c / a) * (-1.0d0)))) * 0.5d0
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (c + c) / t_0
    else
        tmp_1 = (-b + -b) / (2.0d0 * a)
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.7000000000000001e-174

   1. Initial program 59.3%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      4. lift-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. pow2 N/A

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

      12. lift-*.f64 78.5

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

   5. Applied rewrites 78.5%

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

   6. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

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

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

      4. distribute-lft-out-- N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. associate-*r/ N/A

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

      8. lift-/.f64 N/A

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

      9. lift-*.f64 80.3

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

   8. Applied rewrites 80.3%

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

   9. Taylor expanded in a around 0

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

       1. pow2 N/A

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

       2. lift-*.f64 80.3

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

   11. Applied rewrites 80.3%

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

   if -1.7000000000000001e-174 < b < 4.89999999999999977e-59

   1. Initial program 79.4%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 79.4%

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

   6. Taylor expanded in a around inf

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

      1. sqrt-prod N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-sqrt.f64 67.4

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

   8. Applied rewrites 67.4%

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

   9. Taylor expanded in a around inf

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

       1. sqrt-unprod N/A

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

       2. lower-sqrt.f64 N/A

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

       3. lower-*.f64 N/A

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

       4. lower-*.f64 64.0

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

   11. Applied rewrites 64.0%

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

   12. Taylor expanded in a around -inf

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

       1. lower-*.f64 N/A

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

       2. sqrt-unprod N/A

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

       3. lower-sqrt.f64 N/A

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

       4. lower-*.f64 N/A

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

       5. lift-/.f64 69.4

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

   14. Applied rewrites 69.4%

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

   if 4.89999999999999977e-59 < b

   1. Initial program 70.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 70.3

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

   5. Applied rewrites 70.3%

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

   6. Taylor expanded in a around 0

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

      1. distribute-lft-out-- N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. associate-*r/ N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 86.8

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

   8. Applied rewrites 86.8%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 86.8

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

   10. Applied rewrites 86.8%

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

4. Final simplification 79.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.7 \cdot 10^{-174}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-2\right) \cdot c}{b + \sqrt{b \cdot b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot \left(a \cdot \frac{c}{b} - b\right)}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \leq 4.9 \cdot 10^{-59}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot c}{\sqrt{\left(a \cdot c\right) \cdot -4}}\\ \mathbf{else}:\\ \;\;\;\;\left(-2 \cdot \sqrt{\frac{c}{a} \cdot -1}\right) \cdot 0.5\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c + c}{2 \cdot \left(a \cdot \frac{c}{b} - b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 76.1% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (+ (- b) (- b))))
   (if (<= b -1.7e-174)
     (if (>= b 0.0) (/ (- b) a) (/ t_0 (+ a a)))
     (if (<= b 4.9e-59)
       (if (>= b 0.0)
         (/ (* -2.0 c) (sqrt (* (* a c) -4.0)))
         (* (* -2.0 (sqrt (* (/ c a) -1.0))) 0.5))
       (if (>= b 0.0)
         (/ (+ c c) (* 2.0 (- (* a (/ c b)) b)))
         (/ t_0 (* 2.0 a)))))))

C

double code(double a, double b, double c) {
	double t_0 = -b + -b;
	double tmp_1;
	if (b <= -1.7e-174) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = t_0 / (a + a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 4.9e-59) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-2.0 * c) / sqrt(((a * c) * -4.0));
		} else {
			tmp_3 = (-2.0 * sqrt(((c / a) * -1.0))) * 0.5;
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (c + c) / (2.0 * ((a * (c / b)) - b));
	} else {
		tmp_1 = t_0 / (2.0 * 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 = -b + -b
    if (b <= (-1.7d-174)) then
        if (b >= 0.0d0) then
            tmp_2 = -b / a
        else
            tmp_2 = t_0 / (a + a)
        end if
        tmp_1 = tmp_2
    else if (b <= 4.9d-59) then
        if (b >= 0.0d0) then
            tmp_3 = ((-2.0d0) * c) / sqrt(((a * c) * (-4.0d0)))
        else
            tmp_3 = ((-2.0d0) * sqrt(((c / a) * (-1.0d0)))) * 0.5d0
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (c + c) / (2.0d0 * ((a * (c / b)) - b))
    else
        tmp_1 = t_0 / (2.0d0 * a)
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.7000000000000001e-174

   1. Initial program 59.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 80.1

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

   5. Applied rewrites 80.1%

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

   6. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 80.1

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

   8. Applied rewrites 80.1%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 80.1

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

   10. Applied rewrites 80.1%

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

   if -1.7000000000000001e-174 < b < 4.89999999999999977e-59

   1. Initial program 79.4%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 79.4%

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

   6. Taylor expanded in a around inf

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

      1. sqrt-prod N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-sqrt.f64 67.4

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

   8. Applied rewrites 67.4%

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

   9. Taylor expanded in a around inf

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

       1. sqrt-unprod N/A

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

       2. lower-sqrt.f64 N/A

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

       3. lower-*.f64 N/A

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

       4. lower-*.f64 64.0

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

   11. Applied rewrites 64.0%

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

   12. Taylor expanded in a around -inf

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

       1. lower-*.f64 N/A

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

       2. sqrt-unprod N/A

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

       3. lower-sqrt.f64 N/A

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

       4. lower-*.f64 N/A

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

       5. lift-/.f64 69.4

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

   14. Applied rewrites 69.4%

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

   if 4.89999999999999977e-59 < b

   1. Initial program 70.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 70.3

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

   5. Applied rewrites 70.3%

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

   6. Taylor expanded in a around 0

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

      1. distribute-lft-out-- N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. associate-*r/ N/A

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

      5. lift-/.f64 N/A

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

      6. lift-*.f64 86.8

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

   8. Applied rewrites 86.8%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 86.8

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

   10. Applied rewrites 86.8%

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

Alternative 6: 76.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (+ (- b) (- b))))
   (if (<= b -1.7e-174)
     (if (>= b 0.0) (/ (- b) a) (/ t_0 (+ a a)))
     (if (<= b 4.9e-59)
       (if (>= b 0.0)
         (/ (* -2.0 c) (sqrt (* (* a c) -4.0)))
         (* (* -2.0 (sqrt (* (/ c a) -1.0))) 0.5))
       (if (>= b 0.0) (/ (* 2.0 c) (- (+ b b))) (/ t_0 (* 2.0 a)))))))

C

double code(double a, double b, double c) {
	double t_0 = -b + -b;
	double tmp_1;
	if (b <= -1.7e-174) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -b / a;
		} else {
			tmp_2 = t_0 / (a + a);
		}
		tmp_1 = tmp_2;
	} else if (b <= 4.9e-59) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-2.0 * c) / sqrt(((a * c) * -4.0));
		} else {
			tmp_3 = (-2.0 * sqrt(((c / a) * -1.0))) * 0.5;
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (2.0 * c) / -(b + b);
	} else {
		tmp_1 = t_0 / (2.0 * 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 = -b + -b
    if (b <= (-1.7d-174)) then
        if (b >= 0.0d0) then
            tmp_2 = -b / a
        else
            tmp_2 = t_0 / (a + a)
        end if
        tmp_1 = tmp_2
    else if (b <= 4.9d-59) then
        if (b >= 0.0d0) then
            tmp_3 = ((-2.0d0) * c) / sqrt(((a * c) * (-4.0d0)))
        else
            tmp_3 = ((-2.0d0) * sqrt(((c / a) * (-1.0d0)))) * 0.5d0
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (2.0d0 * c) / -(b + b)
    else
        tmp_1 = t_0 / (2.0d0 * a)
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

function code(a, b, c)
	t_0 = Float64(Float64(-b) + Float64(-b))
	tmp_1 = 0.0
	if (b <= -1.7e-174)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(-b) / a);
		else
			tmp_2 = Float64(t_0 / Float64(a + a));
		end
		tmp_1 = tmp_2;
	elseif (b <= 4.9e-59)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(-2.0 * c) / sqrt(Float64(Float64(a * c) * -4.0)));
		else
			tmp_3 = Float64(Float64(-2.0 * sqrt(Float64(Float64(c / a) * -1.0))) * 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 = Float64(t_0 / Float64(2.0 * a));
	end
	return tmp_1
end

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.7000000000000001e-174

   1. Initial program 59.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 80.1

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

   5. Applied rewrites 80.1%

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

   6. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 80.1

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

   8. Applied rewrites 80.1%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 80.1

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

   10. Applied rewrites 80.1%

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

   if -1.7000000000000001e-174 < b < 4.89999999999999977e-59

   1. Initial program 79.4%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 79.4%

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

   6. Taylor expanded in a around inf

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

      1. sqrt-prod N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-sqrt.f64 67.4

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

   8. Applied rewrites 67.4%

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

   9. Taylor expanded in a around inf

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

       1. sqrt-unprod N/A

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

       2. lower-sqrt.f64 N/A

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

       3. lower-*.f64 N/A

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

       4. lower-*.f64 64.0

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

   11. Applied rewrites 64.0%

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

   12. Taylor expanded in a around -inf

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

       1. lower-*.f64 N/A

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

       2. sqrt-unprod N/A

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

       3. lower-sqrt.f64 N/A

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

       4. lower-*.f64 N/A

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

       5. lift-/.f64 69.4

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

   14. Applied rewrites 69.4%

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

   if 4.89999999999999977e-59 < b

   1. Initial program 70.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 70.3

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

   5. Applied rewrites 70.3%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 86.3%

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

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.7 \cdot 10^{-174}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{a + a}\\ \end{array}\\ \mathbf{elif}\;b \leq 4.9 \cdot 10^{-59}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot c}{\sqrt{\left(a \cdot c\right) \cdot -4}}\\ \mathbf{else}:\\ \;\;\;\;\left(-2 \cdot \sqrt{\frac{c}{a} \cdot -1}\right) \cdot 0.5\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{-\left(b + b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 75.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

function code(a, b, c)
	t_0 = Float64(Float64(-b) + Float64(-b))
	tmp_1 = 0.0
	if (b <= -1.1e-217)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(-b) / a);
		else
			tmp_2 = Float64(t_0 / Float64(a + a));
		end
		tmp_1 = tmp_2;
	elseif (b <= 4.9e-59)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(-2.0 * c) / sqrt(Float64(Float64(a * c) * -4.0)));
		else
			tmp_3 = Float64(sqrt(Float64(Float64(c / a) * -4.0)) * 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 = Float64(t_0 / Float64(2.0 * a));
	end
	return tmp_1
end

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.09999999999999991e-217

   1. Initial program 59.1%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 76.3

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

   5. Applied rewrites 76.3%

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

   6. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 76.3

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

   8. Applied rewrites 76.3%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 76.3

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

   10. Applied rewrites 76.3%

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

   if -1.09999999999999991e-217 < b < 4.89999999999999977e-59

   1. Initial program 82.8%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 82.8%

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

   6. Taylor expanded in a around inf

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

      1. sqrt-prod N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-sqrt.f64 76.5

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

   8. Applied rewrites 76.5%

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

   9. Taylor expanded in a around inf

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

       1. sqrt-unprod N/A

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

       2. lower-sqrt.f64 N/A

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

       3. lower-*.f64 N/A

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

       4. lower-*.f64 72.6

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

   11. Applied rewrites 72.6%

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

   if 4.89999999999999977e-59 < b

   1. Initial program 70.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 70.3

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

   5. Applied rewrites 70.3%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 86.3%

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

4. Final simplification 78.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.1 \cdot 10^{-217}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{a + a}\\ \end{array}\\ \mathbf{elif}\;b \leq 4.9 \cdot 10^{-59}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot c}{\sqrt{\left(a \cdot c\right) \cdot -4}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{c}{a} \cdot -4} \cdot 0.5\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{-\left(b + b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 69.6% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.85000000000000004e-96

   1. Initial program 65.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 72.4

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

   5. Applied rewrites 72.4%

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

   6. Taylor expanded in a around -inf

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

      1. sqrt-unprod N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lift-/.f64 61.3

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

   8. Applied rewrites 61.3%

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

   if 2.85000000000000004e-96 < b

   1. Initial program 72.7%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 72.7

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

   5. Applied rewrites 72.7%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 81.1%

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

4. Final simplification 68.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 2.85 \cdot 10^{-96}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{c}{a} \cdot -1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot c}{-\left(b + b\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) + \left(-b\right)}{2 \cdot a}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 67.9% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 67.9%

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

3. Taylor expanded in b around -inf

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

   1. mul-1-neg N/A

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

   2. lift-neg.f64 72.5

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

5. Applied rewrites 72.5%

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

6. Taylor expanded in a around 0

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

8. Applied rewrites 65.0%

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

9. Final simplification 65.0%

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

Alternative 10: 34.9% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -b / a;
	} else {
		tmp = (-b + -b) / (a + a);
	}
	return tmp;
}

Python

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 67.9%

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

3. Taylor expanded in b around -inf

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

   1. mul-1-neg N/A

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

   2. lift-neg.f64 72.5

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

5. Applied rewrites 72.5%

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

6. Taylor expanded in b around -inf

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

   1. associate-*r/ N/A

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

   2. mul-1-neg N/A

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

   3. lift-neg.f64 N/A

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

   4. lower-/.f64 36.9

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

8. Applied rewrites 36.9%

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

   1. lift-*.f64 N/A

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

   2. count-2-rev N/A

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

   3. lower-+.f64 36.9

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

10. Applied rewrites 36.9%

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

Reproduce

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