ABCF->ab-angle a

Percentage Accurate: 18.7% → 55.5%
Time: 26.5s
Alternatives: 12
Speedup: 6.0×

Specification

?
\[\begin{array}{l} \\ \begin{array}{l} t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\ \frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0} \end{array} \end{array} \]
(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
   (/
    (-
     (sqrt
      (*
       (* 2.0 (* t_0 F))
       (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
    t_0)))
double code(double A, double B, double C, double F) {
	double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
	return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: t_0
    t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
    code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
	double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
	return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F):
	t_0 = math.pow(B, 2.0) - ((4.0 * A) * C)
	return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F)
	t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C))
	return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0)
end
function tmp = code(A, B, C, F)
	t_0 = (B ^ 2.0) - ((4.0 * A) * C);
	tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0;
end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 12 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 18.7% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\ \frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0} \end{array} \end{array} \]
(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
   (/
    (-
     (sqrt
      (*
       (* 2.0 (* t_0 F))
       (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
    t_0)))
double code(double A, double B, double C, double F) {
	double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
	return -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}
real(8) function code(a, b, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: t_0
    t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
    code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) + sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function
public static double code(double A, double B, double C, double F) {
	double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
	return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}
def code(A, B, C, F):
	t_0 = math.pow(B, 2.0) - ((4.0 * A) * C)
	return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) + math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
function code(A, B, C, F)
	t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C))
	return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0)
end
function tmp = code(A, B, C, F)
	t_0 = (B ^ 2.0) - ((4.0 * A) * C);
	tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) + sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0;
end
code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := {B}^{2} - \left(4 \cdot A\right) \cdot C\\
\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{t\_0}
\end{array}
\end{array}

Alternative 1: 55.5% accurate, 1.0× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 10^{-279}:\\ \;\;\;\;\frac{\sqrt{F \cdot t\_0} \cdot \sqrt{2 \cdot \left(2 \cdot C\right)}}{-t\_0}\\ \mathbf{elif}\;{B\_m}^{2} \leq 10^{-125}:\\ \;\;\;\;\frac{\sqrt{\left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right) \cdot \left(2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\ \end{array} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (fma B_m B_m (* A (* C -4.0)))))
   (if (<= (pow B_m 2.0) 1e-279)
     (/ (* (sqrt (* F t_0)) (sqrt (* 2.0 (* 2.0 C)))) (- t_0))
     (if (<= (pow B_m 2.0) 1e-125)
       (/
        (sqrt
         (*
          (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C))
          (* 2.0 (* F (fma B_m B_m (* C (* A -4.0)))))))
        (- (* (* 4.0 A) C) (pow B_m 2.0)))
       (* (/ (sqrt 2.0) B_m) (* (sqrt (+ C (hypot C B_m))) (- (sqrt F))))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
	double tmp;
	if (pow(B_m, 2.0) <= 1e-279) {
		tmp = (sqrt((F * t_0)) * sqrt((2.0 * (2.0 * C)))) / -t_0;
	} else if (pow(B_m, 2.0) <= 1e-125) {
		tmp = sqrt((((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C)) * (2.0 * (F * fma(B_m, B_m, (C * (A * -4.0))))))) / (((4.0 * A) * C) - pow(B_m, 2.0));
	} else {
		tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(C, B_m))) * -sqrt(F));
	}
	return tmp;
}
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0)))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-279)
		tmp = Float64(Float64(sqrt(Float64(F * t_0)) * sqrt(Float64(2.0 * Float64(2.0 * C)))) / Float64(-t_0));
	elseif ((B_m ^ 2.0) <= 1e-125)
		tmp = Float64(sqrt(Float64(Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C)) * Float64(2.0 * Float64(F * fma(B_m, B_m, Float64(C * Float64(A * -4.0))))))) / Float64(Float64(Float64(4.0 * A) * C) - (B_m ^ 2.0)));
	else
		tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(C, B_m))) * Float64(-sqrt(F))));
	end
	return tmp
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-279], N[(N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-125], N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision] * N[(2.0 * N[(F * N[(B$95$m * B$95$m + N[(C * N[(A * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision] - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-279}:\\
\;\;\;\;\frac{\sqrt{F \cdot t\_0} \cdot \sqrt{2 \cdot \left(2 \cdot C\right)}}{-t\_0}\\

\mathbf{elif}\;{B\_m}^{2} \leq 10^{-125}:\\
\;\;\;\;\frac{\sqrt{\left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right) \cdot \left(2 \cdot \left(F \cdot \mathsf{fma}\left(B\_m, B\_m, C \cdot \left(A \cdot -4\right)\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B\_m}^{2}}\\

\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-279

    1. Initial program 16.9%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Simplified28.4%

      \[\leadsto \color{blue}{\frac{\sqrt{\left(\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot F\right) \cdot \left(2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}} \]
    3. Add Preprocessing
    4. Step-by-step derivation
      1. sqrt-prod37.1%

        \[\leadsto \frac{\color{blue}{\sqrt{\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot F} \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      2. *-commutative37.1%

        \[\leadsto \frac{\sqrt{\color{blue}{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}} \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      3. hypot-undefine22.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \color{blue}{\sqrt{B \cdot B + \left(A - C\right) \cdot \left(A - C\right)}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      4. unpow222.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\color{blue}{{B}^{2}} + \left(A - C\right) \cdot \left(A - C\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      5. unpow222.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{{B}^{2} + \color{blue}{{\left(A - C\right)}^{2}}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      6. +-commutative22.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\color{blue}{{\left(A - C\right)}^{2} + {B}^{2}}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      7. unpow222.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\color{blue}{\left(A - C\right) \cdot \left(A - C\right)} + {B}^{2}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      8. unpow222.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\left(A - C\right) \cdot \left(A - C\right) + \color{blue}{B \cdot B}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      9. hypot-define37.1%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \color{blue}{\mathsf{hypot}\left(A - C, B\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
    5. Applied egg-rr37.1%

      \[\leadsto \frac{\color{blue}{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(A - C, B\right)\right)\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
    6. Taylor expanded in A around -inf 22.3%

      \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \color{blue}{\left(2 \cdot C\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

    if 1.00000000000000006e-279 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000001e-125

    1. Initial program 12.8%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around -inf 25.6%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    4. Step-by-step derivation
      1. sub-neg25.6%

        \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\color{blue}{\left({B}^{2} + \left(-\left(4 \cdot A\right) \cdot C\right)\right)} \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
      2. *-commutative25.6%

        \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} + \left(-\color{blue}{C \cdot \left(4 \cdot A\right)}\right)\right) \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    5. Applied egg-rr25.6%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\color{blue}{\left({B}^{2} + \left(-C \cdot \left(4 \cdot A\right)\right)\right)} \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    6. Step-by-step derivation
      1. unpow225.6%

        \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(\color{blue}{B \cdot B} + \left(-C \cdot \left(4 \cdot A\right)\right)\right) \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
      2. fma-undefine25.6%

        \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\color{blue}{\mathsf{fma}\left(B, B, -C \cdot \left(4 \cdot A\right)\right)} \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
      3. distribute-rgt-neg-in25.6%

        \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\mathsf{fma}\left(B, B, \color{blue}{C \cdot \left(-4 \cdot A\right)}\right) \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
      4. distribute-lft-neg-in25.6%

        \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\mathsf{fma}\left(B, B, C \cdot \color{blue}{\left(\left(-4\right) \cdot A\right)}\right) \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
      5. metadata-eval25.6%

        \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\mathsf{fma}\left(B, B, C \cdot \left(\color{blue}{-4} \cdot A\right)\right) \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    7. Simplified25.6%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\color{blue}{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)} \cdot F\right)\right) \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

    if 1.00000000000000001e-125 < (pow.f64 B #s(literal 2 binary64))

    1. Initial program 18.3%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around 0 11.3%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg11.3%

        \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]
      2. unpow211.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{\color{blue}{B \cdot B} + {C}^{2}}\right)} \]
      3. unpow211.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{B \cdot B + \color{blue}{C \cdot C}}\right)} \]
      4. hypot-define19.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \color{blue}{\mathsf{hypot}\left(B, C\right)}\right)} \]
    5. Simplified19.0%

      \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}} \]
    6. Step-by-step derivation
      1. pow1/219.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{{\left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}^{0.5}} \]
      2. *-commutative19.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot {\color{blue}{\left(\left(C + \mathsf{hypot}\left(B, C\right)\right) \cdot F\right)}}^{0.5} \]
      3. unpow-prod-down30.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left({\left(C + \mathsf{hypot}\left(B, C\right)\right)}^{0.5} \cdot {F}^{0.5}\right)} \]
      4. pow1/230.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\color{blue}{\sqrt{C + \mathsf{hypot}\left(B, C\right)}} \cdot {F}^{0.5}\right) \]
      5. pow1/230.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \color{blue}{\sqrt{F}}\right) \]
    7. Applied egg-rr30.4%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \sqrt{F}\right)} \]
    8. Step-by-step derivation
      1. hypot-undefine14.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\sqrt{B \cdot B + C \cdot C}}} \cdot \sqrt{F}\right) \]
      2. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{B}^{2}} + C \cdot C}} \cdot \sqrt{F}\right) \]
      3. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{{B}^{2} + \color{blue}{{C}^{2}}}} \cdot \sqrt{F}\right) \]
      4. +-commutative14.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}} \cdot \sqrt{F}\right) \]
      5. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}} \cdot \sqrt{F}\right) \]
      6. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}} \cdot \sqrt{F}\right) \]
      7. hypot-define30.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\mathsf{hypot}\left(C, B\right)}} \cdot \sqrt{F}\right) \]
    9. Simplified30.4%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right)} \]
  3. Recombined 3 regimes into one program.
  4. Final simplification27.6%

    \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 10^{-279}:\\ \;\;\;\;\frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(2 \cdot C\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 10^{-125}:\\ \;\;\;\;\frac{\sqrt{\left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right) \cdot \left(2 \cdot \left(F \cdot \mathsf{fma}\left(B, B, C \cdot \left(A \cdot -4\right)\right)\right)\right)}}{\left(4 \cdot A\right) \cdot C - {B}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \left(-\sqrt{F}\right)\right)\\ \end{array} \]
  5. Add Preprocessing

