ABCF->ab-angle b

Percentage Accurate: 19.3% → 53.2%

Time: 14.7s

Alternatives: 12

Speedup: 12.3×

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: 19.3% 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: 53.2% accurate, 0.3× 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{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\ t_1 := -t\_0\\ t_2 := \left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\\ t_3 := C \cdot \left(A \cdot 4\right)\\ t_4 := \frac{\sqrt{\left(\left(C + A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_3\right)\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\ \mathbf{if}\;t\_4 \leq -\infty:\\ \;\;\;\;-\sqrt{\left(\frac{t\_2}{\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)} \cdot F\right) \cdot 2}\\ \mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-217}:\\ \;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(F \cdot 2\right)\right) \cdot t\_2}}{t\_1}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(\frac{B\_m \cdot B\_m}{C}, -0.5, A \cdot 2\right) \cdot \left(F \cdot 2\right)\right) \cdot t\_0}}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F\right) \cdot 2} \cdot \frac{-1}{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 (fma -4.0 (* C A) (* B_m B_m)))
        (t_1 (- t_0))
        (t_2 (- (+ C A) (hypot (- A C) B_m)))
        (t_3 (* C (* A 4.0)))
        (t_4
         (/
          (sqrt
           (*
            (- (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* F (- (pow B_m 2.0) t_3)) 2.0)))
          (- t_3 (pow B_m 2.0)))))
   (if (<= t_4 (- INFINITY))
     (- (sqrt (* (* (/ t_2 (fma (* C A) -4.0 (* B_m B_m))) F) 2.0)))
     (if (<= t_4 -2e-217)
       (/ (sqrt (* (* t_0 (* F 2.0)) t_2)) t_1)
       (if (<= t_4 INFINITY)
         (/
          (sqrt (* (* (fma (/ (* B_m B_m) C) -0.5 (* A 2.0)) (* F 2.0)) t_0))
          t_1)
         (* (sqrt (* (* (- A (hypot A B_m)) F) 2.0)) (/ -1.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 = fma(-4.0, (C * A), (B_m * B_m));
	double t_1 = -t_0;
	double t_2 = (C + A) - hypot((A - C), B_m);
	double t_3 = C * (A * 4.0);
	double t_4 = sqrt((((C + A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_3)) * 2.0))) / (t_3 - pow(B_m, 2.0));
	double tmp;
	if (t_4 <= -((double) INFINITY)) {
		tmp = -sqrt((((t_2 / fma((C * A), -4.0, (B_m * B_m))) * F) * 2.0));
	} else if (t_4 <= -2e-217) {
		tmp = sqrt(((t_0 * (F * 2.0)) * t_2)) / t_1;
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = sqrt(((fma(((B_m * B_m) / C), -0.5, (A * 2.0)) * (F * 2.0)) * t_0)) / t_1;
	} else {
		tmp = sqrt((((A - hypot(A, B_m)) * F) * 2.0)) * (-1.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 = fma(-4.0, Float64(C * A), Float64(B_m * B_m))
	t_1 = Float64(-t_0)
	t_2 = Float64(Float64(C + A) - hypot(Float64(A - C), B_m))
	t_3 = Float64(C * Float64(A * 4.0))
	t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_3)) * 2.0))) / Float64(t_3 - (B_m ^ 2.0)))
	tmp = 0.0
	if (t_4 <= Float64(-Inf))
		tmp = Float64(-sqrt(Float64(Float64(Float64(t_2 / fma(Float64(C * A), -4.0, Float64(B_m * B_m))) * F) * 2.0)));
	elseif (t_4 <= -2e-217)
		tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * t_2)) / t_1);
	elseif (t_4 <= Inf)
		tmp = Float64(sqrt(Float64(Float64(fma(Float64(Float64(B_m * B_m) / C), -0.5, Float64(A * 2.0)) * Float64(F * 2.0)) * t_0)) / t_1);
	else
		tmp = Float64(sqrt(Float64(Float64(Float64(A - hypot(A, B_m)) * F) * 2.0)) * Float64(-1.0 / 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[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-t$95$0)}, Block[{t$95$2 = N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], (-N[Sqrt[N[(N[(N[(t$95$2 / N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), If[LessEqual[t$95$4, -2e-217], N[(N[Sqrt[N[(N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] * -0.5 + N[(A * 2.0), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / B$95$m), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 3.3%

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

   3. Taylor expanded in F around 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 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\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)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\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)}}}\right) \]

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

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \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)}}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \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)}}} \]

      5. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\sqrt{2}\right)} \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)}} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\color{blue}{\sqrt{2}}\right) \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)}} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\sqrt{2}\right) \cdot \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)}}} \]

      8. associate-/l* N/A

         \[\leadsto \left(-\sqrt{2}\right) \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)}}} \]

      9. lower-*.f64 N/A

         \[\leadsto \left(-\sqrt{2}\right) \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)}}} \]

   5. Applied rewrites 61.3%

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

   7. Applied rewrites 61.5%

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

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

   1. Initial program 99.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. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\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. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.5%

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

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

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

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

      1. sub-neg N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + \left(\mathsf{neg}\left(-1 \cdot A\right)\right)\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 32.6

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

   5. Applied rewrites 32.6%

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

   7. Applied rewrites 32.5%

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

   9. Applied rewrites 32.6%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in C around 0

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 19.9

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

   5. Applied rewrites 19.9%

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

   7. Applied rewrites 20.0%

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

   9. Applied rewrites 20.0%

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

