jeff quadratic root 2

Percentage Accurate: 71.9% → 90.8%

Time: 10.0s

Alternatives: 10

Speedup: 1.1×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 71.9% 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.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.4e+131)
   (if (>= b 0.0) (fma (/ b c) -1.0 (/ a b)) (fma (/ b a) -1.0 (/ c b)))
   (if (<= b 5.2e+93)
     (if (>= b 0.0)
       (/ (* -2.0 c) (+ (sqrt (fma -4.0 (* a c) (* b b))) b))
       (* (/ (- (sqrt (fma (* -4.0 c) a (* b b))) b) a) 0.5))
     (if (>= b 0.0) (/ (- c) b) (* (* b (/ -2.0 a)) 0.5)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -2.3999999999999999e131

   1. Initial program 39.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

   4. Applied rewrites 0.5%

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

   5. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 98.0

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

   7. Applied rewrites 98.0%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 98.0

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

   10. Applied rewrites 98.0%

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

   11. Taylor expanded in a around 0

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

   13. Applied rewrites 98.0%

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

   if -2.3999999999999999e131 < b < 5.19999999999999999e93

   1. Initial program 84.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 84.6%

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

   7. Applied rewrites 84.6%

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

   if 5.19999999999999999e93 < b

   1. Initial program 54.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 54.6%

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

   6. Taylor expanded in b around -inf

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

   8. Applied rewrites 54.6%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 98.2%

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

   13. Applied rewrites 98.2%

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

Alternative 2: 81.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* (* a c) -4.0))))
   (if (<= b -9.5e-56)
     (if (>= b 0.0) (fma (/ b c) -1.0 (/ a b)) (fma (/ b a) -1.0 (/ c b)))
     (if (or (<= b -1e-310) (not (<= b 1e-37)))
       (if (>= b 0.0) (/ (- c) b) (* (/ (- t_0 b) a) 0.5))
       (if (>= b 0.0) (/ (* -2.0 c) (+ t_0 b)) (* (* (/ b a) -2.0) 0.5))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((a * c) * -4.0));
	double tmp_1;
	if (b <= -9.5e-56) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = fma((b / c), -1.0, (a / b));
		} else {
			tmp_2 = fma((b / a), -1.0, (c / b));
		}
		tmp_1 = tmp_2;
	} else if ((b <= -1e-310) || !(b <= 1e-37)) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = -c / b;
		} else {
			tmp_3 = ((t_0 - b) / a) * 0.5;
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * c) / (t_0 + b);
	} else {
		tmp_1 = ((b / a) * -2.0) * 0.5;
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(a * c) * -4.0))
	tmp_1 = 0.0
	if (b <= -9.5e-56)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = fma(Float64(b / c), -1.0, Float64(a / b));
		else
			tmp_2 = fma(Float64(b / a), -1.0, Float64(c / b));
		end
		tmp_1 = tmp_2;
	elseif ((b <= -1e-310) || !(b <= 1e-37))
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(-c) / 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(t_0 + b));
	else
		tmp_1 = Float64(Float64(Float64(b / a) * -2.0) * 0.5);
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -9.5e-56], If[GreaterEqual[b, 0.0], N[(N[(b / c), $MachinePrecision] * -1.0 + N[(a / b), $MachinePrecision]), $MachinePrecision], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]], If[Or[LessEqual[b, -1e-310], N[Not[LessEqual[b, 1e-37]], $MachinePrecision]], If[GreaterEqual[b, 0.0], N[((-c) / b), $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[(t$95$0 + b), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / a), $MachinePrecision] * -2.0), $MachinePrecision] * 0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -9.4999999999999991e-56

   1. Initial program 67.1%

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

   4. Applied rewrites 1.4%

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

   5. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 89.0

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

   7. Applied rewrites 89.0%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 89.0

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

   10. Applied rewrites 89.0%

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

   11. Taylor expanded in a around 0

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

   13. Applied rewrites 89.0%

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

   if -9.4999999999999991e-56 < b < -9.999999999999969e-311 or 1.00000000000000007e-37 < b

   1. Initial program 70.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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 70.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 85.3%

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

   9. Taylor expanded in a around inf

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

   11. Applied rewrites 82.6%

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

   if -9.999999999999969e-311 < b < 1.00000000000000007e-37

   1. Initial program 80.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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 80.1%

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

   6. Taylor expanded in b around -inf

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

   8. Applied rewrites 80.1%

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

   11. Applied rewrites 64.1%

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

4. Final simplification 82.2%

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