Alternative 2: 58.6% accurate, 0.4× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ t_1 := \left(4 \cdot A\right) \cdot C\\ t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\ \mathbf{if}\;t\_2 \leq -1 \cdot 10^{-177}:\\ \;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;\frac{\sqrt{F \cdot t\_0} \cdot \sqrt{2 \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\ \end{array} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (fma B_m B_m (* A (* C -4.0))))
        (t_1 (* (* 4.0 A) C))
        (t_2
         (/
          (sqrt
           (*
            (* 2.0 (* (- (pow B_m 2.0) t_1) F))
            (+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
          (- t_1 (pow B_m 2.0)))))
   (if (<= t_2 -1e-177)
     (*
      (sqrt
       (*
        F
        (/ (+ A (+ C (hypot B_m (- A C)))) (fma -4.0 (* A C) (pow B_m 2.0)))))
      (- (sqrt 2.0)))
     (if (<= t_2 INFINITY)
       (/
        (*
         (sqrt (* F t_0))
         (sqrt (* 2.0 (+ (* -0.5 (/ (pow B_m 2.0) A)) (* 2.0 C)))))
        (- t_0))
       (* (/ (sqrt 2.0) B_m) (* (sqrt (+ C (hypot C B_m))) (- (sqrt F))))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
	double t_1 = (4.0 * A) * C;
	double t_2 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_1) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_1 - pow(B_m, 2.0));
	double tmp;
	if (t_2 <= -1e-177) {
		tmp = sqrt((F * ((A + (C + hypot(B_m, (A - C)))) / fma(-4.0, (A * C), pow(B_m, 2.0))))) * -sqrt(2.0);
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = (sqrt((F * t_0)) * sqrt((2.0 * ((-0.5 * (pow(B_m, 2.0) / A)) + (2.0 * C))))) / -t_0;
	} else {
		tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(C, B_m))) * -sqrt(F));
	}
	return tmp;
}
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0)))
	t_1 = Float64(Float64(4.0 * A) * C)
	t_2 = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_1) * F)) * Float64(Float64(A + C) + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64(t_1 - (B_m ^ 2.0)))
	tmp = 0.0
	if (t_2 <= -1e-177)
		tmp = Float64(sqrt(Float64(F * Float64(Float64(A + Float64(C + hypot(B_m, Float64(A - C)))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0))))) * Float64(-sqrt(2.0)));
	elseif (t_2 <= Inf)
		tmp = Float64(Float64(sqrt(Float64(F * t_0)) * sqrt(Float64(2.0 * Float64(Float64(-0.5 * Float64((B_m ^ 2.0) / A)) + Float64(2.0 * C))))) / Float64(-t_0));
	else
		tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(C, B_m))) * Float64(-sqrt(F))));
	end
	return tmp
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e-177], N[(N[Sqrt[N[(F * N[(N[(A + N[(C + N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / A), $MachinePrecision]), $MachinePrecision] + N[(2.0 * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
t_1 := \left(4 \cdot A\right) \cdot C\\
t_2 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_1\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_1 - {B\_m}^{2}}\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{-177}:\\
\;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B\_m, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\

\mathbf{elif}\;t\_2 \leq \infty:\\
\;\;\;\;\frac{\sqrt{F \cdot t\_0} \cdot \sqrt{2 \cdot \left(-0.5 \cdot \frac{{B\_m}^{2}}{A} + 2 \cdot C\right)}}{-t\_0}\\

\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -9.99999999999999952e-178

    1. Initial program 39.1%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in F around 0 46.9%

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F \cdot \left(A + \left(C + \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)\right)}{{B}^{2} - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg46.9%

        \[\leadsto \color{blue}{-\sqrt{\frac{F \cdot \left(A + \left(C + \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)\right)}{{B}^{2} - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}} \]
    5. Simplified74.5%

      \[\leadsto \color{blue}{-\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B}^{2}\right)}} \cdot \sqrt{2}} \]

    if -9.99999999999999952e-178 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0

    1. Initial program 18.4%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Simplified26.4%

      \[\leadsto \color{blue}{\frac{\sqrt{\left(\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot F\right) \cdot \left(2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}} \]
    3. Add Preprocessing
    4. Step-by-step derivation
      1. sqrt-prod31.0%

        \[\leadsto \frac{\color{blue}{\sqrt{\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot F} \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      2. *-commutative31.0%

        \[\leadsto \frac{\sqrt{\color{blue}{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}} \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      3. hypot-undefine26.0%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \color{blue}{\sqrt{B \cdot B + \left(A - C\right) \cdot \left(A - C\right)}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      4. unpow226.0%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\color{blue}{{B}^{2}} + \left(A - C\right) \cdot \left(A - C\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      5. unpow226.0%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{{B}^{2} + \color{blue}{{\left(A - C\right)}^{2}}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      6. +-commutative26.0%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\color{blue}{{\left(A - C\right)}^{2} + {B}^{2}}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      7. unpow226.0%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\color{blue}{\left(A - C\right) \cdot \left(A - C\right)} + {B}^{2}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      8. unpow226.0%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\left(A - C\right) \cdot \left(A - C\right) + \color{blue}{B \cdot B}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      9. hypot-define31.0%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \color{blue}{\mathsf{hypot}\left(A - C, B\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
    5. Applied egg-rr31.0%

      \[\leadsto \frac{\color{blue}{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(A - C, B\right)\right)\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
    6. Taylor expanded in A around -inf 23.7%

      \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

    if +inf.0 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (+.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)))

    1. Initial program 0.0%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around 0 1.6%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg1.6%

        \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]
      2. unpow21.6%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{\color{blue}{B \cdot B} + {C}^{2}}\right)} \]
      3. unpow21.6%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{B \cdot B + \color{blue}{C \cdot C}}\right)} \]
      4. hypot-define12.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \color{blue}{\mathsf{hypot}\left(B, C\right)}\right)} \]
    5. Simplified12.5%

      \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}} \]
    6. Step-by-step derivation
      1. pow1/212.6%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{{\left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}^{0.5}} \]
      2. *-commutative12.6%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot {\color{blue}{\left(\left(C + \mathsf{hypot}\left(B, C\right)\right) \cdot F\right)}}^{0.5} \]
      3. unpow-prod-down23.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left({\left(C + \mathsf{hypot}\left(B, C\right)\right)}^{0.5} \cdot {F}^{0.5}\right)} \]
      4. pow1/223.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\color{blue}{\sqrt{C + \mathsf{hypot}\left(B, C\right)}} \cdot {F}^{0.5}\right) \]
      5. pow1/223.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \color{blue}{\sqrt{F}}\right) \]
    7. Applied egg-rr23.1%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \sqrt{F}\right)} \]
    8. Step-by-step derivation
      1. hypot-undefine1.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\sqrt{B \cdot B + C \cdot C}}} \cdot \sqrt{F}\right) \]
      2. unpow21.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{B}^{2}} + C \cdot C}} \cdot \sqrt{F}\right) \]
      3. unpow21.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{{B}^{2} + \color{blue}{{C}^{2}}}} \cdot \sqrt{F}\right) \]
      4. +-commutative1.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}} \cdot \sqrt{F}\right) \]
      5. unpow21.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}} \cdot \sqrt{F}\right) \]
      6. unpow21.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}} \cdot \sqrt{F}\right) \]
      7. hypot-define23.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\mathsf{hypot}\left(C, B\right)}} \cdot \sqrt{F}\right) \]
    9. Simplified23.1%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right)} \]
  3. Recombined 3 regimes into one program.
  4. Final simplification40.5%

    \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{\left(4 \cdot A\right) \cdot C - {B}^{2}} \leq -1 \cdot 10^{-177}:\\ \;\;\;\;\sqrt{F \cdot \frac{A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)}{\mathsf{fma}\left(-4, A \cdot C, {B}^{2}\right)}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;\frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B}^{2} + {\left(A - C\right)}^{2}}\right)}}{\left(4 \cdot A\right) \cdot C - {B}^{2}} \leq \infty:\\ \;\;\;\;\frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \left(-\sqrt{F}\right)\right)\\ \end{array} \]
  5. Add Preprocessing

