ABCF->ab-angle b

Percentage Accurate: 18.5% → 48.8%

Time: 30.7s

Alternatives: 13

Speedup: 5.9×

Specification

Math

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

(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)))

C

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;
}

Fortran

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

Java

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;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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]]

Initial Program: 18.5% accurate, 1.0× speedup

Math

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

(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)))

C

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;
}

Fortran

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

Java

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;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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]]

Alternative 1: 48.8% accurate, 0.7× speedup

Math

\[\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 := A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\\ t_1 := \mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)\\ t_2 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ t_3 := \frac{\sqrt{\left(t\_2 \cdot F\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{-t\_2}\\ \mathbf{if}\;{B\_m}^{2} \leq 10^{-134}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{-36}:\\ \;\;\;\;\frac{\sqrt{F \cdot t\_0} \cdot \sqrt{2 \cdot t\_1}}{-t\_1}\\ \mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{-11}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;{B\_m}^{2} \leq 10^{+288}:\\ \;\;\;\;\sqrt{2} \cdot \left(-\sqrt{F \cdot \frac{t\_0}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}}\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\ \end{array} \end{array} \]

FPCore

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 (+ A (- C (hypot B_m (- A C)))))
        (t_1 (fma C (* A -4.0) (pow B_m 2.0)))
        (t_2 (fma B_m B_m (* A (* C -4.0))))
        (t_3
         (/
          (sqrt (* (* t_2 F) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
          (- t_2))))
   (if (<= (pow B_m 2.0) 1e-134)
     t_3
     (if (<= (pow B_m 2.0) 4e-36)
       (/ (* (sqrt (* F t_0)) (sqrt (* 2.0 t_1))) (- t_1))
       (if (<= (pow B_m 2.0) 2e-11)
         t_3
         (if (<= (pow B_m 2.0) 1e+288)
           (*
            (sqrt 2.0)
            (- (sqrt (* F (/ t_0 (fma -4.0 (* A C) (pow B_m 2.0)))))))
           (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))))))))

C

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 = A + (C - hypot(B_m, (A - C)));
	double t_1 = fma(C, (A * -4.0), pow(B_m, 2.0));
	double t_2 = fma(B_m, B_m, (A * (C * -4.0)));
	double t_3 = sqrt(((t_2 * F) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / -t_2;
	double tmp;
	if (pow(B_m, 2.0) <= 1e-134) {
		tmp = t_3;
	} else if (pow(B_m, 2.0) <= 4e-36) {
		tmp = (sqrt((F * t_0)) * sqrt((2.0 * t_1))) / -t_1;
	} else if (pow(B_m, 2.0) <= 2e-11) {
		tmp = t_3;
	} else if (pow(B_m, 2.0) <= 1e+288) {
		tmp = sqrt(2.0) * -sqrt((F * (t_0 / fma(-4.0, (A * C), pow(B_m, 2.0)))));
	} else {
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	}
	return tmp;
}

Julia

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(A + Float64(C - hypot(B_m, Float64(A - C))))
	t_1 = fma(C, Float64(A * -4.0), (B_m ^ 2.0))
	t_2 = fma(B_m, B_m, Float64(A * Float64(C * -4.0)))
	t_3 = Float64(sqrt(Float64(Float64(t_2 * F) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / Float64(-t_2))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-134)
		tmp = t_3;
	elseif ((B_m ^ 2.0) <= 4e-36)
		tmp = Float64(Float64(sqrt(Float64(F * t_0)) * sqrt(Float64(2.0 * t_1))) / Float64(-t_1));
	elseif ((B_m ^ 2.0) <= 2e-11)
		tmp = t_3;
	elseif ((B_m ^ 2.0) <= 1e+288)
		tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F * Float64(t_0 / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))))));
	else
		tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