Alternative 3: 86.0% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -2.3999999999999999e131

   1. Initial program 39.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

   4. Applied rewrites 0.5%

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

   5. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 98.0

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

   7. Applied rewrites 98.0%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 98.0

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

   10. Applied rewrites 98.0%

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

   11. Taylor expanded in a around 0

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

   13. Applied rewrites 98.0%

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

   if -2.3999999999999999e131 < b < -9.999999999999969e-311

   1. Initial program 85.7%

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

   3. Taylor expanded in a around 0

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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 85.6%

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

   if -9.999999999999969e-311 < b < 1.00000000000000007e-37

   1. Initial program 80.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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 80.1%

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

   6. Taylor expanded in b around -inf

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

   8. Applied rewrites 80.1%

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

   11. Applied rewrites 64.1%

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

   if 1.00000000000000007e-37 < b

   1. Initial program 66.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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 66.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 89.9%

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

   9. Taylor expanded in a around inf

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

   11. Applied rewrites 89.9%

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

Alternative 4: 90.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma -4.0 (* a c) (* b b)))))
   (if (<= b -2.4e+131)
     (if (>= b 0.0) (fma (/ b c) -1.0 (/ a b)) (fma (/ b a) -1.0 (/ c b)))
     (if (<= b 5.2e+93)
       (if (>= b 0.0) (/ (* -2.0 c) (+ t_0 b)) (* (/ (- t_0 b) a) 0.5))
       (if (>= b 0.0) (/ (- c) b) (* (* b (/ -2.0 a)) 0.5))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma(-4.0, (a * c), (b * b)));
	double tmp_1;
	if (b <= -2.4e+131) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = fma((b / c), -1.0, (a / b));
		} else {
			tmp_2 = fma((b / a), -1.0, (c / b));
		}
		tmp_1 = tmp_2;
	} else if (b <= 5.2e+93) {
		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 = -c / b;
	} else {
		tmp_1 = (b * (-2.0 / a)) * 0.5;
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(-4.0, Float64(a * c), Float64(b * b)))
	tmp_1 = 0.0
	if (b <= -2.4e+131)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = fma(Float64(b / c), -1.0, Float64(a / b));
		else
			tmp_2 = fma(Float64(b / a), -1.0, Float64(c / b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 5.2e+93)
		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(-c) / b);
	else
		tmp_1 = Float64(Float64(b * Float64(-2.0 / a)) * 0.5);
	end
	return tmp_1
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -2.3999999999999999e131

   1. Initial program 39.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

   4. Applied rewrites 0.5%

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

   5. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 98.0

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

   7. Applied rewrites 98.0%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 98.0

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

   10. Applied rewrites 98.0%

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

   11. Taylor expanded in a around 0

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

   13. Applied rewrites 98.0%

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

   if -2.3999999999999999e131 < b < 5.19999999999999999e93

   1. Initial program 84.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 84.6%

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

   if 5.19999999999999999e93 < b

   1. Initial program 54.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 54.6%

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

   6. Taylor expanded in b around -inf

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

   8. Applied rewrites 54.6%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 98.2%

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

   13. Applied rewrites 98.2%

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