Alternative 3: 55.7% accurate, 1.0× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \left(4 \cdot A\right) \cdot C\\ t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 10^{-279}:\\ \;\;\;\;\frac{\sqrt{F \cdot t\_1} \cdot \sqrt{2 \cdot \left(2 \cdot C\right)}}{-t\_1}\\ \mathbf{elif}\;{B\_m}^{2} \leq 10^{-125}:\\ \;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\ \end{array} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (* (* 4.0 A) C)) (t_1 (fma B_m B_m (* A (* C -4.0)))))
   (if (<= (pow B_m 2.0) 1e-279)
     (/ (* (sqrt (* F t_1)) (sqrt (* 2.0 (* 2.0 C)))) (- t_1))
     (if (<= (pow B_m 2.0) 1e-125)
       (/
        (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
        (- t_0 (pow B_m 2.0)))
       (* (/ (sqrt 2.0) B_m) (* (sqrt (+ C (hypot C B_m))) (- (sqrt F))))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = (4.0 * A) * C;
	double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
	double tmp;
	if (pow(B_m, 2.0) <= 1e-279) {
		tmp = (sqrt((F * t_1)) * sqrt((2.0 * (2.0 * C)))) / -t_1;
	} else if (pow(B_m, 2.0) <= 1e-125) {
		tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
	} else {
		tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(C, B_m))) * -sqrt(F));
	}
	return tmp;
}
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64(Float64(4.0 * A) * C)
	t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0)))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-279)
		tmp = Float64(Float64(sqrt(Float64(F * t_1)) * sqrt(Float64(2.0 * Float64(2.0 * C)))) / Float64(-t_1));
	elseif ((B_m ^ 2.0) <= 1e-125)
		tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0)));
	else
		tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(C, B_m))) * Float64(-sqrt(F))));
	end
	return tmp
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-279], N[(N[(N[Sqrt[N[(F * t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-125], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-279}:\\
\;\;\;\;\frac{\sqrt{F \cdot t\_1} \cdot \sqrt{2 \cdot \left(2 \cdot C\right)}}{-t\_1}\\

\mathbf{elif}\;{B\_m}^{2} \leq 10^{-125}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\

\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000006e-279

    1. Initial program 16.9%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Simplified28.4%

      \[\leadsto \color{blue}{\frac{\sqrt{\left(\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot F\right) \cdot \left(2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}} \]
    3. Add Preprocessing
    4. Step-by-step derivation
      1. sqrt-prod37.1%

        \[\leadsto \frac{\color{blue}{\sqrt{\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right) \cdot F} \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      2. *-commutative37.1%

        \[\leadsto \frac{\sqrt{\color{blue}{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}} \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      3. hypot-undefine22.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \color{blue}{\sqrt{B \cdot B + \left(A - C\right) \cdot \left(A - C\right)}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      4. unpow222.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\color{blue}{{B}^{2}} + \left(A - C\right) \cdot \left(A - C\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      5. unpow222.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{{B}^{2} + \color{blue}{{\left(A - C\right)}^{2}}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      6. +-commutative22.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\color{blue}{{\left(A - C\right)}^{2} + {B}^{2}}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      7. unpow222.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\color{blue}{\left(A - C\right) \cdot \left(A - C\right)} + {B}^{2}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      8. unpow222.2%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \sqrt{\left(A - C\right) \cdot \left(A - C\right) + \color{blue}{B \cdot B}}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
      9. hypot-define37.1%

        \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \color{blue}{\mathsf{hypot}\left(A - C, B\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
    5. Applied egg-rr37.1%

      \[\leadsto \frac{\color{blue}{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(A + \left(C + \mathsf{hypot}\left(A - C, B\right)\right)\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
    6. Taylor expanded in A around -inf 22.3%

      \[\leadsto \frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \color{blue}{\left(2 \cdot C\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

    if 1.00000000000000006e-279 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000001e-125

    1. Initial program 12.8%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around -inf 25.5%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \color{blue}{\left(2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

    if 1.00000000000000001e-125 < (pow.f64 B #s(literal 2 binary64))

    1. Initial program 18.3%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around 0 11.3%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg11.3%

        \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]
      2. unpow211.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{\color{blue}{B \cdot B} + {C}^{2}}\right)} \]
      3. unpow211.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{B \cdot B + \color{blue}{C \cdot C}}\right)} \]
      4. hypot-define19.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \color{blue}{\mathsf{hypot}\left(B, C\right)}\right)} \]
    5. Simplified19.0%

      \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}} \]
    6. Step-by-step derivation
      1. pow1/219.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{{\left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}^{0.5}} \]
      2. *-commutative19.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot {\color{blue}{\left(\left(C + \mathsf{hypot}\left(B, C\right)\right) \cdot F\right)}}^{0.5} \]
      3. unpow-prod-down30.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left({\left(C + \mathsf{hypot}\left(B, C\right)\right)}^{0.5} \cdot {F}^{0.5}\right)} \]
      4. pow1/230.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\color{blue}{\sqrt{C + \mathsf{hypot}\left(B, C\right)}} \cdot {F}^{0.5}\right) \]
      5. pow1/230.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \color{blue}{\sqrt{F}}\right) \]
    7. Applied egg-rr30.4%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \sqrt{F}\right)} \]
    8. Step-by-step derivation
      1. hypot-undefine14.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\sqrt{B \cdot B + C \cdot C}}} \cdot \sqrt{F}\right) \]
      2. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{B}^{2}} + C \cdot C}} \cdot \sqrt{F}\right) \]
      3. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{{B}^{2} + \color{blue}{{C}^{2}}}} \cdot \sqrt{F}\right) \]
      4. +-commutative14.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}} \cdot \sqrt{F}\right) \]
      5. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}} \cdot \sqrt{F}\right) \]
      6. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}} \cdot \sqrt{F}\right) \]
      7. hypot-define30.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\mathsf{hypot}\left(C, B\right)}} \cdot \sqrt{F}\right) \]
    9. Simplified30.4%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right)} \]
  3. Recombined 3 regimes into one program.
  4. Final simplification27.6%

    \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 10^{-279}:\\ \;\;\;\;\frac{\sqrt{F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \cdot \sqrt{2 \cdot \left(2 \cdot C\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 10^{-125}:\\ \;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{\left(4 \cdot A\right) \cdot C - {B}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \left(-\sqrt{F}\right)\right)\\ \end{array} \]
  5. Add Preprocessing

Alternative 4: 49.2% accurate, 1.2× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \frac{B\_m}{\sqrt{2}}\\ \mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-119}:\\ \;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+211}:\\ \;\;\;\;\frac{-1}{t\_0 \cdot \sqrt{\frac{\frac{1}{F}}{C + \mathsf{hypot}\left(C, B\_m\right)}}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{B\_m + C}\right) \cdot \frac{-1}{t\_0}\\ \end{array} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (/ B_m (sqrt 2.0))))
   (if (<= (pow B_m 2.0) 2e-119)
     (* (sqrt (* -0.5 (/ F A))) (- (sqrt 2.0)))
     (if (<= (pow B_m 2.0) 5e+211)
       (/ -1.0 (* t_0 (sqrt (/ (/ 1.0 F) (+ C (hypot C B_m))))))
       (* (* (sqrt F) (sqrt (+ B_m C))) (/ -1.0 t_0))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = B_m / sqrt(2.0);
	double tmp;
	if (pow(B_m, 2.0) <= 2e-119) {
		tmp = sqrt((-0.5 * (F / A))) * -sqrt(2.0);
	} else if (pow(B_m, 2.0) <= 5e+211) {
		tmp = -1.0 / (t_0 * sqrt(((1.0 / F) / (C + hypot(C, B_m)))));
	} else {
		tmp = (sqrt(F) * sqrt((B_m + C))) * (-1.0 / t_0);
	}
	return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double t_0 = B_m / Math.sqrt(2.0);
	double tmp;
	if (Math.pow(B_m, 2.0) <= 2e-119) {
		tmp = Math.sqrt((-0.5 * (F / A))) * -Math.sqrt(2.0);
	} else if (Math.pow(B_m, 2.0) <= 5e+211) {
		tmp = -1.0 / (t_0 * Math.sqrt(((1.0 / F) / (C + Math.hypot(C, B_m)))));
	} else {
		tmp = (Math.sqrt(F) * Math.sqrt((B_m + C))) * (-1.0 / t_0);
	}
	return tmp;
}
B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	t_0 = B_m / math.sqrt(2.0)
	tmp = 0
	if math.pow(B_m, 2.0) <= 2e-119:
		tmp = math.sqrt((-0.5 * (F / A))) * -math.sqrt(2.0)
	elif math.pow(B_m, 2.0) <= 5e+211:
		tmp = -1.0 / (t_0 * math.sqrt(((1.0 / F) / (C + math.hypot(C, B_m)))))
	else:
		tmp = (math.sqrt(F) * math.sqrt((B_m + C))) * (-1.0 / t_0)
	return tmp
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64(B_m / sqrt(2.0))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 2e-119)
		tmp = Float64(sqrt(Float64(-0.5 * Float64(F / A))) * Float64(-sqrt(2.0)));
	elseif ((B_m ^ 2.0) <= 5e+211)
		tmp = Float64(-1.0 / Float64(t_0 * sqrt(Float64(Float64(1.0 / F) / Float64(C + hypot(C, B_m))))));
	else
		tmp = Float64(Float64(sqrt(F) * sqrt(Float64(B_m + C))) * Float64(-1.0 / t_0));
	end
	return tmp