4. Final simplification 44.1%

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

Alternative 2: 46.0% accurate, 1.3× 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{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 4 \cdot 10^{-323}:\\ \;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \left(A \cdot 2\right)}}{-t\_0}\\ \mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+199}:\\ \;\;\;\;-\sqrt{\left(\frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_0} \cdot F\right) \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F\right) \cdot 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 (fma (* C A) -4.0 (* B_m B_m))))
   (if (<= (pow B_m 2.0) 4e-323)
     (/ (sqrt (* (* (* t_0 F) 2.0) (* A 2.0))) (- t_0))
     (if (<= (pow B_m 2.0) 5e+199)
       (- (sqrt (* (* (/ (- (+ C A) (hypot (- A C) B_m)) t_0) F) 2.0)))
       (/ (sqrt (* (* (- A (hypot A B_m)) F) 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 = fma((C * A), -4.0, (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 4e-323) {
		tmp = sqrt((((t_0 * F) * 2.0) * (A * 2.0))) / -t_0;
	} else if (pow(B_m, 2.0) <= 5e+199) {
		tmp = -sqrt((((((C + A) - hypot((A - C), B_m)) / t_0) * F) * 2.0));
	} else {
		tmp = sqrt((((A - hypot(A, B_m)) * F) * 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 = fma(Float64(C * A), -4.0, Float64(B_m * B_m))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 4e-323)
		tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * Float64(A * 2.0))) / Float64(-t_0));
	elseif ((B_m ^ 2.0) <= 5e+199)
		tmp = Float64(-sqrt(Float64(Float64(Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / t_0) * F) * 2.0)));
	else
		tmp = Float64(sqrt(Float64(Float64(Float64(A - hypot(A, B_m)) * F) * 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[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 4e-323], N[(N[Sqrt[N[(N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(A * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+199], (-N[Sqrt[N[(N[(N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]), N[(N[Sqrt[N[(N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 3.95253e-323

   1. Initial program 21.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 C around inf

      \[\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(A - -1 \cdot A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   4. Step-by-step derivation

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

         \[\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(A + \left(\mathsf{neg}\left(-1\right)\right) \cdot A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower-+.f64 26.3

         \[\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(A + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   5. Applied rewrites 26.3%

      \[\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(A + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

   7. Applied rewrites 26.3%

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

   if 3.95253e-323 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999998e199

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

      \[\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 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\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)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\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)}}}\right) \]

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

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \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)}}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \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)}}} \]

      5. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\sqrt{2}\right)} \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)}} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\color{blue}{\sqrt{2}}\right) \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)}} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\sqrt{2}\right) \cdot \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)}}} \]

      8. associate-/l* N/A

         \[\leadsto \left(-\sqrt{2}\right) \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)}}} \]

      9. lower-*.f64 N/A

         \[\leadsto \left(-\sqrt{2}\right) \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)}}} \]

   5. Applied rewrites 47.9%

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

   7. Applied rewrites 48.0%

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

   if 4.9999999999999998e199 < (pow.f64 B #s(literal 2 binary64))

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

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 29.4

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

   5. Applied rewrites 29.4%

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

   7. Applied rewrites 29.5%

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

4. Final simplification 35.8%

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

Alternative 3: 47.0% 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} t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-35}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A \cdot 2\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\left(A - \mathsf{hypot}\left(A, B\_m\right)\right) \cdot F\right) \cdot 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 (fma (* C A) -4.0 (* B_m B_m))))
   (if (<= (pow B_m 2.0) 5e-35)
     (/
      (sqrt (* (fma -0.5 (/ (* B_m B_m) C) (* A 2.0)) (* (* t_0 F) 2.0)))
      (- t_0))
     (/ (sqrt (* (* (- A (hypot A B_m)) F) 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 = fma((C * A), -4.0, (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 5e-35) {
		tmp = sqrt((fma(-0.5, ((B_m * B_m) / C), (A * 2.0)) * ((t_0 * F) * 2.0))) / -t_0;
	} else {
		tmp = sqrt((((A - hypot(A, B_m)) * F) * 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 = fma(Float64(C * A), -4.0, Float64(B_m * B_m))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-35)
		tmp = Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), Float64(A * 2.0)) * Float64(Float64(t_0 * F) * 2.0))) / Float64(-t_0));
	else
		tmp = Float64(sqrt(Float64(Float64(Float64(A - hypot(A, B_m)) * F) * 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[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-35], N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + N[(A * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(N[(N[(A - N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999964e-35

   1. Initial program 20.0%

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

   3. Taylor expanded in C around inf

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

      1. sub-neg N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + \left(\mathsf{neg}\left(-1 \cdot A\right)\right)\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 20.0

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

   5. Applied rewrites 20.0%

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

   7. Applied rewrites 20.0%

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

   if 4.99999999999999964e-35 < (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

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 27.9

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

   5. Applied rewrites 27.9%

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

   7. Applied rewrites 28.1%

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

Alternative 4: 43.7% accurate, 2.4× 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{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-35}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A \cdot 2\right) \cdot \left(\left(t\_0 \cdot F\right) \cdot 2\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-2, F \cdot B\_m, \left(F \cdot A\right) \cdot 2\right)}}{-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 (fma (* C A) -4.0 (* B_m B_m))))
   (if (<= (pow B_m 2.0) 5e-35)
     (/
      (sqrt (* (fma -0.5 (/ (* B_m B_m) C) (* A 2.0)) (* (* t_0 F) 2.0)))
      (- t_0))
     (/ (sqrt (fma -2.0 (* F B_m) (* (* F A) 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 = fma((C * A), -4.0, (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 5e-35) {
		tmp = sqrt((fma(-0.5, ((B_m * B_m) / C), (A * 2.0)) * ((t_0 * F) * 2.0))) / -t_0;
	} else {
		tmp = sqrt(fma(-2.0, (F * B_m), ((F * A) * 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 = fma(Float64(C * A), -4.0, Float64(B_m * B_m))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-35)
		tmp = Float64(sqrt(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), Float64(A * 2.0)) * Float64(Float64(t_0 * F) * 2.0))) / Float64(-t_0));
	else
		tmp = Float64(sqrt(fma(-2.0, Float64(F * B_m), Float64(Float64(F * A) * 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[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-35], N[(N[Sqrt[N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + N[(A * 2.0), $MachinePrecision]), $MachinePrecision] * N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(F * B$95$m), $MachinePrecision] + N[(N[(F * A), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999964e-35

   1. Initial program 20.0%

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

   3. Taylor expanded in C around inf

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

      1. sub-neg N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + \left(\mathsf{neg}\left(-1 \cdot A\right)\right)\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 20.0

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

   5. Applied rewrites 20.0%

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

   7. Applied rewrites 20.0%

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

   if 4.99999999999999964e-35 < (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

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 27.9

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

   5. Applied rewrites 27.9%

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

   7. Applied rewrites 28.1%

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

   8. Taylor expanded in A around 0

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

   10. Applied rewrites 24.4%

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

4. Final simplification 22.6%

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

Alternative 5: 42.2% accurate, 2.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 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-133}:\\ \;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \left(A \cdot 2\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-2, F \cdot B\_m, \left(F \cdot A\right) \cdot 2\right)}}{-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 (fma (* C A) -4.0 (* B_m B_m))))
   (if (<= (pow B_m 2.0) 2e-133)
     (/ (sqrt (* (* (* t_0 F) 2.0) (* A 2.0))) (- t_0))
     (/ (sqrt (fma -2.0 (* F B_m) (* (* F A) 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 = fma((C * A), -4.0, (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 2e-133) {
		tmp = sqrt((((t_0 * F) * 2.0) * (A * 2.0))) / -t_0;
	} else {
		tmp = sqrt(fma(-2.0, (F * B_m), ((F * A) * 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 = fma(Float64(C * A), -4.0, Float64(B_m * B_m))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 2e-133)
		tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * Float64(A * 2.0))) / Float64(-t_0));
	else
		tmp = Float64(sqrt(fma(-2.0, Float64(F * B_m), Float64(Float64(F * A) * 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[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-133], N[(N[Sqrt[N[(N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(A * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(F * B$95$m), $MachinePrecision] + N[(N[(F * A), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

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

      \[\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(A - -1 \cdot A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   4. Step-by-step derivation

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

         \[\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(A + \left(\mathsf{neg}\left(-1\right)\right) \cdot A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower-+.f64 23.9

         \[\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(A + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   5. Applied rewrites 23.9%

      \[\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(A + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   6. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

   7. Applied rewrites 23.9%

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

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

   1. Initial program 21.3%

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

   3. Taylor expanded in C around 0

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 25.6

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

   5. Applied rewrites 25.6%

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

   7. Applied rewrites 25.7%

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

   8. Taylor expanded in A around 0

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

   10. Applied rewrites 22.3%

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

4. Final simplification 22.8%

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

Alternative 6: 42.8% accurate, 2.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} \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-35}:\\ \;\;\;\;\frac{-1}{\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)} \cdot \sqrt{\left(\left(A + A\right) \cdot F\right) \cdot \left(\left(-8 \cdot A\right) \cdot C\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-2, F \cdot B\_m, \left(F \cdot A\right) \cdot 2\right)}}{-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) 5e-35)
   (*
    (/ -1.0 (fma (* C A) -4.0 (* B_m B_m)))
    (sqrt (* (* (+ A A) F) (* (* -8.0 A) C))))
   (/ (sqrt (fma -2.0 (* F B_m) (* (* F A) 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) <= 5e-35) {
		tmp = (-1.0 / fma((C * A), -4.0, (B_m * B_m))) * sqrt((((A + A) * F) * ((-8.0 * A) * C)));
	} else {
		tmp = sqrt(fma(-2.0, (F * B_m), ((F * A) * 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) <= 5e-35)
		tmp = Float64(Float64(-1.0 / fma(Float64(C * A), -4.0, Float64(B_m * B_m))) * sqrt(Float64(Float64(Float64(A + A) * F) * Float64(Float64(-8.0 * A) * C))));
	else
		tmp = Float64(sqrt(fma(-2.0, Float64(F * B_m), Float64(Float64(F * A) * 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], 5e-35], N[(N[(-1.0 / N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * N[(N[(-8.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(F * B$95$m), $MachinePrecision] + N[(N[(F * A), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999964e-35

   1. Initial program 20.0%

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

   3. Taylor expanded in C around inf

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

      1. sub-neg N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + \left(\mathsf{neg}\left(-1 \cdot A\right)\right)\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 20.0

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

   5. Applied rewrites 20.0%

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

   7. Applied rewrites 20.0%

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

   8. Taylor expanded in C around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 20.0

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

   10. Applied rewrites 20.0%

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

   12. Applied rewrites 20.9%

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

   if 4.99999999999999964e-35 < (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

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 27.9

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

   5. Applied rewrites 27.9%

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

   7. Applied rewrites 28.1%

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

   8. Taylor expanded in A around 0

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

   10. Applied rewrites 24.4%

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

4. Final simplification 22.9%

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

Alternative 7: 41.1% 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}\;{B\_m}^{2} \leq 5 \cdot 10^{-124}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\left(\left(A + A\right) \cdot F\right) \cdot C\right) \cdot A\right) \cdot -8}}{-\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-2, F \cdot B\_m, \left(F \cdot A\right) \cdot 2\right)}}{-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) 5e-124)
   (/
    (sqrt (* (* (* (* (+ A A) F) C) A) -8.0))
    (- (fma (* C A) -4.0 (* B_m B_m))))
   (/ (sqrt (fma -2.0 (* F B_m) (* (* F A) 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) <= 5e-124) {
		tmp = sqrt((((((A + A) * F) * C) * A) * -8.0)) / -fma((C * A), -4.0, (B_m * B_m));
	} else {
		tmp = sqrt(fma(-2.0, (F * B_m), ((F * A) * 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) <= 5e-124)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(Float64(A + A) * F) * C) * A) * -8.0)) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m))));
	else
		tmp = Float64(sqrt(fma(-2.0, Float64(F * B_m), Float64(Float64(F * A) * 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], 5e-124], N[(N[Sqrt[N[(N[(N[(N[(N[(A + A), $MachinePrecision] * F), $MachinePrecision] * C), $MachinePrecision] * A), $MachinePrecision] * -8.0), $MachinePrecision]], $MachinePrecision] / (-N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(F * B$95$m), $MachinePrecision] + N[(N[(F * A), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000003e-124

   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} \]
   2. Add Preprocessing

   3. Taylor expanded in C around inf

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

      1. sub-neg N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + \left(\mathsf{neg}\left(-1 \cdot A\right)\right)\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 23.6

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

   5. Applied rewrites 23.6%

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

   7. Applied rewrites 23.6%

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

   8. Taylor expanded in C around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 23.6

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

   10. Applied rewrites 23.6%

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

       1. lift-*.f64 N/A

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

       2. lift-/.f64 N/A

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

       3. frac-2neg N/A

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

       4. metadata-eval N/A

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

       5. lift-fma.f64 N/A

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

       6. *-commutative N/A

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

       7. lift-fma.f64 N/A

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

       8. un-div-inv N/A

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

   12. Applied rewrites 23.7%

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

   if 5.0000000000000003e-124 < (pow.f64 B #s(literal 2 binary64))

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

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 25.7

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

   5. Applied rewrites 25.7%

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

   7. Applied rewrites 25.8%

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

   8. Taylor expanded in A around 0

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

   10. Applied rewrites 22.4%

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

4. Final simplification 22.8%

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

Alternative 8: 34.8% accurate, 7.1× 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 \leq 2.55 \cdot 10^{-113}:\\ \;\;\;\;\sqrt{\left(F \cdot C\right) \cdot \left(\left(A \cdot A\right) \cdot -16\right)} \cdot \frac{-1}{\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-2, F \cdot B\_m, \left(F \cdot A\right) \cdot 2\right)}}{-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 (<= B_m 2.55e-113)
   (*
    (sqrt (* (* F C) (* (* A A) -16.0)))
    (/ -1.0 (fma (* C A) -4.0 (* B_m B_m))))
   (/ (sqrt (fma -2.0 (* F B_m) (* (* F A) 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 (B_m <= 2.55e-113) {
		tmp = sqrt(((F * C) * ((A * A) * -16.0))) * (-1.0 / fma((C * A), -4.0, (B_m * B_m)));
	} else {
		tmp = sqrt(fma(-2.0, (F * B_m), ((F * A) * 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.55e-113)
		tmp = Float64(sqrt(Float64(Float64(F * C) * Float64(Float64(A * A) * -16.0))) * Float64(-1.0 / fma(Float64(C * A), -4.0, Float64(B_m * B_m))));
	else
		tmp = Float64(sqrt(fma(-2.0, Float64(F * B_m), Float64(Float64(F * A) * 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[B$95$m, 2.55e-113], N[(N[Sqrt[N[(N[(F * C), $MachinePrecision] * N[(N[(A * A), $MachinePrecision] * -16.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(-1.0 / N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(-2.0 * N[(F * B$95$m), $MachinePrecision] + N[(N[(F * A), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < 2.54999999999999989e-113

   1. Initial program 22.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 C around inf

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

      1. sub-neg N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + \left(\mathsf{neg}\left(-1 \cdot A\right)\right)\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

         \[\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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) + A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. unpow2 N/A

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

      10. lower-*.f64 14.5

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

   5. Applied rewrites 14.5%

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

   7. Applied rewrites 14.5%

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

   8. Taylor expanded in A around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 9.8

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

   10. Applied rewrites 9.8%

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

   if 2.54999999999999989e-113 < B

   1. Initial program 18.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 C around 0

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 49.5

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

   5. Applied rewrites 49.5%

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

   7. Applied rewrites 49.8%

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

   8. Taylor expanded in A around 0

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

   10. Applied rewrites 45.4%

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

4. Final simplification 21.5%

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

Alternative 9: 27.9% accurate, 12.3× 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}\;A \leq -4.8 \cdot 10^{+206}:\\ \;\;\;\;\frac{\sqrt{F \cdot A} \cdot -2}{B\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot B\_m\right) \cdot -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 (<= A -4.8e+206)
   (/ (* (sqrt (* F A)) -2.0) B_m)
   (/ (sqrt (* (* F B_m) -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 (A <= -4.8e+206) {
		tmp = (sqrt((F * A)) * -2.0) / B_m;
	} else {
		tmp = sqrt(((F * B_m) * -2.0)) / -B_m;
	}
	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 (a <= (-4.8d+206)) then
        tmp = (sqrt((f * a)) * (-2.0d0)) / b_m
    else
        tmp = sqrt(((f * b_m) * (-2.0d0))) / -b_m
    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 (A <= -4.8e+206) {
		tmp = (Math.sqrt((F * A)) * -2.0) / B_m;
	} else {
		tmp = Math.sqrt(((F * B_m) * -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):
	tmp = 0
	if A <= -4.8e+206:
		tmp = (math.sqrt((F * A)) * -2.0) / B_m
	else:
		tmp = math.sqrt(((F * B_m) * -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 (A <= -4.8e+206)
		tmp = Float64(Float64(sqrt(Float64(F * A)) * -2.0) / B_m);
	else
		tmp = Float64(sqrt(Float64(Float64(F * B_m) * -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)
	tmp = 0.0;
	if (A <= -4.8e+206)
		tmp = (sqrt((F * A)) * -2.0) / B_m;
	else
		tmp = sqrt(((F * B_m) * -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_] := If[LessEqual[A, -4.8e+206], N[(N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / B$95$m), $MachinePrecision], N[(N[Sqrt[N[(N[(F * B$95$m), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if A < -4.7999999999999999e206

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

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 21.1

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

   5. Applied rewrites 21.1%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 15.4%

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

   10. Applied rewrites 15.4%

       \[\leadsto \frac{-2 \cdot \sqrt{F \cdot A}}{B} \]

   if -4.7999999999999999e206 < A

   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} \]
   2. Add Preprocessing

   3. Taylor expanded in C around 0

      \[\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. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. unpow2 N/A

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

      12. unpow2 N/A

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

      13. lower-hypot.f64 17.9

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

   5. Applied rewrites 17.9%

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

   7. Applied rewrites 17.9%

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

   8. Taylor expanded in A around 0

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

   10. Applied rewrites 16.6%

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

4. Final simplification 16.6%

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

Alternative 10: 8.5% accurate, 15.3× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \frac{\sqrt{F \cdot A} \cdot -2}{B\_m} \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 (* F A)) -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) {
	return (sqrt((F * A)) * -2.0) / B_m;
}

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((f * a)) * (-2.0d0)) / b_m
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((F * A)) * -2.0) / B_m;
}

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((F * A)) * -2.0) / B_m

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(Float64(sqrt(Float64(F * A)) * -2.0) / B_m)
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((F * A)) * -2.0) / B_m;
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[(N[(N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision] * -2.0), $MachinePrecision] / B$95$m), $MachinePrecision]

Derivation

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

   \[\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. associate-*r* N/A

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

   2. lower-*.f64 N/A

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

   3. mul-1-neg N/A

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

   4. lower-neg.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 N/A

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

   10. lower--.f64 N/A

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

   11. unpow2 N/A

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

   12. unpow2 N/A

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

   13. lower-hypot.f64 18.0

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

5. Applied rewrites 18.0%

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

6. Taylor expanded in A around -inf

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

8. Applied rewrites 3.1%

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

10. Applied rewrites 3.1%

    \[\leadsto \frac{-2 \cdot \sqrt{F \cdot A}}{B} \]

11. Final simplification 3.1%

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

Alternative 11: 8.5% accurate, 15.3× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \frac{-2}{B\_m} \cdot \sqrt{F \cdot A} \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 (* (/ -2.0 B_m) (sqrt (* F A))))

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 (-2.0 / B_m) * sqrt((F * A));
}

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 = ((-2.0d0) / b_m) * sqrt((f * a))
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 (-2.0 / B_m) * Math.sqrt((F * A));
}

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 (-2.0 / B_m) * math.sqrt((F * A))

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(Float64(-2.0 / B_m) * sqrt(Float64(F * A)))
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 = (-2.0 / B_m) * sqrt((F * A));
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[(N[(-2.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

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

   \[\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. associate-*r* N/A

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

   2. lower-*.f64 N/A

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

   3. mul-1-neg N/A

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

   4. lower-neg.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 N/A

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

   10. lower--.f64 N/A

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

   11. unpow2 N/A

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

   12. unpow2 N/A

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

   13. lower-hypot.f64 18.0

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

5. Applied rewrites 18.0%

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

6. Taylor expanded in A around -inf

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

8. Applied rewrites 3.1%

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

9. Final simplification 3.1%

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

Alternative 12: 1.5% accurate, 18.2× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \sqrt{\frac{F}{B\_m} \cdot 2} \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 (* (/ F B_m) 2.0)))

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(((F / B_m) * 2.0));
}

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(((f / b_m) * 2.0d0))
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(((F / B_m) * 2.0));
}

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(((F / B_m) * 2.0))

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	return sqrt(Float64(Float64(F / B_m) * 2.0))
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(((F / B_m) * 2.0));
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[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 21.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 B around -inf

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. *-commutative N/A

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

   7. unpow2 N/A

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

   8. rem-square-sqrt N/A

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

   9. lower-*.f64 N/A

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

   10. lower-sqrt.f64 N/A

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

   11. lower-sqrt.f64 N/A

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

   12. lower-/.f64 2.0

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

5. Applied rewrites 2.0%

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

7. Applied rewrites 2.0%

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

Reproduce

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