Alternative 5: 90.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.4e+131)
   (if (>= b 0.0) (fma (/ b c) -1.0 (/ a b)) (fma (/ b a) -1.0 (/ c b)))
   (if (<= b 5.2e+93)
     (if (>= b 0.0)
       (/ (* -2.0 c) (+ (sqrt (fma -4.0 (* a c) (* b b))) b))
       (* (- (sqrt (fma (* a c) -4.0 (* b b))) b) (/ 0.5 a)))
     (if (>= b 0.0) (/ (- c) b) (* (* b (/ -2.0 a)) 0.5)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -2.3999999999999999e131

   1. Initial program 39.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

   4. Applied rewrites 0.5%

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

   5. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 98.0

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

   7. Applied rewrites 98.0%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 98.0

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

   10. Applied rewrites 98.0%

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

   11. Taylor expanded in a around 0

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

   13. Applied rewrites 98.0%

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

   if -2.3999999999999999e131 < b < 5.19999999999999999e93

   1. Initial program 84.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 84.6%

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

   7. Applied rewrites 84.5%

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

   if 5.19999999999999999e93 < b

   1. Initial program 54.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 54.6%

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

   6. Taylor expanded in b around -inf

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

   8. Applied rewrites 54.6%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 98.2%

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

   13. Applied rewrites 98.2%

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

Alternative 6: 90.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.4e+131)
   (if (>= b 0.0) (fma (/ b c) -1.0 (/ a b)) (fma (/ b a) -1.0 (/ c b)))
   (if (<= b 5.2e+93)
     (if (>= b 0.0)
       (* c (/ -2.0 (+ (sqrt (fma (* a c) -4.0 (* b b))) b)))
       (* (/ (- (sqrt (fma (* -4.0 c) a (* b b))) b) a) 0.5))
     (if (>= b 0.0) (/ (- c) b) (* (* b (/ -2.0 a)) 0.5)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -2.3999999999999999e131

   1. Initial program 39.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

   4. Applied rewrites 0.5%

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

   5. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 98.0

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

   7. Applied rewrites 98.0%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 98.0

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

   10. Applied rewrites 98.0%

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

   11. Taylor expanded in a around 0

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

   13. Applied rewrites 98.0%

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

   if -2.3999999999999999e131 < b < 5.19999999999999999e93

   1. Initial program 84.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 84.6%

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

   7. Applied rewrites 84.6%

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

   9. Applied rewrites 84.5%

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

   if 5.19999999999999999e93 < b

   1. Initial program 54.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 54.6%

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

   6. Taylor expanded in b around -inf

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

   8. Applied rewrites 54.6%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 98.2%

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

   13. Applied rewrites 98.2%

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

Alternative 7: 90.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.4e+131)
   (if (>= b 0.0) (fma (/ b c) -1.0 (/ a b)) (fma (/ b a) -1.0 (/ c b)))
   (if (<= b 5.2e+93)
     (if (>= b 0.0)
       (* c (/ -2.0 (+ (sqrt (fma (* a c) -4.0 (* b b))) b)))
       (* (/ (- (sqrt (fma -4.0 (* a c) (* b b))) b) a) 0.5))
     (if (>= b 0.0) (/ (- c) b) (* (* b (/ -2.0 a)) 0.5)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -2.3999999999999999e131

   1. Initial program 39.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

   4. Applied rewrites 0.5%

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

   5. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 98.0

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

   7. Applied rewrites 98.0%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 98.0

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

   10. Applied rewrites 98.0%

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

   11. Taylor expanded in a around 0

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

   13. Applied rewrites 98.0%

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

   if -2.3999999999999999e131 < b < 5.19999999999999999e93

   1. Initial program 84.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 84.6%

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

   7. Applied rewrites 84.5%

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

   if 5.19999999999999999e93 < b

   1. Initial program 54.6%

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

   3. Taylor expanded in 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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 54.6%

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

   6. Taylor expanded in b around -inf

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

   8. Applied rewrites 54.6%

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

   9. Taylor expanded in a around 0

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

   11. Applied rewrites 98.2%

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

   13. Applied rewrites 98.2%

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

Alternative 8: 74.5% accurate, 1.1× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double tmp_1;
	if (b <= -9.5e-56) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = fma((b / c), -1.0, (a / b));
		} else {
			tmp_2 = fma((b / a), -1.0, (c / b));
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = -c / b;
	} else {
		tmp_1 = ((sqrt(((a * c) * -4.0)) - b) / a) * 0.5;
	}
	return tmp_1;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -9.4999999999999991e-56

   1. Initial program 67.1%

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

   4. Applied rewrites 1.4%

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

   5. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 89.0

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

   7. Applied rewrites 89.0%

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

   8. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 89.0

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

   10. Applied rewrites 89.0%

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

   11. Taylor expanded in a around 0

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

   13. Applied rewrites 89.0%

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

   if -9.4999999999999991e-56 < b

   1. Initial program 72.8%

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

      1. lower->=.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

      2. associate-*r/ N/A

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

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

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

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

      9. metadata-eval N/A

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

      10. +-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. unpow2 N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

   5. Applied rewrites 72.7%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 71.7%

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

   9. Taylor expanded in a around inf

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

   11. Applied rewrites 69.6%

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

Alternative 9: 68.4% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 70.7%

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

3. Taylor expanded in 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

   1. lower->=.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

   2. associate-*r/ N/A

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

   3. lower-/.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

   5. +-commutative N/A

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

   6. lower-+.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

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

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

   9. metadata-eval N/A

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

   10. +-commutative N/A

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

   11. lower-fma.f64 N/A

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

   12. lower-*.f64 N/A

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

   13. unpow2 N/A

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

   14. lower-*.f64 N/A

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

   15. *-commutative N/A

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

5. Applied rewrites 70.7%

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

6. Taylor expanded in b around -inf

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

8. Applied rewrites 67.9%

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

9. Taylor expanded in a around 0

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

11. Applied rewrites 67.2%

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

Alternative 10: 68.3% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 70.7%

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

3. Taylor expanded in 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

   1. lower->=.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;\color{blue}{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} \]

   2. associate-*r/ N/A

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

   3. lower-/.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{-2 \cdot 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. lower-*.f64 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot 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} \]

   5. +-commutative N/A

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

   6. lower-+.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

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

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

   9. metadata-eval N/A

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

   10. +-commutative N/A

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

   11. lower-fma.f64 N/A

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

   12. lower-*.f64 N/A

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

   13. unpow2 N/A

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

   14. lower-*.f64 N/A

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

   15. *-commutative N/A

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

5. Applied rewrites 70.7%

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

6. Taylor expanded in b around -inf

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

8. Applied rewrites 67.9%

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

9. Taylor expanded in a around 0

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

11. Applied rewrites 67.2%

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

13. Applied rewrites 67.1%

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

Reproduce

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