end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	t_0 = B_m / sqrt(2.0);
	tmp = 0.0;
	if ((B_m ^ 2.0) <= 2e-119)
		tmp = sqrt((-0.5 * (F / A))) * -sqrt(2.0);
	elseif ((B_m ^ 2.0) <= 5e+211)
		tmp = -1.0 / (t_0 * sqrt(((1.0 / F) / (C + hypot(C, B_m)))));
	else
		tmp = (sqrt(F) * sqrt((B_m + C))) * (-1.0 / t_0);
	end
	tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-119], N[(N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+211], N[(-1.0 / N[(t$95$0 * N[Sqrt[N[(N[(1.0 / F), $MachinePrecision] / N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / t$95$0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \frac{B\_m}{\sqrt{2}}\\
\mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-119}:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\

\mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+211}:\\
\;\;\;\;\frac{-1}{t\_0 \cdot \sqrt{\frac{\frac{1}{F}}{C + \mathsf{hypot}\left(C, B\_m\right)}}}\\

\mathbf{else}:\\
\;\;\;\;\left(\sqrt{F} \cdot \sqrt{B\_m + C}\right) \cdot \frac{-1}{t\_0}\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000003e-119

    1. Initial program 15.6%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around -inf 17.2%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    4. Taylor expanded in F around 0 16.2%

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}{{B}^{2} - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)} \]
    5. Taylor expanded in B around 0 22.1%

      \[\leadsto -1 \cdot \left(\sqrt{\color{blue}{-0.5 \cdot \frac{F}{A}}} \cdot \sqrt{2}\right) \]

    if 2.00000000000000003e-119 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999995e211

    1. Initial program 42.4%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around 0 20.4%

      \[\leadsto \frac{-\color{blue}{\left(B \cdot \sqrt{2}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    4. Step-by-step derivation
      1. associate-*l*20.3%

        \[\leadsto \frac{-\color{blue}{B \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
      2. unpow220.3%

        \[\leadsto \frac{-B \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{\color{blue}{B \cdot B} + {C}^{2}}\right)}\right)}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
      3. unpow220.3%

        \[\leadsto \frac{-B \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \sqrt{B \cdot B + \color{blue}{C \cdot C}}\right)}\right)}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
      4. hypot-define20.9%

        \[\leadsto \frac{-B \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \color{blue}{\mathsf{hypot}\left(B, C\right)}\right)}\right)}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    5. Simplified20.9%

      \[\leadsto \frac{-\color{blue}{B \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    6. Step-by-step derivation
      1. clear-num20.9%

        \[\leadsto \color{blue}{\frac{1}{\frac{{B}^{2} - \left(4 \cdot A\right) \cdot C}{-B \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}\right)}}} \]
      2. inv-pow20.9%

        \[\leadsto \color{blue}{{\left(\frac{{B}^{2} - \left(4 \cdot A\right) \cdot C}{-B \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}\right)}\right)}^{-1}} \]
      3. *-commutative20.9%

        \[\leadsto {\left(\frac{{B}^{2} - \color{blue}{C \cdot \left(4 \cdot A\right)}}{-B \cdot \left(\sqrt{2} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}\right)}\right)}^{-1} \]
      4. distribute-rgt-neg-in20.9%

        \[\leadsto {\left(\frac{{B}^{2} - C \cdot \left(4 \cdot A\right)}{\color{blue}{B \cdot \left(-\sqrt{2} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}\right)}}\right)}^{-1} \]
      5. sqrt-unprod21.0%

        \[\leadsto {\left(\frac{{B}^{2} - C \cdot \left(4 \cdot A\right)}{B \cdot \left(-\color{blue}{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}}\right)}\right)}^{-1} \]
    7. Applied egg-rr21.0%

      \[\leadsto \color{blue}{{\left(\frac{{B}^{2} - C \cdot \left(4 \cdot A\right)}{B \cdot \left(-\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}\right)}\right)}^{-1}} \]
    8. Step-by-step derivation
      1. unpow-121.0%

        \[\leadsto \color{blue}{\frac{1}{\frac{{B}^{2} - C \cdot \left(4 \cdot A\right)}{B \cdot \left(-\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}\right)}}} \]
      2. unpow221.0%

        \[\leadsto \frac{1}{\frac{\color{blue}{B \cdot B} - C \cdot \left(4 \cdot A\right)}{B \cdot \left(-\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}\right)}} \]
      3. fma-neg21.0%

        \[\leadsto \frac{1}{\frac{\color{blue}{\mathsf{fma}\left(B, B, -C \cdot \left(4 \cdot A\right)\right)}}{B \cdot \left(-\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}\right)}} \]
      4. distribute-rgt-neg-in21.0%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, \color{blue}{C \cdot \left(-4 \cdot A\right)}\right)}{B \cdot \left(-\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}\right)}} \]
      5. distribute-lft-neg-in21.0%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \color{blue}{\left(\left(-4\right) \cdot A\right)}\right)}{B \cdot \left(-\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}\right)}} \]
      6. metadata-eval21.0%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(\color{blue}{-4} \cdot A\right)\right)}{B \cdot \left(-\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}\right)}} \]
      7. associate-*r*21.0%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)}{B \cdot \left(-\sqrt{\color{blue}{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}}\right)}} \]
      8. hypot-undefine20.3%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)}{B \cdot \left(-\sqrt{\left(2 \cdot F\right) \cdot \left(C + \color{blue}{\sqrt{B \cdot B + C \cdot C}}\right)}\right)}} \]
      9. unpow220.3%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)}{B \cdot \left(-\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{\color{blue}{{B}^{2}} + C \cdot C}\right)}\right)}} \]
      10. unpow220.3%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)}{B \cdot \left(-\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{{B}^{2} + \color{blue}{{C}^{2}}}\right)}\right)}} \]
      11. +-commutative20.3%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)}{B \cdot \left(-\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}\right)}\right)}} \]
      12. unpow220.3%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)}{B \cdot \left(-\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}\right)}\right)}} \]
      13. unpow220.3%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)}{B \cdot \left(-\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}\right)}\right)}} \]
      14. hypot-define21.0%

        \[\leadsto \frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)}{B \cdot \left(-\sqrt{\left(2 \cdot F\right) \cdot \left(C + \color{blue}{\mathsf{hypot}\left(C, B\right)}\right)}\right)}} \]
    9. Simplified21.0%

      \[\leadsto \color{blue}{\frac{1}{\frac{\mathsf{fma}\left(B, B, C \cdot \left(-4 \cdot A\right)\right)}{B \cdot \left(-\sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(C, B\right)\right)}\right)}}} \]
    10. Taylor expanded in A around 0 20.8%

      \[\leadsto \frac{1}{\color{blue}{-1 \cdot \left(\frac{B}{\sqrt{2}} \cdot \sqrt{\frac{1}{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}}\right)}} \]
    11. Step-by-step derivation
      1. mul-1-neg20.8%

        \[\leadsto \frac{1}{\color{blue}{-\frac{B}{\sqrt{2}} \cdot \sqrt{\frac{1}{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}}}} \]
      2. associate-/r*20.8%

        \[\leadsto \frac{1}{-\frac{B}{\sqrt{2}} \cdot \sqrt{\color{blue}{\frac{\frac{1}{F}}{C + \sqrt{{B}^{2} + {C}^{2}}}}}} \]
      3. +-commutative20.8%

        \[\leadsto \frac{1}{-\frac{B}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}}}} \]
      4. unpow220.8%

        \[\leadsto \frac{1}{-\frac{B}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}}}} \]
      5. unpow220.8%

        \[\leadsto \frac{1}{-\frac{B}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}}}} \]
      6. hypot-undefine21.3%

        \[\leadsto \frac{1}{-\frac{B}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \color{blue}{\mathsf{hypot}\left(C, B\right)}}}} \]
    12. Simplified21.3%

      \[\leadsto \frac{1}{\color{blue}{-\frac{B}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \mathsf{hypot}\left(C, B\right)}}}} \]

    if 4.9999999999999995e211 < (pow.f64 B #s(literal 2 binary64))

    1. Initial program 1.8%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around 0 5.0%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg5.0%

        \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]
      2. unpow25.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{\color{blue}{B \cdot B} + {C}^{2}}\right)} \]
      3. unpow25.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{B \cdot B + \color{blue}{C \cdot C}}\right)} \]
      4. hypot-define17.8%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \color{blue}{\mathsf{hypot}\left(B, C\right)}\right)} \]
    5. Simplified17.8%

      \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}} \]
    6. Step-by-step derivation
      1. pow1/217.8%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{{\left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}^{0.5}} \]
      2. *-commutative17.8%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot {\color{blue}{\left(\left(C + \mathsf{hypot}\left(B, C\right)\right) \cdot F\right)}}^{0.5} \]
      3. unpow-prod-down36.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left({\left(C + \mathsf{hypot}\left(B, C\right)\right)}^{0.5} \cdot {F}^{0.5}\right)} \]
      4. pow1/236.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\color{blue}{\sqrt{C + \mathsf{hypot}\left(B, C\right)}} \cdot {F}^{0.5}\right) \]
      5. pow1/236.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \color{blue}{\sqrt{F}}\right) \]
    7. Applied egg-rr36.0%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \sqrt{F}\right)} \]
    8. Step-by-step derivation
      1. hypot-undefine9.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\sqrt{B \cdot B + C \cdot C}}} \cdot \sqrt{F}\right) \]
      2. unpow29.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{B}^{2}} + C \cdot C}} \cdot \sqrt{F}\right) \]
      3. unpow29.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{{B}^{2} + \color{blue}{{C}^{2}}}} \cdot \sqrt{F}\right) \]
      4. +-commutative9.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}} \cdot \sqrt{F}\right) \]
      5. unpow29.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}} \cdot \sqrt{F}\right) \]
      6. unpow29.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}} \cdot \sqrt{F}\right) \]
      7. hypot-define36.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\mathsf{hypot}\left(C, B\right)}} \cdot \sqrt{F}\right) \]
    9. Simplified36.0%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right)} \]
    10. Step-by-step derivation
      1. clear-num36.1%

        \[\leadsto -\color{blue}{\frac{1}{\frac{B}{\sqrt{2}}}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
      2. inv-pow36.1%

        \[\leadsto -\color{blue}{{\left(\frac{B}{\sqrt{2}}\right)}^{-1}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    11. Applied egg-rr36.1%

      \[\leadsto -\color{blue}{{\left(\frac{B}{\sqrt{2}}\right)}^{-1}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    12. Step-by-step derivation
      1. unpow-136.1%

        \[\leadsto -\color{blue}{\frac{1}{\frac{B}{\sqrt{2}}}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    13. Simplified36.1%

      \[\leadsto -\color{blue}{\frac{1}{\frac{B}{\sqrt{2}}}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    14. Taylor expanded in C around 0 32.6%

      \[\leadsto -\frac{1}{\frac{B}{\sqrt{2}}} \cdot \left(\sqrt{\color{blue}{B + C}} \cdot \sqrt{F}\right) \]
  3. Recombined 3 regimes into one program.
  4. Final simplification25.6%

    \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 2 \cdot 10^{-119}:\\ \;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;{B}^{2} \leq 5 \cdot 10^{+211}:\\ \;\;\;\;\frac{-1}{\frac{B}{\sqrt{2}} \cdot \sqrt{\frac{\frac{1}{F}}{C + \mathsf{hypot}\left(C, B\right)}}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{B + C}\right) \cdot \frac{-1}{\frac{B}{\sqrt{2}}}\\ \end{array} \]
  5. Add Preprocessing

Alternative 5: 55.8% accurate, 1.2× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \left(4 \cdot A\right) \cdot C\\ \mathbf{if}\;{B\_m}^{2} \leq 10^{-125}:\\ \;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\ \end{array} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (* (* 4.0 A) C)))
   (if (<= (pow B_m 2.0) 1e-125)
     (/
      (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
      (- t_0 (pow B_m 2.0)))
     (* (/ (sqrt 2.0) B_m) (* (sqrt (+ C (hypot C B_m))) (- (sqrt F)))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = (4.0 * A) * C;
	double tmp;
	if (pow(B_m, 2.0) <= 1e-125) {
		tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
	} else {
		tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(C, B_m))) * -sqrt(F));
	}
	return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double t_0 = (4.0 * A) * C;
	double tmp;
	if (Math.pow(B_m, 2.0) <= 1e-125) {
		tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
	} else {
		tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt((C + Math.hypot(C, B_m))) * -Math.sqrt(F));
	}
	return tmp;
}
B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	t_0 = (4.0 * A) * C
	tmp = 0
	if math.pow(B_m, 2.0) <= 1e-125:
		tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0))
	else:
		tmp = (math.sqrt(2.0) / B_m) * (math.sqrt((C + math.hypot(C, B_m))) * -math.sqrt(F))
	return tmp
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64(Float64(4.0 * A) * C)
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-125)
		tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0)));
	else
		tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(Float64(C + hypot(C, B_m))) * Float64(-sqrt(F))));
	end
	return tmp