Wolfram

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[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(t$95$2 * F), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$2)), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-134], t$95$3, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-36], N[(N[(N[Sqrt[N[(F * t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(2.0 * t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-11], t$95$3, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+288], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F * N[(t$95$0 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000004e-134 or 3.9999999999999998e-36 < (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999988e-11

   1. Initial program 20.5%

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

   3. Simplified 30.9%

      \[\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)}} \]
   4. Add Preprocessing

   5. Taylor expanded in C around inf 31.9%

      \[\leadsto \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 + \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{C} - -1 \cdot A\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg 31.9%

         \[\leadsto \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(-0.5 \cdot \frac{{B}^{2}}{C} - \color{blue}{\left(-A\right)}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

   7. Simplified 31.9%

      \[\leadsto \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 + \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{C} - \left(-A\right)\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

   if 1.00000000000000004e-134 < (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999998e-36

   1. Initial program 49.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} \]

   3. Simplified 51.3%

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

      1. pow1/2 51.3%

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

      2. associate-*r* 54.8%

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

      3. unpow-prod-down 60.9%

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

      4. associate-+r- 60.8%

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

      5. hypot-undefine 56.2%

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

      6. unpow2 56.2%

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

      7. unpow2 56.2%

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

      8. +-commutative 56.2%

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

      9. unpow2 56.2%

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

      10. unpow2 56.2%

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

      11. hypot-define 60.8%

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

      12. pow1/2 60.8%

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

   6. Applied egg-rr 60.8%

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

      1. unpow1/2 60.8%

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

      2. associate-+r- 60.9%

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

      3. hypot-undefine 56.2%

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

      4. unpow2 56.2%

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

      5. unpow2 56.2%

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

      6. +-commutative 56.2%

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

      7. unpow2 56.2%

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

      8. unpow2 56.2%

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

      9. hypot-undefine 60.9%

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

   8. Simplified 60.9%

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

   if 1.99999999999999988e-11 < (pow.f64 B #s(literal 2 binary64)) < 1e288

   1. Initial program 34.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 F around 0 50.1%

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

      1. mul-1-neg 50.1%

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

      2. *-commutative 50.1%

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

      3. associate-/l* 60.4%

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

      4. associate--l+ 60.4%

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

      5. unpow2 60.4%

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

      6. unpow2 60.4%

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

      7. hypot-undefine 68.0%

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

      8. cancel-sign-sub-inv 68.0%

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

   5. Simplified 68.0%

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

   if 1e288 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 1.7%

      \[\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 C around 0 6.2%

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

      1. mul-1-neg 6.2%

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

      2. +-commutative 6.2%

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

      3. unpow2 6.2%

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

      4. unpow2 6.2%

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

      5. hypot-define 34.9%

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

   5. Simplified 34.9%

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

4. Final simplification 45.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 10^{-134}:\\ \;\;\;\;\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(A + -0.5 \cdot \frac{{B}^{2}}{C}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 4 \cdot 10^{-36}:\\ \;\;\;\;\frac{\sqrt{F \cdot \left(A + \left(C - \mathsf{hypot}\left(B, A - C\right)\right)\right)} \cdot \sqrt{2 \cdot \mathsf{fma}\left(C, A \cdot -4, {B}^{2}\right)}}{-\mathsf{fma}\left(C, A \cdot -4, {B}^{2}\right)}\\ \mathbf{elif}\;{B}^{2} \leq 2 \cdot 10^{-11}:\\ \;\;\;\;\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(A + -0.5 \cdot \frac{{B}^{2}}{C}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 10^{+288}:\\ \;\;\;\;\sqrt{2} \cdot \left(-\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)}}\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B, A\right)\right)} \cdot \frac{\sqrt{2}}{-B}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 48.3% accurate, 0.7× speedup

Math

\[\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 := A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\\ t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ t_2 := -t\_1\\ t_3 := \frac{\sqrt{\left(t\_1 \cdot F\right) \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{t\_2}\\ \mathbf{if}\;{B\_m}^{2} \leq 10^{-134}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{-36}:\\ \;\;\;\;\frac{\mathsf{hypot}\left(B\_m, \sqrt{-4 \cdot \left(A \cdot C\right)}\right) \cdot \sqrt{t\_0 \cdot \left(2 \cdot F\right)}}{t\_2}\\ \mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{-11}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;{B\_m}^{2} \leq 10^{+288}:\\ \;\;\;\;\sqrt{2} \cdot \left(-\sqrt{F \cdot \frac{t\_0}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}}\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\ \end{array} \end{array} \]

FPCore

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 (+ A (- C (hypot B_m (- A C)))))
        (t_1 (fma B_m B_m (* A (* C -4.0))))
        (t_2 (- t_1))
        (t_3
         (/
          (sqrt (* (* t_1 F) (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
          t_2)))
   (if (<= (pow B_m 2.0) 1e-134)
     t_3
     (if (<= (pow B_m 2.0) 4e-36)
       (/ (* (hypot B_m (sqrt (* -4.0 (* A C)))) (sqrt (* t_0 (* 2.0 F)))) t_2)
       (if (<= (pow B_m 2.0) 2e-11)
         t_3
         (if (<= (pow B_m 2.0) 1e+288)
           (*
            (sqrt 2.0)
            (- (sqrt (* F (/ t_0 (fma -4.0 (* A C) (pow B_m 2.0)))))))
           (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))))))))

C

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 = A + (C - hypot(B_m, (A - C)));
	double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
	double t_2 = -t_1;
	double t_3 = sqrt(((t_1 * F) * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / t_2;
	double tmp;
	if (pow(B_m, 2.0) <= 1e-134) {
		tmp = t_3;
	} else if (pow(B_m, 2.0) <= 4e-36) {
		tmp = (hypot(B_m, sqrt((-4.0 * (A * C)))) * sqrt((t_0 * (2.0 * F)))) / t_2;
	} else if (pow(B_m, 2.0) <= 2e-11) {
		tmp = t_3;
	} else if (pow(B_m, 2.0) <= 1e+288) {
		tmp = sqrt(2.0) * -sqrt((F * (t_0 / fma(-4.0, (A * C), pow(B_m, 2.0)))));
	} else {
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	}
	return tmp;
}

Julia

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(A + Float64(C - hypot(B_m, Float64(A - C))))
	t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0)))
	t_2 = Float64(-t_1)
	t_3 = Float64(sqrt(Float64(Float64(t_1 * F) * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / t_2)
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-134)
		tmp = t_3;
	elseif ((B_m ^ 2.0) <= 4e-36)
		tmp = Float64(Float64(hypot(B_m, sqrt(Float64(-4.0 * Float64(A * C)))) * sqrt(Float64(t_0 * Float64(2.0 * F)))) / t_2);
	elseif ((B_m ^ 2.0) <= 2e-11)
		tmp = t_3;
	elseif ((B_m ^ 2.0) <= 1e+288)
		tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F * Float64(t_0 / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))))));
	else
		tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

Wolfram

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[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(t$95$1 * F), $MachinePrecision] * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-134], t$95$3, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-36], N[(N[(N[Sqrt[B$95$m ^ 2 + N[Sqrt[N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] ^ 2], $MachinePrecision] * N[Sqrt[N[(t$95$0 * N[(2.0 * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-11], t$95$3, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+288], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F * N[(t$95$0 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000004e-134 or 3.9999999999999998e-36 < (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999988e-11

   1. Initial program 20.5%

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

   3. Simplified 30.9%

      \[\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)}} \]
   4. Add Preprocessing

   5. Taylor expanded in C around inf 31.9%

      \[\leadsto \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 + \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{C} - -1 \cdot A\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg 31.9%

         \[\leadsto \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(-0.5 \cdot \frac{{B}^{2}}{C} - \color{blue}{\left(-A\right)}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

   7. Simplified 31.9%

      \[\leadsto \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 + \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{C} - \left(-A\right)\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

   if 1.00000000000000004e-134 < (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999998e-36

   1. Initial program 49.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} \]

   3. Simplified 59.2%

      \[\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)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. pow1/2 59.2%

         \[\leadsto \frac{\color{blue}{{\left(\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)\right)}^{0.5}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

      2. associate-*l* 54.8%

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

      3. unpow-prod-down 60.8%

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

      4. pow1/2 60.8%

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

      5. fma-undefine 60.8%

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

      6. add-sqr-sqrt 60.8%

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

      7. hypot-define 60.8%

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

   6. Applied egg-rr 60.7%

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

      1. associate-*r* 60.7%

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

      2. *-commutative 60.7%

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

      3. unpow1/2 60.7%

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

      4. associate-*r* 60.7%

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

      5. associate-+r- 60.8%

         \[\leadsto \frac{\mathsf{hypot}\left(B, \sqrt{\left(C \cdot A\right) \cdot -4}\right) \cdot \sqrt{\left(F \cdot 2\right) \cdot \color{blue}{\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. hypot-undefine 56.2%

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

      7. unpow2 56.2%

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

      8. unpow2 56.2%

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

      9. +-commutative 56.2%

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

      10. unpow2 56.2%

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

      11. unpow2 56.2%

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

      12. hypot-undefine 60.8%

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

   8. Simplified 60.8%

      \[\leadsto \frac{\color{blue}{\mathsf{hypot}\left(B, \sqrt{\left(C \cdot A\right) \cdot -4}\right) \cdot \sqrt{\left(F \cdot 2\right) \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)} \]

   if 1.99999999999999988e-11 < (pow.f64 B #s(literal 2 binary64)) < 1e288

   1. Initial program 34.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 F around 0 50.1%

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

      1. mul-1-neg 50.1%

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

      2. *-commutative 50.1%

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

      3. associate-/l* 60.4%

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

      4. associate--l+ 60.4%

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

      5. unpow2 60.4%

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

      6. unpow2 60.4%

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

      7. hypot-undefine 68.0%

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

      8. cancel-sign-sub-inv 68.0%

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

   5. Simplified 68.0%

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

   if 1e288 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 1.7%

      \[\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 C around 0 6.2%

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

      1. mul-1-neg 6.2%

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

      2. +-commutative 6.2%

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

      3. unpow2 6.2%

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

      4. unpow2 6.2%

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

      5. hypot-define 34.9%

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

   5. Simplified 34.9%

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

4. Final simplification 45.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 10^{-134}:\\ \;\;\;\;\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(A + -0.5 \cdot \frac{{B}^{2}}{C}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 4 \cdot 10^{-36}:\\ \;\;\;\;\frac{\mathsf{hypot}\left(B, \sqrt{-4 \cdot \left(A \cdot C\right)}\right) \cdot \sqrt{\left(A + \left(C - \mathsf{hypot}\left(B, A - C\right)\right)\right) \cdot \left(2 \cdot F\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 2 \cdot 10^{-11}:\\ \;\;\;\;\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(A + -0.5 \cdot \frac{{B}^{2}}{C}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 10^{+288}:\\ \;\;\;\;\sqrt{2} \cdot \left(-\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)}}\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B, A\right)\right)} \cdot \frac{\sqrt{2}}{-B}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 49.0% accurate, 0.7× speedup

Math

\[\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 := A + \left(C - \mathsf{hypot}\left(B\_m, A - C\right)\right)\\ t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ t_2 := -t\_1\\ t_3 := t\_1 \cdot F\\ t_4 := \frac{\sqrt{t\_3 \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{t\_2}\\ \mathbf{if}\;{B\_m}^{2} \leq 10^{-188}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{-36}:\\ \;\;\;\;\frac{\sqrt{t\_3 \cdot \left(2 \cdot t\_0\right)}}{t\_2}\\ \mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{-11}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;{B\_m}^{2} \leq 10^{+288}:\\ \;\;\;\;\sqrt{2} \cdot \left(-\sqrt{F \cdot \frac{t\_0}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}}\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\ \end{array} \end{array} \]

FPCore

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 (+ A (- C (hypot B_m (- A C)))))
        (t_1 (fma B_m B_m (* A (* C -4.0))))
        (t_2 (- t_1))
        (t_3 (* t_1 F))
        (t_4
         (/
          (sqrt (* t_3 (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
          t_2)))
   (if (<= (pow B_m 2.0) 1e-188)
     t_4
     (if (<= (pow B_m 2.0) 4e-36)
       (/ (sqrt (* t_3 (* 2.0 t_0))) t_2)
       (if (<= (pow B_m 2.0) 2e-11)
         t_4
         (if (<= (pow B_m 2.0) 1e+288)
           (*
            (sqrt 2.0)
            (- (sqrt (* F (/ t_0 (fma -4.0 (* A C) (pow B_m 2.0)))))))
           (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))))))))

C

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 = A + (C - hypot(B_m, (A - C)));
	double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
	double t_2 = -t_1;
	double t_3 = t_1 * F;
	double t_4 = sqrt((t_3 * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / t_2;
	double tmp;
	if (pow(B_m, 2.0) <= 1e-188) {
		tmp = t_4;
	} else if (pow(B_m, 2.0) <= 4e-36) {
		tmp = sqrt((t_3 * (2.0 * t_0))) / t_2;
	} else if (pow(B_m, 2.0) <= 2e-11) {
		tmp = t_4;
	} else if (pow(B_m, 2.0) <= 1e+288) {
		tmp = sqrt(2.0) * -sqrt((F * (t_0 / fma(-4.0, (A * C), pow(B_m, 2.0)))));
	} else {
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	}
	return tmp;
}

Julia

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(A + Float64(C - hypot(B_m, Float64(A - C))))
	t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0)))
	t_2 = Float64(-t_1)
	t_3 = Float64(t_1 * F)
	t_4 = Float64(sqrt(Float64(t_3 * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / t_2)
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-188)
		tmp = t_4;
	elseif ((B_m ^ 2.0) <= 4e-36)
		tmp = Float64(sqrt(Float64(t_3 * Float64(2.0 * t_0))) / t_2);
	elseif ((B_m ^ 2.0) <= 2e-11)
		tmp = t_4;
	elseif ((B_m ^ 2.0) <= 1e+288)
		tmp = Float64(sqrt(2.0) * Float64(-sqrt(Float64(F * Float64(t_0 / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))))));
	else
		tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

Wolfram

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[(A + N[(C - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, Block[{t$95$3 = N[(t$95$1 * F), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$3 * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-188], t$95$4, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-36], N[(N[Sqrt[N[(t$95$3 * N[(2.0 * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-11], t$95$4, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+288], N[(N[Sqrt[2.0], $MachinePrecision] * (-N[Sqrt[N[(F * N[(t$95$0 / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999995e-189 or 3.9999999999999998e-36 < (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999988e-11

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

   3. Simplified 29.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)}} \]
   4. Add Preprocessing

   5. Taylor expanded in C around inf 30.8%

      \[\leadsto \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 + \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{C} - -1 \cdot A\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg 30.8%

         \[\leadsto \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(-0.5 \cdot \frac{{B}^{2}}{C} - \color{blue}{\left(-A\right)}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

   7. Simplified 30.8%

      \[\leadsto \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 + \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{C} - \left(-A\right)\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

   if 9.9999999999999995e-189 < (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999998e-36

   1. Initial program 49.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} \]

   3. Simplified 56.8%

      \[\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)}} \]
   4. Add Preprocessing

   if 1.99999999999999988e-11 < (pow.f64 B #s(literal 2 binary64)) < 1e288

   1. Initial program 34.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 F around 0 50.1%

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

      1. mul-1-neg 50.1%

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

      2. *-commutative 50.1%

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

      3. associate-/l* 60.4%

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

      4. associate--l+ 60.4%

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

      5. unpow2 60.4%

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

      6. unpow2 60.4%

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

      7. hypot-undefine 68.0%

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

      8. cancel-sign-sub-inv 68.0%

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

   5. Simplified 68.0%

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

   if 1e288 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 1.7%

      \[\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 C around 0 6.2%

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

      1. mul-1-neg 6.2%

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

      2. +-commutative 6.2%

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

      3. unpow2 6.2%

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

      4. unpow2 6.2%

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

      5. hypot-define 34.9%

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

   5. Simplified 34.9%

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

4. Final simplification 45.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 10^{-188}:\\ \;\;\;\;\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(A + -0.5 \cdot \frac{{B}^{2}}{C}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 4 \cdot 10^{-36}:\\ \;\;\;\;\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)}\\ \mathbf{elif}\;{B}^{2} \leq 2 \cdot 10^{-11}:\\ \;\;\;\;\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(A + -0.5 \cdot \frac{{B}^{2}}{C}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 10^{+288}:\\ \;\;\;\;\sqrt{2} \cdot \left(-\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)}}\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B, A\right)\right)} \cdot \frac{\sqrt{2}}{-B}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 48.9% accurate, 0.8× speedup

Math

\[\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{hypot}\left(B\_m, A - C\right)\\ t_1 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ t_2 := -t\_1\\ t_3 := t\_1 \cdot F\\ t_4 := \frac{\sqrt{t\_3 \cdot \left(2 \cdot \left(A + \left(A + -0.5 \cdot \frac{{B\_m}^{2}}{C}\right)\right)\right)}}{t\_2}\\ \mathbf{if}\;{B\_m}^{2} \leq 10^{-188}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;{B\_m}^{2} \leq 4 \cdot 10^{-36}:\\ \;\;\;\;\frac{\sqrt{t\_3 \cdot \left(2 \cdot \left(A + \left(C - t\_0\right)\right)\right)}}{t\_2}\\ \mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{-11}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;{B\_m}^{2} \leq 10^{+288}:\\ \;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{\left(A + C\right) - t\_0}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\ \end{array} \end{array} \]

FPCore

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 (hypot B_m (- A C)))
        (t_1 (fma B_m B_m (* A (* C -4.0))))
        (t_2 (- t_1))
        (t_3 (* t_1 F))
        (t_4
         (/
          (sqrt (* t_3 (* 2.0 (+ A (+ A (* -0.5 (/ (pow B_m 2.0) C)))))))
          t_2)))
   (if (<= (pow B_m 2.0) 1e-188)
     t_4
     (if (<= (pow B_m 2.0) 4e-36)
       (/ (sqrt (* t_3 (* 2.0 (+ A (- C t_0))))) t_2)
       (if (<= (pow B_m 2.0) 2e-11)
         t_4
         (if (<= (pow B_m 2.0) 1e+288)
           (-
            (sqrt
             (*
              2.0
              (* F (/ (- (+ A C) t_0) (fma -4.0 (* A C) (pow B_m 2.0)))))))
           (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))))))))

C

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 = hypot(B_m, (A - C));
	double t_1 = fma(B_m, B_m, (A * (C * -4.0)));
	double t_2 = -t_1;
	double t_3 = t_1 * F;
	double t_4 = sqrt((t_3 * (2.0 * (A + (A + (-0.5 * (pow(B_m, 2.0) / C))))))) / t_2;
	double tmp;
	if (pow(B_m, 2.0) <= 1e-188) {
		tmp = t_4;
	} else if (pow(B_m, 2.0) <= 4e-36) {
		tmp = sqrt((t_3 * (2.0 * (A + (C - t_0))))) / t_2;
	} else if (pow(B_m, 2.0) <= 2e-11) {
		tmp = t_4;
	} else if (pow(B_m, 2.0) <= 1e+288) {
		tmp = -sqrt((2.0 * (F * (((A + C) - t_0) / fma(-4.0, (A * C), pow(B_m, 2.0))))));
	} else {
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	}
	return tmp;
}

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = hypot(B_m, Float64(A - C))
	t_1 = fma(B_m, B_m, Float64(A * Float64(C * -4.0)))
	t_2 = Float64(-t_1)
	t_3 = Float64(t_1 * F)
	t_4 = Float64(sqrt(Float64(t_3 * Float64(2.0 * Float64(A + Float64(A + Float64(-0.5 * Float64((B_m ^ 2.0) / C))))))) / t_2)
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-188)
		tmp = t_4;
	elseif ((B_m ^ 2.0) <= 4e-36)
		tmp = Float64(sqrt(Float64(t_3 * Float64(2.0 * Float64(A + Float64(C - t_0))))) / t_2);
	elseif ((B_m ^ 2.0) <= 2e-11)
		tmp = t_4;
	elseif ((B_m ^ 2.0) <= 1e+288)
		tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(Float64(Float64(A + C) - t_0) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))))));
	else
		tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

Wolfram

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[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]}, Block[{t$95$1 = N[(B$95$m * B$95$m + N[(A * N[(C * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$1)}, Block[{t$95$3 = N[(t$95$1 * F), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t$95$3 * N[(2.0 * N[(A + N[(A + N[(-0.5 * N[(N[Power[B$95$m, 2.0], $MachinePrecision] / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-188], t$95$4, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-36], N[(N[Sqrt[N[(t$95$3 * N[(2.0 * N[(A + N[(C - t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-11], t$95$4, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+288], (-N[Sqrt[N[(2.0 * N[(F * N[(N[(N[(A + C), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999995e-189 or 3.9999999999999998e-36 < (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999988e-11

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

   3. Simplified 29.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)}} \]
   4. Add Preprocessing

   5. Taylor expanded in C around inf 30.8%

      \[\leadsto \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 + \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{C} - -1 \cdot A\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg 30.8%

         \[\leadsto \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(-0.5 \cdot \frac{{B}^{2}}{C} - \color{blue}{\left(-A\right)}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

   7. Simplified 30.8%

      \[\leadsto \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 + \color{blue}{\left(-0.5 \cdot \frac{{B}^{2}}{C} - \left(-A\right)\right)}\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

   if 9.9999999999999995e-189 < (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999998e-36

   1. Initial program 49.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} \]

   3. Simplified 56.8%

      \[\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)}} \]
   4. Add Preprocessing

   if 1.99999999999999988e-11 < (pow.f64 B #s(literal 2 binary64)) < 1e288

   1. Initial program 34.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 F around 0 50.1%

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

      1. mul-1-neg 50.1%

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

      2. *-commutative 50.1%

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

      3. associate-/l* 60.4%

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

      4. associate--l+ 60.4%

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

      5. unpow2 60.4%

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

      6. unpow2 60.4%

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

      7. hypot-undefine 68.0%

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

      8. cancel-sign-sub-inv 68.0%

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

   5. Simplified 68.0%

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

      1. *-commutative 68.0%

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

      2. pow1/2 68.0%

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

      3. pow1/2 68.0%

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

      4. pow-prod-down 68.4%

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

      5. *-commutative 68.4%

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

      6. associate-+r- 67.9%

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

      7. *-commutative 67.9%

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

   7. Applied egg-rr 67.9%

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

      1. unpow1/2 67.9%

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

   9. Simplified 67.9%

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

   if 1e288 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 1.7%

      \[\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 C around 0 6.2%

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

      1. mul-1-neg 6.2%

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

      2. +-commutative 6.2%

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

      3. unpow2 6.2%

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

      4. unpow2 6.2%

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

      5. hypot-define 34.9%

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

   5. Simplified 34.9%

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

4. Final simplification 45.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 10^{-188}:\\ \;\;\;\;\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(A + -0.5 \cdot \frac{{B}^{2}}{C}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 4 \cdot 10^{-36}:\\ \;\;\;\;\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)}\\ \mathbf{elif}\;{B}^{2} \leq 2 \cdot 10^{-11}:\\ \;\;\;\;\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(A + -0.5 \cdot \frac{{B}^{2}}{C}\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{elif}\;{B}^{2} \leq 10^{+288}:\\ \;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{\left(A + C\right) - \mathsf{hypot}\left(B, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B}^{2}\right)}\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B, A\right)\right)} \cdot \frac{\sqrt{2}}{-B}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 49.5% accurate, 1.0× speedup

Math

\[\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 := C \cdot \left(A \cdot 4\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-86}:\\ \;\;\;\;\frac{\sqrt{\left(2 \cdot \left(F \cdot \left({B\_m}^{2} - t\_0\right)\right)\right) \cdot \left(2 \cdot A\right)}}{t\_0 - {B\_m}^{2}}\\ \mathbf{elif}\;{B\_m}^{2} \leq 10^{+288}:\\ \;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{\left(A + C\right) - \mathsf{hypot}\left(B\_m, A - C\right)}{\mathsf{fma}\left(-4, A \cdot C, {B\_m}^{2}\right)}\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\ \end{array} \end{array} \]

FPCore

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 (* C (* A 4.0))))
   (if (<= (pow B_m 2.0) 4e-86)
     (/
      (sqrt (* (* 2.0 (* F (- (pow B_m 2.0) t_0))) (* 2.0 A)))
      (- t_0 (pow B_m 2.0)))
     (if (<= (pow B_m 2.0) 1e+288)
       (-
        (sqrt
         (*
          2.0
          (*
           F
           (/
            (- (+ A C) (hypot B_m (- A C)))
            (fma -4.0 (* A C) (pow B_m 2.0)))))))
       (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))))))

C

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 = C * (A * 4.0);
	double tmp;
	if (pow(B_m, 2.0) <= 4e-86) {
		tmp = sqrt(((2.0 * (F * (pow(B_m, 2.0) - t_0))) * (2.0 * A))) / (t_0 - pow(B_m, 2.0));
	} else if (pow(B_m, 2.0) <= 1e+288) {
		tmp = -sqrt((2.0 * (F * (((A + C) - hypot(B_m, (A - C))) / fma(-4.0, (A * C), pow(B_m, 2.0))))));
	} else {
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	}
	return tmp;
}

Julia

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(C * Float64(A * 4.0))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 4e-86)
		tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * Float64((B_m ^ 2.0) - t_0))) * Float64(2.0 * A))) / Float64(t_0 - (B_m ^ 2.0)));
	elseif ((B_m ^ 2.0) <= 1e+288)
		tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(Float64(Float64(A + C) - hypot(B_m, Float64(A - C))) / fma(-4.0, Float64(A * C), (B_m ^ 2.0)))))));
	else
		tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

Wolfram

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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-86], N[(N[Sqrt[N[(N[(2.0 * N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e+288], (-N[Sqrt[N[(2.0 * N[(F * N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(A * C), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000034e-86

   1. Initial program 22.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 30.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 A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   if 4.00000000000000034e-86 < (pow.f64 B #s(literal 2 binary64)) < 1e288

   1. Initial program 35.5%

      \[\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 48.9%

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

      1. mul-1-neg 48.9%

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

      2. *-commutative 48.9%

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

      3. associate-/l* 56.9%

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

      4. associate--l+ 57.1%

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

      5. unpow2 57.1%

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

      6. unpow2 57.1%

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

      7. hypot-undefine 63.5%

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

      8. cancel-sign-sub-inv 63.5%

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

   5. Simplified 63.5%

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

      1. *-commutative 63.5%

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

      2. pow1/2 63.5%

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

      3. pow1/2 63.5%

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

      4. pow-prod-down 63.8%

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

      5. *-commutative 63.8%

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

      6. associate-+r- 63.1%

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

      7. *-commutative 63.1%

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

   7. Applied egg-rr 63.1%

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

      1. unpow1/2 63.1%

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

   9. Simplified 63.1%

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

   if 1e288 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 1.7%

      \[\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 C around 0 6.2%

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

      1. mul-1-neg 6.2%

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

      2. +-commutative 6.2%

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

      3. unpow2 6.2%

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

      4. unpow2 6.2%

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

      5. hypot-define 34.9%

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

   5. Simplified 34.9%

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

4. Final simplification 43.6%

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

Alternative 6: 46.8% accurate, 1.5× speedup

Math

\[\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 := C \cdot \left(A \cdot 4\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-86}:\\ \;\;\;\;\frac{\sqrt{\left(2 \cdot \left(F \cdot \left({B\_m}^{2} - t\_0\right)\right)\right) \cdot \left(2 \cdot A\right)}}{t\_0 - {B\_m}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\ \end{array} \end{array} \]

FPCore

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 (* C (* A 4.0))))
   (if (<= (pow B_m 2.0) 4e-86)
     (/
      (sqrt (* (* 2.0 (* F (- (pow B_m 2.0) t_0))) (* 2.0 A)))
      (- t_0 (pow B_m 2.0)))
     (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m))))))

C

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 = C * (A * 4.0);
	double tmp;
	if (pow(B_m, 2.0) <= 4e-86) {
		tmp = sqrt(((2.0 * (F * (pow(B_m, 2.0) - t_0))) * (2.0 * A))) / (t_0 - pow(B_m, 2.0));
	} else {
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	}
	return tmp;
}

Java

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 = C * (A * 4.0);
	double tmp;
	if (Math.pow(B_m, 2.0) <= 4e-86) {
		tmp = Math.sqrt(((2.0 * (F * (Math.pow(B_m, 2.0) - t_0))) * (2.0 * A))) / (t_0 - Math.pow(B_m, 2.0));
	} else {
		tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (Math.sqrt(2.0) / -B_m);
	}
	return tmp;
}

Python

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 = C * (A * 4.0)
	tmp = 0
	if math.pow(B_m, 2.0) <= 4e-86:
		tmp = math.sqrt(((2.0 * (F * (math.pow(B_m, 2.0) - t_0))) * (2.0 * A))) / (t_0 - math.pow(B_m, 2.0))
	else:
		tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (math.sqrt(2.0) / -B_m)
	return tmp

Julia

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(C * Float64(A * 4.0))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 4e-86)
		tmp = Float64(sqrt(Float64(Float64(2.0 * Float64(F * Float64((B_m ^ 2.0) - t_0))) * Float64(2.0 * A))) / Float64(t_0 - (B_m ^ 2.0)));
	else
		tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

MATLAB

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 = C * (A * 4.0);
	tmp = 0.0;
	if ((B_m ^ 2.0) <= 4e-86)
		tmp = sqrt(((2.0 * (F * ((B_m ^ 2.0) - t_0))) * (2.0 * A))) / (t_0 - (B_m ^ 2.0));
	else
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	end
	tmp_2 = tmp;
end

Wolfram

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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-86], N[(N[Sqrt[N[(N[(2.0 * N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$0 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 4.00000000000000034e-86

   1. Initial program 22.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 30.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 A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   if 4.00000000000000034e-86 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 21.7%

      \[\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 C around 0 16.1%

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

      1. mul-1-neg 16.1%

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

      2. +-commutative 16.1%

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

      3. unpow2 16.1%

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

      4. unpow2 16.1%

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

      5. hypot-define 28.6%

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

   5. Simplified 28.6%

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

4. Final simplification 29.3%

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

Alternative 7: 46.0% accurate, 1.5× speedup

Math

\[\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}^{2} \leq 2 \cdot 10^{-110}:\\ \;\;\;\;\frac{\sqrt{-8 \cdot \left(\left(A \cdot C\right) \cdot \left(F \cdot \left(A + A\right)\right)\right)}}{-\mathsf{fma}\left(C, A \cdot -4, {B\_m}^{2}\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\ \end{array} \end{array} \]

FPCore

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 (<= (pow B_m 2.0) 2e-110)
   (/
    (sqrt (* -8.0 (* (* A C) (* F (+ A A)))))
    (- (fma C (* A -4.0) (pow B_m 2.0))))
   (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))))

C

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 (pow(B_m, 2.0) <= 2e-110) {
		tmp = sqrt((-8.0 * ((A * C) * (F * (A + A))))) / -fma(C, (A * -4.0), pow(B_m, 2.0));
	} else {
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	}
	return tmp;
}

Julia

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.0) <= 2e-110)
		tmp = Float64(sqrt(Float64(-8.0 * Float64(Float64(A * C) * Float64(F * Float64(A + A))))) / Float64(-fma(C, Float64(A * -4.0), (B_m ^ 2.0))));
	else
		tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

Wolfram

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[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-110], N[(N[Sqrt[N[(-8.0 * N[(N[(A * C), $MachinePrecision] * N[(F * N[(A + A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-N[(C * N[(A * -4.0), $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-110

   1. Initial program 22.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} \]

   3. Simplified 27.3%

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

   5. Taylor expanded in C around inf 30.3%

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

      1. associate-*r* 30.5%

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

      2. *-commutative 30.5%

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

      3. mul-1-neg 30.5%

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

   7. Simplified 30.5%

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

   if 2.0000000000000001e-110 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 21.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 C around 0 15.9%

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

      1. mul-1-neg 15.9%

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

      2. +-commutative 15.9%

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

      3. unpow2 15.9%

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

      4. unpow2 15.9%

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

      5. hypot-define 28.2%

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

   5. Simplified 28.2%

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

4. Final simplification 29.0%

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

Alternative 8: 40.6% accurate, 2.0× speedup

Math

\[\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}\;C \leq 1.2 \cdot 10^{+45}:\\ \;\;\;\;\sqrt{F \cdot \left(A - \mathsf{hypot}\left(B\_m, A\right)\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\\ \end{array} \end{array} \]

FPCore

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 (<= C 1.2e+45)
   (* (sqrt (* F (- A (hypot B_m A)))) (/ (sqrt 2.0) (- B_m)))
   (- (sqrt (* 2.0 (* F (/ -0.5 C)))))))

C

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 (C <= 1.2e+45) {
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	} else {
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Java

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 (C <= 1.2e+45) {
		tmp = Math.sqrt((F * (A - Math.hypot(B_m, A)))) * (Math.sqrt(2.0) / -B_m);
	} else {
		tmp = -Math.sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Python

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 C <= 1.2e+45:
		tmp = math.sqrt((F * (A - math.hypot(B_m, A)))) * (math.sqrt(2.0) / -B_m)
	else:
		tmp = -math.sqrt((2.0 * (F * (-0.5 / C))))
	return tmp

Julia

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 (C <= 1.2e+45)
		tmp = Float64(sqrt(Float64(F * Float64(A - hypot(B_m, A)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	else
		tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(-0.5 / C)))));
	end
	return tmp
end

MATLAB

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 (C <= 1.2e+45)
		tmp = sqrt((F * (A - hypot(B_m, A)))) * (sqrt(2.0) / -B_m);
	else
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	end
	tmp_2 = tmp;
end

Wolfram

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[C, 1.2e+45], N[(N[Sqrt[N[(F * N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(2.0 * N[(F * N[(-0.5 / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if C < 1.19999999999999995e45

   1. Initial program 27.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 C around 0 12.7%

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

      1. mul-1-neg 12.7%

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

      2. +-commutative 12.7%

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

      3. unpow2 12.7%

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

      4. unpow2 12.7%

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

      5. hypot-define 21.0%

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

   5. Simplified 21.0%

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

   if 1.19999999999999995e45 < C

   1. Initial program 2.7%

      \[\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 5.6%

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

      1. mul-1-neg 5.6%

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

      2. *-commutative 5.6%

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

      3. associate-/l* 8.9%

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

      4. associate--l+ 9.5%

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

      5. unpow2 9.5%

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

      6. unpow2 9.5%

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

      7. hypot-undefine 13.3%

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

      8. cancel-sign-sub-inv 13.3%

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

   5. Simplified 13.3%

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

   6. Taylor expanded in A around -inf 32.8%

      \[\leadsto -\sqrt{2} \cdot \sqrt{F \cdot \color{blue}{\frac{-0.5}{C}}} \]
   7. Step-by-step derivation

      1. pow1 32.8%

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

      2. sqrt-unprod 33.0%

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

   8. Applied egg-rr 33.0%

      \[\leadsto -\color{blue}{{\left(\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\right)}^{1}} \]
   9. Step-by-step derivation

      1. unpow1 33.0%

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

   10. Simplified 33.0%

       \[\leadsto -\color{blue}{\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 23.7%

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

Alternative 9: 36.4% accurate, 2.9× speedup

Math

\[\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}\;C \leq 6 \cdot 10^{+42}:\\ \;\;\;\;\sqrt{F \cdot \frac{\left(\frac{A}{B\_m} + \frac{C}{B\_m}\right) + -1}{B\_m}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\\ \end{array} \end{array} \]

FPCore

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 (<= C 6e+42)
   (* (sqrt (* F (/ (+ (+ (/ A B_m) (/ C B_m)) -1.0) B_m))) (- (sqrt 2.0)))
   (- (sqrt (* 2.0 (* F (/ -0.5 C)))))))

C

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 (C <= 6e+42) {
		tmp = sqrt((F * ((((A / B_m) + (C / B_m)) + -1.0) / B_m))) * -sqrt(2.0);
	} else {
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Fortran

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 (c <= 6d+42) then
        tmp = sqrt((f * ((((a / b_m) + (c / b_m)) + (-1.0d0)) / b_m))) * -sqrt(2.0d0)
    else
        tmp = -sqrt((2.0d0 * (f * ((-0.5d0) / c))))
    end if
    code = tmp
end function

Java

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 (C <= 6e+42) {
		tmp = Math.sqrt((F * ((((A / B_m) + (C / B_m)) + -1.0) / B_m))) * -Math.sqrt(2.0);
	} else {
		tmp = -Math.sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Python

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 C <= 6e+42:
		tmp = math.sqrt((F * ((((A / B_m) + (C / B_m)) + -1.0) / B_m))) * -math.sqrt(2.0)
	else:
		tmp = -math.sqrt((2.0 * (F * (-0.5 / C))))
	return tmp

Julia

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 (C <= 6e+42)
		tmp = Float64(sqrt(Float64(F * Float64(Float64(Float64(Float64(A / B_m) + Float64(C / B_m)) + -1.0) / B_m))) * Float64(-sqrt(2.0)));
	else
		tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(-0.5 / C)))));
	end
	return tmp
end

MATLAB

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 (C <= 6e+42)
		tmp = sqrt((F * ((((A / B_m) + (C / B_m)) + -1.0) / B_m))) * -sqrt(2.0);
	else
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	end
	tmp_2 = tmp;
end

Wolfram

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[C, 6e+42], N[(N[Sqrt[N[(F * N[(N[(N[(N[(A / B$95$m), $MachinePrecision] + N[(C / B$95$m), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], (-N[Sqrt[N[(2.0 * N[(F * N[(-0.5 / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if C < 6.00000000000000058e42

   1. Initial program 27.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 F around 0 28.4%

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

      1. mul-1-neg 28.4%

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

      2. *-commutative 28.4%

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

      3. associate-/l* 31.2%

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

      4. associate--l+ 31.4%

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

      5. unpow2 31.4%

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

      6. unpow2 31.4%

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

      7. hypot-undefine 37.9%

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

      8. cancel-sign-sub-inv 37.9%

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

   5. Simplified 37.9%

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

   6. Taylor expanded in B around inf 20.8%

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

   if 6.00000000000000058e42 < C

   1. Initial program 2.7%

      \[\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 5.6%

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

      1. mul-1-neg 5.6%

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

      2. *-commutative 5.6%

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

      3. associate-/l* 8.9%

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

      4. associate--l+ 9.5%

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

      5. unpow2 9.5%

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

      6. unpow2 9.5%

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

      7. hypot-undefine 13.3%

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

      8. cancel-sign-sub-inv 13.3%

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

   5. Simplified 13.3%

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

   6. Taylor expanded in A around -inf 32.8%

      \[\leadsto -\sqrt{2} \cdot \sqrt{F \cdot \color{blue}{\frac{-0.5}{C}}} \]
   7. Step-by-step derivation

      1. pow1 32.8%

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

      2. sqrt-unprod 33.0%

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

   8. Applied egg-rr 33.0%

      \[\leadsto -\color{blue}{{\left(\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\right)}^{1}} \]
   9. Step-by-step derivation

      1. unpow1 33.0%

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

   10. Simplified 33.0%

       \[\leadsto -\color{blue}{\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 23.5%

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

Alternative 10: 35.4% accurate, 3.0× speedup

Math

\[\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}\;C \leq 2.7 \cdot 10^{+44}:\\ \;\;\;\;\sqrt{B\_m \cdot \left(-F\right)} \cdot \frac{\sqrt{2}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\\ \end{array} \end{array} \]

FPCore

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 (<= C 2.7e+44)
   (* (sqrt (* B_m (- F))) (/ (sqrt 2.0) (- B_m)))
   (- (sqrt (* 2.0 (* F (/ -0.5 C)))))))

C

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 (C <= 2.7e+44) {
		tmp = sqrt((B_m * -F)) * (sqrt(2.0) / -B_m);
	} else {
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Fortran

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 (c <= 2.7d+44) then
        tmp = sqrt((b_m * -f)) * (sqrt(2.0d0) / -b_m)
    else
        tmp = -sqrt((2.0d0 * (f * ((-0.5d0) / c))))
    end if
    code = tmp
end function

Java

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 (C <= 2.7e+44) {
		tmp = Math.sqrt((B_m * -F)) * (Math.sqrt(2.0) / -B_m);
	} else {
		tmp = -Math.sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Python

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 C <= 2.7e+44:
		tmp = math.sqrt((B_m * -F)) * (math.sqrt(2.0) / -B_m)
	else:
		tmp = -math.sqrt((2.0 * (F * (-0.5 / C))))
	return tmp

Julia

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 (C <= 2.7e+44)
		tmp = Float64(sqrt(Float64(B_m * Float64(-F))) * Float64(sqrt(2.0) / Float64(-B_m)));
	else
		tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(-0.5 / C)))));
	end
	return tmp
end

MATLAB

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 (C <= 2.7e+44)
		tmp = sqrt((B_m * -F)) * (sqrt(2.0) / -B_m);
	else
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	end
	tmp_2 = tmp;
end

Wolfram

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[C, 2.7e+44], N[(N[Sqrt[N[(B$95$m * (-F)), $MachinePrecision]], $MachinePrecision] * N[(N[Sqrt[2.0], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(2.0 * N[(F * N[(-0.5 / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if C < 2.7e44

   1. Initial program 27.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 12.8%

      \[\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-neg 12.8%

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

      2. unpow2 12.8%

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

      3. unpow2 12.8%

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

      4. hypot-define 20.4%

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

   5. Simplified 20.4%

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

   6. Taylor expanded in C around 0 18.6%

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

      1. mul-1-neg 18.6%

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

   8. Simplified 18.6%

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

   if 2.7e44 < C

   1. Initial program 2.7%

      \[\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 5.6%

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

      1. mul-1-neg 5.6%

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

      2. *-commutative 5.6%

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

      3. associate-/l* 8.9%

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

      4. associate--l+ 9.5%

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

      5. unpow2 9.5%

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

      6. unpow2 9.5%

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

      7. hypot-undefine 13.3%

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

      8. cancel-sign-sub-inv 13.3%

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

   5. Simplified 13.3%

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

   6. Taylor expanded in A around -inf 32.8%

      \[\leadsto -\sqrt{2} \cdot \sqrt{F \cdot \color{blue}{\frac{-0.5}{C}}} \]
   7. Step-by-step derivation

      1. pow1 32.8%

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

      2. sqrt-unprod 33.0%

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

   8. Applied egg-rr 33.0%

      \[\leadsto -\color{blue}{{\left(\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\right)}^{1}} \]
   9. Step-by-step derivation

      1. unpow1 33.0%

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

   10. Simplified 33.0%

       \[\leadsto -\color{blue}{\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 21.8%

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

Alternative 11: 35.9% accurate, 5.6× speedup

Math

\[\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}\;C \leq 1.3 \cdot 10^{+57}:\\ \;\;\;\;-\sqrt{\frac{2 \cdot F}{-B\_m}}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\\ \end{array} \end{array} \]

FPCore

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 (<= C 1.3e+57)
   (- (sqrt (/ (* 2.0 F) (- B_m))))
   (- (sqrt (* 2.0 (* F (/ -0.5 C)))))))

C

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 (C <= 1.3e+57) {
		tmp = -sqrt(((2.0 * F) / -B_m));
	} else {
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Fortran

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 (c <= 1.3d+57) then
        tmp = -sqrt(((2.0d0 * f) / -b_m))
    else
        tmp = -sqrt((2.0d0 * (f * ((-0.5d0) / c))))
    end if
    code = tmp
end function

Java

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 (C <= 1.3e+57) {
		tmp = -Math.sqrt(((2.0 * F) / -B_m));
	} else {
		tmp = -Math.sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Python

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 C <= 1.3e+57:
		tmp = -math.sqrt(((2.0 * F) / -B_m))
	else:
		tmp = -math.sqrt((2.0 * (F * (-0.5 / C))))
	return tmp

Julia

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 (C <= 1.3e+57)
		tmp = Float64(-sqrt(Float64(Float64(2.0 * F) / Float64(-B_m))));
	else
		tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(-0.5 / C)))));
	end
	return tmp
end

MATLAB

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 (C <= 1.3e+57)
		tmp = -sqrt(((2.0 * F) / -B_m));
	else
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	end
	tmp_2 = tmp;
end

Wolfram

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[C, 1.3e+57], (-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] / (-B$95$m)), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(2.0 * N[(F * N[(-0.5 / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if C < 1.3e57

   1. Initial program 27.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 F around 0 28.0%

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

      1. mul-1-neg 28.0%

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

      2. *-commutative 28.0%

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

      3. associate-/l* 30.8%

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

      4. associate--l+ 30.9%

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

      5. unpow2 30.9%

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

      6. unpow2 30.9%

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

      7. hypot-undefine 37.5%

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

      8. cancel-sign-sub-inv 37.5%

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

   5. Simplified 37.5%

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

   6. Taylor expanded in B around inf 19.8%

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

      1. pow1 19.8%

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

      2. sqrt-unprod 19.9%

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

      3. associate-*r/ 19.9%

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

   8. Applied egg-rr 19.9%

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

      1. unpow1 19.9%

         \[\leadsto -\color{blue}{\sqrt{2 \cdot \frac{F \cdot -1}{B}}} \]

      2. associate-*r/ 19.9%

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

   10. Simplified 19.9%

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

   if 1.3e57 < C

   1. Initial program 2.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 F around 0 5.8%

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

      1. mul-1-neg 5.8%

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

      2. *-commutative 5.8%

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

      3. associate-/l* 9.4%

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

      4. associate--l+ 9.9%

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

      5. unpow2 9.9%

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

      6. unpow2 9.9%

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

      7. hypot-undefine 13.8%

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

      8. cancel-sign-sub-inv 13.8%

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

   5. Simplified 13.8%

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

   6. Taylor expanded in A around -inf 34.3%

      \[\leadsto -\sqrt{2} \cdot \sqrt{F \cdot \color{blue}{\frac{-0.5}{C}}} \]
   7. Step-by-step derivation

      1. pow1 34.3%

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

      2. sqrt-unprod 34.5%

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

   8. Applied egg-rr 34.5%

      \[\leadsto -\color{blue}{{\left(\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\right)}^{1}} \]
   9. Step-by-step derivation

      1. unpow1 34.5%

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

   10. Simplified 34.5%

       \[\leadsto -\color{blue}{\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 23.0%

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

Alternative 12: 35.9% accurate, 5.6× speedup

Math

\[\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}\;C \leq 2.4 \cdot 10^{+57}:\\ \;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{-1}{B\_m}\right)}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\\ \end{array} \end{array} \]

FPCore

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 (<= C 2.4e+57)
   (- (sqrt (* 2.0 (* F (/ -1.0 B_m)))))
   (- (sqrt (* 2.0 (* F (/ -0.5 C)))))))

C

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 (C <= 2.4e+57) {
		tmp = -sqrt((2.0 * (F * (-1.0 / B_m))));
	} else {
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Fortran

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 (c <= 2.4d+57) then
        tmp = -sqrt((2.0d0 * (f * ((-1.0d0) / b_m))))
    else
        tmp = -sqrt((2.0d0 * (f * ((-0.5d0) / c))))
    end if
    code = tmp
end function

Java

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 (C <= 2.4e+57) {
		tmp = -Math.sqrt((2.0 * (F * (-1.0 / B_m))));
	} else {
		tmp = -Math.sqrt((2.0 * (F * (-0.5 / C))));
	}
	return tmp;
}

Python

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 C <= 2.4e+57:
		tmp = -math.sqrt((2.0 * (F * (-1.0 / B_m))))
	else:
		tmp = -math.sqrt((2.0 * (F * (-0.5 / C))))
	return tmp

Julia

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 (C <= 2.4e+57)
		tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(-1.0 / B_m)))));
	else
		tmp = Float64(-sqrt(Float64(2.0 * Float64(F * Float64(-0.5 / C)))));
	end
	return tmp
end

MATLAB

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 (C <= 2.4e+57)
		tmp = -sqrt((2.0 * (F * (-1.0 / B_m))));
	else
		tmp = -sqrt((2.0 * (F * (-0.5 / C))));
	end
	tmp_2 = tmp;
end

Wolfram

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[C, 2.4e+57], (-N[Sqrt[N[(2.0 * N[(F * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), (-N[Sqrt[N[(2.0 * N[(F * N[(-0.5 / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if C < 2.40000000000000005e57

   1. Initial program 27.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 F around 0 28.0%

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

      1. mul-1-neg 28.0%

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

      2. *-commutative 28.0%

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

      3. associate-/l* 30.8%

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

      4. associate--l+ 30.9%

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

      5. unpow2 30.9%

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

      6. unpow2 30.9%

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

      7. hypot-undefine 37.5%

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

      8. cancel-sign-sub-inv 37.5%

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

   5. Simplified 37.5%

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

   6. Taylor expanded in B around inf 19.8%

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

      1. *-commutative 19.8%

         \[\leadsto -\color{blue}{\sqrt{F \cdot \frac{-1}{B}} \cdot \sqrt{2}} \]

      2. pow1/2 20.1%

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

      3. pow1/2 20.1%

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

      4. pow-prod-down 20.2%

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

      5. associate-*r/ 20.2%

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

   8. Applied egg-rr 20.2%

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

      1. unpow1/2 19.9%

         \[\leadsto -\color{blue}{\sqrt{\frac{F \cdot -1}{B} \cdot 2}} \]

      2. associate-/l* 19.9%

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

   10. Simplified 19.9%

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

   if 2.40000000000000005e57 < C

   1. Initial program 2.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 F around 0 5.8%

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

      1. mul-1-neg 5.8%

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

      2. *-commutative 5.8%

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

      3. associate-/l* 9.4%

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

      4. associate--l+ 9.9%

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

      5. unpow2 9.9%

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

      6. unpow2 9.9%

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

      7. hypot-undefine 13.8%

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

      8. cancel-sign-sub-inv 13.8%

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

   5. Simplified 13.8%

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

   6. Taylor expanded in A around -inf 34.3%

      \[\leadsto -\sqrt{2} \cdot \sqrt{F \cdot \color{blue}{\frac{-0.5}{C}}} \]
   7. Step-by-step derivation

      1. pow1 34.3%

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

      2. sqrt-unprod 34.5%

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

   8. Applied egg-rr 34.5%

      \[\leadsto -\color{blue}{{\left(\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\right)}^{1}} \]
   9. Step-by-step derivation

      1. unpow1 34.5%

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

   10. Simplified 34.5%

       \[\leadsto -\color{blue}{\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 23.0%

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

Alternative 13: 27.5% accurate, 5.9× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ -\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)} \end{array} \]

FPCore

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 (/ -0.5 C))))))

C

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 * (-0.5 / C))));
}

Fortran

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 * ((-0.5d0) / c))))
end function

Java

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 * (-0.5 / C))));
}

Python

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 * (-0.5 / C))))

Julia

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 * Float64(F * Float64(-0.5 / C)))))
end

MATLAB

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 * (-0.5 / C))));
end

Wolfram

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[(2.0 * N[(F * N[(-0.5 / C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 22.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 23.3%

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

   1. mul-1-neg 23.3%

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

   2. *-commutative 23.3%

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

   3. associate-/l* 26.3%

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

   4. associate--l+ 26.5%

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

   5. unpow2 26.5%

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

   6. unpow2 26.5%

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

   7. hypot-undefine 32.5%

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

   8. cancel-sign-sub-inv 32.5%

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

5. Simplified 32.5%

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

6. Taylor expanded in A around -inf 11.9%

   \[\leadsto -\sqrt{2} \cdot \sqrt{F \cdot \color{blue}{\frac{-0.5}{C}}} \]
7. Step-by-step derivation

   1. pow1 11.9%

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

   2. sqrt-unprod 12.0%

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

8. Applied egg-rr 12.0%

   \[\leadsto -\color{blue}{{\left(\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}\right)}^{1}} \]
9. Step-by-step derivation

   1. unpow1 12.0%

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

10. Simplified 12.0%

    \[\leadsto -\color{blue}{\sqrt{2 \cdot \left(F \cdot \frac{-0.5}{C}\right)}} \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2024091 
(FPCore (A B C F)
  :name "ABCF->ab-angle b"
  :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))))