end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	t_0 = (4.0 * A) * C;
	tmp = 0.0;
	if ((B_m ^ 2.0) <= 1e-125)
		tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
	else
		tmp = (sqrt(2.0) / B_m) * (sqrt((C + hypot(C, B_m))) * -sqrt(F));
	end
	tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-125], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 10^{-125}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\

\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2}}{B\_m} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \left(-\sqrt{F}\right)\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000001e-125

    1. Initial program 15.8%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around -inf 17.4%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \color{blue}{\left(2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

    if 1.00000000000000001e-125 < (pow.f64 B #s(literal 2 binary64))

    1. Initial program 18.3%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around 0 11.3%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg11.3%

        \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]
      2. unpow211.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{\color{blue}{B \cdot B} + {C}^{2}}\right)} \]
      3. unpow211.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{B \cdot B + \color{blue}{C \cdot C}}\right)} \]
      4. hypot-define19.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \color{blue}{\mathsf{hypot}\left(B, C\right)}\right)} \]
    5. Simplified19.0%

      \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}} \]
    6. Step-by-step derivation
      1. pow1/219.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{{\left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}^{0.5}} \]
      2. *-commutative19.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot {\color{blue}{\left(\left(C + \mathsf{hypot}\left(B, C\right)\right) \cdot F\right)}}^{0.5} \]
      3. unpow-prod-down30.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left({\left(C + \mathsf{hypot}\left(B, C\right)\right)}^{0.5} \cdot {F}^{0.5}\right)} \]
      4. pow1/230.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\color{blue}{\sqrt{C + \mathsf{hypot}\left(B, C\right)}} \cdot {F}^{0.5}\right) \]
      5. pow1/230.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \color{blue}{\sqrt{F}}\right) \]
    7. Applied egg-rr30.4%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \sqrt{F}\right)} \]
    8. Step-by-step derivation
      1. hypot-undefine14.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\sqrt{B \cdot B + C \cdot C}}} \cdot \sqrt{F}\right) \]
      2. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{B}^{2}} + C \cdot C}} \cdot \sqrt{F}\right) \]
      3. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{{B}^{2} + \color{blue}{{C}^{2}}}} \cdot \sqrt{F}\right) \]
      4. +-commutative14.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}} \cdot \sqrt{F}\right) \]
      5. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}} \cdot \sqrt{F}\right) \]
      6. unpow214.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}} \cdot \sqrt{F}\right) \]
      7. hypot-define30.4%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\mathsf{hypot}\left(C, B\right)}} \cdot \sqrt{F}\right) \]
    9. Simplified30.4%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right)} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification25.3%

    \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 10^{-125}:\\ \;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{\left(4 \cdot A\right) \cdot C - {B}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \left(-\sqrt{F}\right)\right)\\ \end{array} \]
  5. Add Preprocessing

Alternative 6: 50.7% accurate, 1.5× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \left(4 \cdot A\right) \cdot C\\ \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-102}:\\ \;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{B\_m + C}\right) \cdot \frac{-1}{\frac{B\_m}{\sqrt{2}}}\\ \end{array} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (* (* 4.0 A) C)))
   (if (<= (pow B_m 2.0) 5e-102)
     (/
      (sqrt (* (* 2.0 (* (- (pow B_m 2.0) t_0) F)) (* 2.0 C)))
      (- t_0 (pow B_m 2.0)))
     (* (* (sqrt F) (sqrt (+ B_m C))) (/ -1.0 (/ B_m (sqrt 2.0)))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = (4.0 * A) * C;
	double tmp;
	if (pow(B_m, 2.0) <= 5e-102) {
		tmp = sqrt(((2.0 * ((pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - pow(B_m, 2.0));
	} else {
		tmp = (sqrt(F) * sqrt((B_m + C))) * (-1.0 / (B_m / sqrt(2.0)));
	}
	return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (4.0d0 * a) * c
    if ((b_m ** 2.0d0) <= 5d-102) then
        tmp = sqrt(((2.0d0 * (((b_m ** 2.0d0) - t_0) * f)) * (2.0d0 * c))) / (t_0 - (b_m ** 2.0d0))
    else
        tmp = (sqrt(f) * sqrt((b_m + c))) * ((-1.0d0) / (b_m / sqrt(2.0d0)))
    end if
    code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double t_0 = (4.0 * A) * C;
	double tmp;
	if (Math.pow(B_m, 2.0) <= 5e-102) {
		tmp = Math.sqrt(((2.0 * ((Math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - Math.pow(B_m, 2.0));
	} else {
		tmp = (Math.sqrt(F) * Math.sqrt((B_m + C))) * (-1.0 / (B_m / Math.sqrt(2.0)));
	}
	return tmp;
}
B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	t_0 = (4.0 * A) * C
	tmp = 0
	if math.pow(B_m, 2.0) <= 5e-102:
		tmp = math.sqrt(((2.0 * ((math.pow(B_m, 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - math.pow(B_m, 2.0))
	else:
		tmp = (math.sqrt(F) * math.sqrt((B_m + C))) * (-1.0 / (B_m / math.sqrt(2.0)))
	return tmp
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64(Float64(4.0 * A) * C)
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-102)
		tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(Float64((B_m ^ 2.0) - t_0) * F)) * Float64(2.0 * C))) / Float64(t_0 - (B_m ^ 2.0)));
	else
		tmp = Float64(Float64(sqrt(F) * sqrt(Float64(B_m + C))) * Float64(-1.0 / Float64(B_m / sqrt(2.0))));
	end
	return tmp
end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	t_0 = (4.0 * A) * C;
	tmp = 0.0;
	if ((B_m ^ 2.0) <= 5e-102)
		tmp = sqrt(((2.0 * (((B_m ^ 2.0) - t_0) * F)) * (2.0 * C))) / (t_0 - (B_m ^ 2.0));
	else
		tmp = (sqrt(F) * sqrt((B_m + C))) * (-1.0 / (B_m / sqrt(2.0)));
	end
	tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-102], N[(N[Sqrt[N[(N[(2.0 * N[(N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision] * N[(2.0 * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
t_0 := \left(4 \cdot A\right) \cdot C\\
\mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-102}:\\
\;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0 - {B\_m}^{2}}\\

\mathbf{else}:\\
\;\;\;\;\left(\sqrt{F} \cdot \sqrt{B\_m + C}\right) \cdot \frac{-1}{\frac{B\_m}{\sqrt{2}}}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000026e-102

    1. Initial program 16.0%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around -inf 17.5%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \color{blue}{\left(2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

    if 5.00000000000000026e-102 < (pow.f64 B #s(literal 2 binary64))

    1. Initial program 18.2%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around 0 11.0%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg11.0%

        \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]
      2. unpow211.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{\color{blue}{B \cdot B} + {C}^{2}}\right)} \]
      3. unpow211.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{B \cdot B + \color{blue}{C \cdot C}}\right)} \]
      4. hypot-define18.9%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \color{blue}{\mathsf{hypot}\left(B, C\right)}\right)} \]
    5. Simplified18.9%

      \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}} \]
    6. Step-by-step derivation
      1. pow1/219.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{{\left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}^{0.5}} \]
      2. *-commutative19.0%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot {\color{blue}{\left(\left(C + \mathsf{hypot}\left(B, C\right)\right) \cdot F\right)}}^{0.5} \]
      3. unpow-prod-down30.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left({\left(C + \mathsf{hypot}\left(B, C\right)\right)}^{0.5} \cdot {F}^{0.5}\right)} \]
      4. pow1/230.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\color{blue}{\sqrt{C + \mathsf{hypot}\left(B, C\right)}} \cdot {F}^{0.5}\right) \]
      5. pow1/230.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \color{blue}{\sqrt{F}}\right) \]
    7. Applied egg-rr30.7%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \sqrt{F}\right)} \]
    8. Step-by-step derivation
      1. hypot-undefine14.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\sqrt{B \cdot B + C \cdot C}}} \cdot \sqrt{F}\right) \]
      2. unpow214.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{B}^{2}} + C \cdot C}} \cdot \sqrt{F}\right) \]
      3. unpow214.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{{B}^{2} + \color{blue}{{C}^{2}}}} \cdot \sqrt{F}\right) \]
      4. +-commutative14.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}} \cdot \sqrt{F}\right) \]
      5. unpow214.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}} \cdot \sqrt{F}\right) \]
      6. unpow214.2%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}} \cdot \sqrt{F}\right) \]
      7. hypot-define30.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\mathsf{hypot}\left(C, B\right)}} \cdot \sqrt{F}\right) \]
    9. Simplified30.7%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right)} \]
    10. Step-by-step derivation
      1. clear-num30.7%

        \[\leadsto -\color{blue}{\frac{1}{\frac{B}{\sqrt{2}}}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
      2. inv-pow30.7%

        \[\leadsto -\color{blue}{{\left(\frac{B}{\sqrt{2}}\right)}^{-1}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    11. Applied egg-rr30.7%

      \[\leadsto -\color{blue}{{\left(\frac{B}{\sqrt{2}}\right)}^{-1}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    12. Step-by-step derivation
      1. unpow-130.7%

        \[\leadsto -\color{blue}{\frac{1}{\frac{B}{\sqrt{2}}}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    13. Simplified30.7%

      \[\leadsto -\color{blue}{\frac{1}{\frac{B}{\sqrt{2}}}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    14. Taylor expanded in C around 0 27.0%

      \[\leadsto -\frac{1}{\frac{B}{\sqrt{2}}} \cdot \left(\sqrt{\color{blue}{B + C}} \cdot \sqrt{F}\right) \]
  3. Recombined 2 regimes into one program.
  4. Final simplification23.1%

    \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 5 \cdot 10^{-102}:\\ \;\;\;\;\frac{\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{\left(4 \cdot A\right) \cdot C - {B}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{B + C}\right) \cdot \frac{-1}{\frac{B}{\sqrt{2}}}\\ \end{array} \]
  5. Add Preprocessing

Alternative 7: 47.9% accurate, 2.0× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} \mathbf{if}\;B\_m \leq 9.6 \cdot 10^{-54}:\\ \;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{B\_m + C}\right) \cdot \frac{-1}{\frac{B\_m}{\sqrt{2}}}\\ \end{array} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (if (<= B_m 9.6e-54)
   (* (sqrt (* -0.5 (/ F A))) (- (sqrt 2.0)))
   (* (* (sqrt F) (sqrt (+ B_m C))) (/ -1.0 (/ B_m (sqrt 2.0))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 9.6e-54) {
		tmp = sqrt((-0.5 * (F / A))) * -sqrt(2.0);
	} else {
		tmp = (sqrt(F) * sqrt((B_m + C))) * (-1.0 / (B_m / sqrt(2.0)));
	}
	return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (b_m <= 9.6d-54) then
        tmp = sqrt(((-0.5d0) * (f / a))) * -sqrt(2.0d0)
    else
        tmp = (sqrt(f) * sqrt((b_m + c))) * ((-1.0d0) / (b_m / sqrt(2.0d0)))
    end if
    code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 9.6e-54) {
		tmp = Math.sqrt((-0.5 * (F / A))) * -Math.sqrt(2.0);
	} else {
		tmp = (Math.sqrt(F) * Math.sqrt((B_m + C))) * (-1.0 / (B_m / Math.sqrt(2.0)));
	}
	return tmp;
}
B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	tmp = 0
	if B_m <= 9.6e-54:
		tmp = math.sqrt((-0.5 * (F / A))) * -math.sqrt(2.0)
	else:
		tmp = (math.sqrt(F) * math.sqrt((B_m + C))) * (-1.0 / (B_m / math.sqrt(2.0)))
	return tmp
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if (B_m <= 9.6e-54)
		tmp = Float64(sqrt(Float64(-0.5 * Float64(F / A))) * Float64(-sqrt(2.0)));
	else
		tmp = Float64(Float64(sqrt(F) * sqrt(Float64(B_m + C))) * Float64(-1.0 / Float64(B_m / sqrt(2.0))));
	end
	return tmp
end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	tmp = 0.0;
	if (B_m <= 9.6e-54)
		tmp = sqrt((-0.5 * (F / A))) * -sqrt(2.0);
	else
		tmp = (sqrt(F) * sqrt((B_m + C))) * (-1.0 / (B_m / sqrt(2.0)));
	end
	tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 9.6e-54], N[(N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] * N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(-1.0 / N[(B$95$m / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 9.6 \cdot 10^{-54}:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\

\mathbf{else}:\\
\;\;\;\;\left(\sqrt{F} \cdot \sqrt{B\_m + C}\right) \cdot \frac{-1}{\frac{B\_m}{\sqrt{2}}}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if B < 9.60000000000000053e-54

    1. Initial program 17.0%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around -inf 11.7%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    4. Taylor expanded in F around 0 11.8%

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}{{B}^{2} - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)} \]
    5. Taylor expanded in B around 0 16.2%

      \[\leadsto -1 \cdot \left(\sqrt{\color{blue}{-0.5 \cdot \frac{F}{A}}} \cdot \sqrt{2}\right) \]

    if 9.60000000000000053e-54 < B

    1. Initial program 18.2%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around 0 24.1%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg24.1%

        \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]
      2. unpow224.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{\color{blue}{B \cdot B} + {C}^{2}}\right)} \]
      3. unpow224.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{B \cdot B + \color{blue}{C \cdot C}}\right)} \]
      4. hypot-define41.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \color{blue}{\mathsf{hypot}\left(B, C\right)}\right)} \]
    5. Simplified41.1%

      \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}} \]
    6. Step-by-step derivation
      1. pow1/241.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{{\left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}^{0.5}} \]
      2. *-commutative41.1%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot {\color{blue}{\left(\left(C + \mathsf{hypot}\left(B, C\right)\right) \cdot F\right)}}^{0.5} \]
      3. unpow-prod-down68.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left({\left(C + \mathsf{hypot}\left(B, C\right)\right)}^{0.5} \cdot {F}^{0.5}\right)} \]
      4. pow1/268.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\color{blue}{\sqrt{C + \mathsf{hypot}\left(B, C\right)}} \cdot {F}^{0.5}\right) \]
      5. pow1/268.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \color{blue}{\sqrt{F}}\right) \]
    7. Applied egg-rr68.3%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(B, C\right)} \cdot \sqrt{F}\right)} \]
    8. Step-by-step derivation
      1. hypot-undefine31.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\sqrt{B \cdot B + C \cdot C}}} \cdot \sqrt{F}\right) \]
      2. unpow231.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{B}^{2}} + C \cdot C}} \cdot \sqrt{F}\right) \]
      3. unpow231.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{{B}^{2} + \color{blue}{{C}^{2}}}} \cdot \sqrt{F}\right) \]
      4. +-commutative31.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}} \cdot \sqrt{F}\right) \]
      5. unpow231.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}} \cdot \sqrt{F}\right) \]
      6. unpow231.7%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}} \cdot \sqrt{F}\right) \]
      7. hypot-define68.3%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \left(\sqrt{C + \color{blue}{\mathsf{hypot}\left(C, B\right)}} \cdot \sqrt{F}\right) \]
    9. Simplified68.3%

      \[\leadsto -\frac{\sqrt{2}}{B} \cdot \color{blue}{\left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right)} \]
    10. Step-by-step derivation
      1. clear-num68.4%

        \[\leadsto -\color{blue}{\frac{1}{\frac{B}{\sqrt{2}}}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
      2. inv-pow68.4%

        \[\leadsto -\color{blue}{{\left(\frac{B}{\sqrt{2}}\right)}^{-1}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    11. Applied egg-rr68.4%

      \[\leadsto -\color{blue}{{\left(\frac{B}{\sqrt{2}}\right)}^{-1}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    12. Step-by-step derivation
      1. unpow-168.4%

        \[\leadsto -\color{blue}{\frac{1}{\frac{B}{\sqrt{2}}}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    13. Simplified68.4%

      \[\leadsto -\color{blue}{\frac{1}{\frac{B}{\sqrt{2}}}} \cdot \left(\sqrt{C + \mathsf{hypot}\left(C, B\right)} \cdot \sqrt{F}\right) \]
    14. Taylor expanded in C around 0 63.0%

      \[\leadsto -\frac{1}{\frac{B}{\sqrt{2}}} \cdot \left(\sqrt{\color{blue}{B + C}} \cdot \sqrt{F}\right) \]
  3. Recombined 2 regimes into one program.
  4. Final simplification27.9%

    \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq 9.6 \cdot 10^{-54}:\\ \;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{B + C}\right) \cdot \frac{-1}{\frac{B}{\sqrt{2}}}\\ \end{array} \]
  5. Add Preprocessing

Alternative 8: 48.7% accurate, 2.9× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} \mathbf{if}\;B\_m \leq 2.8 \cdot 10^{-59}:\\ \;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;B\_m \leq 1.4 \cdot 10^{+112}:\\ \;\;\;\;\frac{\sqrt{\left(C + \mathsf{hypot}\left(C, B\_m\right)\right) \cdot \left(2 \cdot F\right)}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\ \end{array} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (if (<= B_m 2.8e-59)
   (* (sqrt (* -0.5 (/ F A))) (- (sqrt 2.0)))
   (if (<= B_m 1.4e+112)
     (/ (sqrt (* (+ C (hypot C B_m)) (* 2.0 F))) (- B_m))
     (/ (sqrt (* 2.0 F)) (- (sqrt B_m))))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 2.8e-59) {
		tmp = sqrt((-0.5 * (F / A))) * -sqrt(2.0);
	} else if (B_m <= 1.4e+112) {
		tmp = sqrt(((C + hypot(C, B_m)) * (2.0 * F))) / -B_m;
	} else {
		tmp = sqrt((2.0 * F)) / -sqrt(B_m);
	}
	return tmp;
}
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 2.8e-59) {
		tmp = Math.sqrt((-0.5 * (F / A))) * -Math.sqrt(2.0);
	} else if (B_m <= 1.4e+112) {
		tmp = Math.sqrt(((C + Math.hypot(C, B_m)) * (2.0 * F))) / -B_m;
	} else {
		tmp = Math.sqrt((2.0 * F)) / -Math.sqrt(B_m);
	}
	return tmp;
}
B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	tmp = 0
	if B_m <= 2.8e-59:
		tmp = math.sqrt((-0.5 * (F / A))) * -math.sqrt(2.0)
	elif B_m <= 1.4e+112:
		tmp = math.sqrt(((C + math.hypot(C, B_m)) * (2.0 * F))) / -B_m
	else:
		tmp = math.sqrt((2.0 * F)) / -math.sqrt(B_m)
	return tmp
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if (B_m <= 2.8e-59)
		tmp = Float64(sqrt(Float64(-0.5 * Float64(F / A))) * Float64(-sqrt(2.0)));
	elseif (B_m <= 1.4e+112)
		tmp = Float64(sqrt(Float64(Float64(C + hypot(C, B_m)) * Float64(2.0 * F))) / Float64(-B_m));
	else
		tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m)));
	end
	return tmp
end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	tmp = 0.0;
	if (B_m <= 2.8e-59)
		tmp = sqrt((-0.5 * (F / A))) * -sqrt(2.0);
	elseif (B_m <= 1.4e+112)
		tmp = sqrt(((C + hypot(C, B_m)) * (2.0 * F))) / -B_m;
	else
		tmp = sqrt((2.0 * F)) / -sqrt(B_m);
	end
	tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 2.8e-59], N[(N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[B$95$m, 1.4e+112], N[(N[Sqrt[N[(N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 2.8 \cdot 10^{-59}:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\

\mathbf{elif}\;B\_m \leq 1.4 \cdot 10^{+112}:\\
\;\;\;\;\frac{\sqrt{\left(C + \mathsf{hypot}\left(C, B\_m\right)\right) \cdot \left(2 \cdot F\right)}}{-B\_m}\\

\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if B < 2.79999999999999981e-59

    1. Initial program 17.0%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around -inf 11.7%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    4. Taylor expanded in F around 0 11.8%

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}{{B}^{2} - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)} \]
    5. Taylor expanded in B around 0 16.3%

      \[\leadsto -1 \cdot \left(\sqrt{\color{blue}{-0.5 \cdot \frac{F}{A}}} \cdot \sqrt{2}\right) \]

    if 2.79999999999999981e-59 < B < 1.4000000000000001e112

    1. Initial program 40.6%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around 0 44.5%

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg44.5%

        \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]
      2. unpow244.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{\color{blue}{B \cdot B} + {C}^{2}}\right)} \]
      3. unpow244.5%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{B \cdot B + \color{blue}{C \cdot C}}\right)} \]
      4. hypot-define44.9%

        \[\leadsto -\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \color{blue}{\mathsf{hypot}\left(B, C\right)}\right)} \]
    5. Simplified44.9%

      \[\leadsto \color{blue}{-\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}} \]
    6. Step-by-step derivation
      1. associate-*l/44.9%

        \[\leadsto -\color{blue}{\frac{\sqrt{2} \cdot \sqrt{F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}}{B}} \]
      2. sqrt-unprod45.1%

        \[\leadsto -\frac{\color{blue}{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}}}{B} \]
    7. Applied egg-rr45.1%

      \[\leadsto -\color{blue}{\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)\right)}}{B}} \]
    8. Step-by-step derivation
      1. associate-*r*45.1%

        \[\leadsto -\frac{\sqrt{\color{blue}{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(B, C\right)\right)}}}{B} \]
      2. hypot-undefine44.7%

        \[\leadsto -\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \color{blue}{\sqrt{B \cdot B + C \cdot C}}\right)}}{B} \]
      3. unpow244.7%

        \[\leadsto -\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{\color{blue}{{B}^{2}} + C \cdot C}\right)}}{B} \]
      4. unpow244.7%

        \[\leadsto -\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{{B}^{2} + \color{blue}{{C}^{2}}}\right)}}{B} \]
      5. +-commutative44.7%

        \[\leadsto -\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{\color{blue}{{C}^{2} + {B}^{2}}}\right)}}{B} \]
      6. unpow244.7%

        \[\leadsto -\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{\color{blue}{C \cdot C} + {B}^{2}}\right)}}{B} \]
      7. unpow244.7%

        \[\leadsto -\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \sqrt{C \cdot C + \color{blue}{B \cdot B}}\right)}}{B} \]
      8. hypot-define45.1%

        \[\leadsto -\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \color{blue}{\mathsf{hypot}\left(C, B\right)}\right)}}{B} \]
    9. Simplified45.1%

      \[\leadsto -\color{blue}{\frac{\sqrt{\left(2 \cdot F\right) \cdot \left(C + \mathsf{hypot}\left(C, B\right)\right)}}{B}} \]

    if 1.4000000000000001e112 < B

    1. Initial program 0.9%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in B around inf 59.9%

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg59.9%

        \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
    5. Simplified59.9%

      \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
    6. Step-by-step derivation
      1. *-commutative59.9%

        \[\leadsto -\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}} \]
      2. pow1/259.9%

        \[\leadsto -\color{blue}{{2}^{0.5}} \cdot \sqrt{\frac{F}{B}} \]
      3. pow1/259.9%

        \[\leadsto -{2}^{0.5} \cdot \color{blue}{{\left(\frac{F}{B}\right)}^{0.5}} \]
      4. pow-prod-down60.2%

        \[\leadsto -\color{blue}{{\left(2 \cdot \frac{F}{B}\right)}^{0.5}} \]
    7. Applied egg-rr60.2%

      \[\leadsto -\color{blue}{{\left(2 \cdot \frac{F}{B}\right)}^{0.5}} \]
    8. Step-by-step derivation
      1. unpow1/260.2%

        \[\leadsto -\color{blue}{\sqrt{2 \cdot \frac{F}{B}}} \]
      2. associate-*r/60.2%

        \[\leadsto -\sqrt{\color{blue}{\frac{2 \cdot F}{B}}} \]
    9. Simplified60.2%

      \[\leadsto -\color{blue}{\sqrt{\frac{2 \cdot F}{B}}} \]
    10. Step-by-step derivation
      1. sqrt-div80.1%

        \[\leadsto -\color{blue}{\frac{\sqrt{2 \cdot F}}{\sqrt{B}}} \]
    11. Applied egg-rr80.1%

      \[\leadsto -\color{blue}{\frac{\sqrt{2 \cdot F}}{\sqrt{B}}} \]
  3. Recombined 3 regimes into one program.
  4. Final simplification28.7%

    \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq 2.8 \cdot 10^{-59}:\\ \;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;B \leq 1.4 \cdot 10^{+112}:\\ \;\;\;\;\frac{\sqrt{\left(C + \mathsf{hypot}\left(C, B\right)\right) \cdot \left(2 \cdot F\right)}}{-B}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B}}\\ \end{array} \]
  5. Add Preprocessing

Alternative 9: 47.1% accurate, 3.0× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} \mathbf{if}\;B\_m \leq 5.2 \cdot 10^{-54}:\\ \;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\ \end{array} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (if (<= B_m 5.2e-54)
   (* (sqrt (* -0.5 (/ F A))) (- (sqrt 2.0)))
   (/ (sqrt (* 2.0 F)) (- (sqrt B_m)))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 5.2e-54) {
		tmp = sqrt((-0.5 * (F / A))) * -sqrt(2.0);
	} else {
		tmp = sqrt((2.0 * F)) / -sqrt(B_m);
	}
	return tmp;
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (b_m <= 5.2d-54) then
        tmp = sqrt(((-0.5d0) * (f / a))) * -sqrt(2.0d0)
    else
        tmp = sqrt((2.0d0 * f)) / -sqrt(b_m)
    end if
    code = tmp
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 5.2e-54) {
		tmp = Math.sqrt((-0.5 * (F / A))) * -Math.sqrt(2.0);
	} else {
		tmp = Math.sqrt((2.0 * F)) / -Math.sqrt(B_m);
	}
	return tmp;
}
B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	tmp = 0
	if B_m <= 5.2e-54:
		tmp = math.sqrt((-0.5 * (F / A))) * -math.sqrt(2.0)
	else:
		tmp = math.sqrt((2.0 * F)) / -math.sqrt(B_m)
	return tmp
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if (B_m <= 5.2e-54)
		tmp = Float64(sqrt(Float64(-0.5 * Float64(F / A))) * Float64(-sqrt(2.0)));
	else
		tmp = Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m)));
	end
	return tmp
end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	tmp = 0.0;
	if (B_m <= 5.2e-54)
		tmp = sqrt((-0.5 * (F / A))) * -sqrt(2.0);
	else
		tmp = sqrt((2.0 * F)) / -sqrt(B_m);
	end
	tmp_2 = tmp;
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := If[LessEqual[B$95$m, 5.2e-54], N[(N[Sqrt[N[(-0.5 * N[(F / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\begin{array}{l}
\mathbf{if}\;B\_m \leq 5.2 \cdot 10^{-54}:\\
\;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\

\mathbf{else}:\\
\;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if B < 5.20000000000000004e-54

    1. Initial program 17.0%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in A around -inf 11.7%

      \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    4. Taylor expanded in F around 0 11.8%

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F \cdot \left(-0.5 \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}{{B}^{2} - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)} \]
    5. Taylor expanded in B around 0 16.2%

      \[\leadsto -1 \cdot \left(\sqrt{\color{blue}{-0.5 \cdot \frac{F}{A}}} \cdot \sqrt{2}\right) \]

    if 5.20000000000000004e-54 < B

    1. Initial program 18.2%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
    2. Add Preprocessing
    3. Taylor expanded in B around inf 47.0%

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
    4. Step-by-step derivation
      1. mul-1-neg47.0%

        \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
    5. Simplified47.0%

      \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
    6. Step-by-step derivation
      1. *-commutative47.0%

        \[\leadsto -\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}} \]
      2. pow1/247.0%

        \[\leadsto -\color{blue}{{2}^{0.5}} \cdot \sqrt{\frac{F}{B}} \]
      3. pow1/247.0%

        \[\leadsto -{2}^{0.5} \cdot \color{blue}{{\left(\frac{F}{B}\right)}^{0.5}} \]
      4. pow-prod-down47.2%

        \[\leadsto -\color{blue}{{\left(2 \cdot \frac{F}{B}\right)}^{0.5}} \]
    7. Applied egg-rr47.2%

      \[\leadsto -\color{blue}{{\left(2 \cdot \frac{F}{B}\right)}^{0.5}} \]
    8. Step-by-step derivation
      1. unpow1/247.2%

        \[\leadsto -\color{blue}{\sqrt{2 \cdot \frac{F}{B}}} \]
      2. associate-*r/47.2%

        \[\leadsto -\sqrt{\color{blue}{\frac{2 \cdot F}{B}}} \]
    9. Simplified47.2%

      \[\leadsto -\color{blue}{\sqrt{\frac{2 \cdot F}{B}}} \]
    10. Step-by-step derivation
      1. sqrt-div63.1%

        \[\leadsto -\color{blue}{\frac{\sqrt{2 \cdot F}}{\sqrt{B}}} \]
    11. Applied egg-rr63.1%

      \[\leadsto -\color{blue}{\frac{\sqrt{2 \cdot F}}{\sqrt{B}}} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification27.9%

    \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq 5.2 \cdot 10^{-54}:\\ \;\;\;\;\sqrt{-0.5 \cdot \frac{F}{A}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{2 \cdot F}}{-\sqrt{B}}\\ \end{array} \]
  5. Add Preprocessing

Alternative 10: 34.9% accurate, 3.1× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F) :precision binary64 (/ (sqrt (* 2.0 F)) (- (sqrt B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	return sqrt((2.0 * F)) / -sqrt(B_m);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = sqrt((2.0d0 * f)) / -sqrt(b_m)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	return Math.sqrt((2.0 * F)) / -Math.sqrt(B_m);
}
B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	return math.sqrt((2.0 * F)) / -math.sqrt(B_m)
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	return Float64(sqrt(Float64(2.0 * F)) / Float64(-sqrt(B_m)))
end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
	tmp = sqrt((2.0 * F)) / -sqrt(B_m);
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision]
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
\frac{\sqrt{2 \cdot F}}{-\sqrt{B\_m}}
\end{array}
Derivation
  1. Initial program 17.3%

    \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
  2. Add Preprocessing
  3. Taylor expanded in B around inf 13.0%

    \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
  4. Step-by-step derivation
    1. mul-1-neg13.0%

      \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
  5. Simplified13.0%

    \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
  6. Step-by-step derivation
    1. *-commutative13.0%

      \[\leadsto -\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}} \]
    2. pow1/213.0%

      \[\leadsto -\color{blue}{{2}^{0.5}} \cdot \sqrt{\frac{F}{B}} \]
    3. pow1/213.1%

      \[\leadsto -{2}^{0.5} \cdot \color{blue}{{\left(\frac{F}{B}\right)}^{0.5}} \]
    4. pow-prod-down13.1%

      \[\leadsto -\color{blue}{{\left(2 \cdot \frac{F}{B}\right)}^{0.5}} \]
  7. Applied egg-rr13.1%

    \[\leadsto -\color{blue}{{\left(2 \cdot \frac{F}{B}\right)}^{0.5}} \]
  8. Step-by-step derivation
    1. unpow1/213.0%

      \[\leadsto -\color{blue}{\sqrt{2 \cdot \frac{F}{B}}} \]
    2. associate-*r/13.0%

      \[\leadsto -\sqrt{\color{blue}{\frac{2 \cdot F}{B}}} \]
  9. Simplified13.0%

    \[\leadsto -\color{blue}{\sqrt{\frac{2 \cdot F}{B}}} \]
  10. Step-by-step derivation
    1. sqrt-div16.5%

      \[\leadsto -\color{blue}{\frac{\sqrt{2 \cdot F}}{\sqrt{B}}} \]
  11. Applied egg-rr16.5%

    \[\leadsto -\color{blue}{\frac{\sqrt{2 \cdot F}}{\sqrt{B}}} \]
  12. Final simplification16.5%

    \[\leadsto \frac{\sqrt{2 \cdot F}}{-\sqrt{B}} \]
  13. Add Preprocessing

Alternative 11: 26.7% accurate, 5.9× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ -{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F) :precision binary64 (- (pow (* 2.0 (/ F B_m)) 0.5)))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	return -pow((2.0 * (F / B_m)), 0.5);
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = -((2.0d0 * (f / b_m)) ** 0.5d0)
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	return -Math.pow((2.0 * (F / B_m)), 0.5);
}
B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	return -math.pow((2.0 * (F / B_m)), 0.5)
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	return Float64(-(Float64(2.0 * Float64(F / B_m)) ^ 0.5))
end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
	tmp = -((2.0 * (F / B_m)) ^ 0.5);
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := (-N[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}
\end{array}
Derivation
  1. Initial program 17.3%

    \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
  2. Add Preprocessing
  3. Taylor expanded in B around inf 13.0%

    \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
  4. Step-by-step derivation
    1. mul-1-neg13.0%

      \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
  5. Simplified13.0%

    \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
  6. Step-by-step derivation
    1. sqrt-unprod13.0%

      \[\leadsto -\color{blue}{\sqrt{\frac{F}{B} \cdot 2}} \]
    2. pow1/213.1%

      \[\leadsto -\color{blue}{{\left(\frac{F}{B} \cdot 2\right)}^{0.5}} \]
  7. Applied egg-rr13.1%

    \[\leadsto -\color{blue}{{\left(\frac{F}{B} \cdot 2\right)}^{0.5}} \]
  8. Final simplification13.1%

    \[\leadsto -{\left(2 \cdot \frac{F}{B}\right)}^{0.5} \]
  9. Add Preprocessing

Alternative 12: 26.7% accurate, 6.0× speedup?

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ -\sqrt{\frac{2 \cdot F}{B\_m}} \end{array} \]
B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F) :precision binary64 (- (sqrt (/ (* 2.0 F) B_m))))
B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	return -sqrt(((2.0 * F) / B_m));
}
B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = -sqrt(((2.0d0 * f) / b_m))
end function
B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	return -Math.sqrt(((2.0 * F) / B_m));
}
B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	return -math.sqrt(((2.0 * F) / B_m))
B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	return Float64(-sqrt(Float64(Float64(2.0 * F) / B_m)))
end
B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
	tmp = -sqrt(((2.0 * F) / B_m));
end
B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision])
\begin{array}{l}
B_m = \left|B\right|
\\
[A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\
\\
-\sqrt{\frac{2 \cdot F}{B\_m}}
\end{array}
Derivation
  1. Initial program 17.3%

    \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
  2. Add Preprocessing
  3. Taylor expanded in B around inf 13.0%

    \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
  4. Step-by-step derivation
    1. mul-1-neg13.0%

      \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
  5. Simplified13.0%

    \[\leadsto \color{blue}{-\sqrt{\frac{F}{B}} \cdot \sqrt{2}} \]
  6. Step-by-step derivation
    1. *-commutative13.0%

      \[\leadsto -\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}} \]
    2. pow1/213.0%

      \[\leadsto -\color{blue}{{2}^{0.5}} \cdot \sqrt{\frac{F}{B}} \]
    3. pow1/213.1%

      \[\leadsto -{2}^{0.5} \cdot \color{blue}{{\left(\frac{F}{B}\right)}^{0.5}} \]
    4. pow-prod-down13.1%

      \[\leadsto -\color{blue}{{\left(2 \cdot \frac{F}{B}\right)}^{0.5}} \]
  7. Applied egg-rr13.1%

    \[\leadsto -\color{blue}{{\left(2 \cdot \frac{F}{B}\right)}^{0.5}} \]
  8. Step-by-step derivation
    1. unpow1/213.0%

      \[\leadsto -\color{blue}{\sqrt{2 \cdot \frac{F}{B}}} \]
    2. associate-*r/13.0%

      \[\leadsto -\sqrt{\color{blue}{\frac{2 \cdot F}{B}}} \]
  9. Simplified13.0%

    \[\leadsto -\color{blue}{\sqrt{\frac{2 \cdot F}{B}}} \]
  10. Add Preprocessing

Reproduce

?
herbie shell --seed 2024096 
(FPCore (A B C F)
  :name "ABCF->ab-angle a"
  :precision binary64
  (/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))