ABCF->ab-angle b

Percentage Accurate: 18.9% → 53.0%

Time: 15.6s

Alternatives: 15

Speedup: 14.4×

Specification

Math

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

FPCore

(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (- (pow B 2.0) (* (* 4.0 A) C))))
   (/
    (-
     (sqrt
      (*
       (* 2.0 (* t_0 F))
       (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))))
    t_0)))

C

double code(double A, double B, double C, double F) {
	double t_0 = pow(B, 2.0) - ((4.0 * A) * C);
	return -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_0;
}

Fortran

real(8) function code(a, b, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: t_0
    t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
    code = -sqrt(((2.0d0 * (t_0 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
end function

Java

public static double code(double A, double B, double C, double F) {
	double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
	return -Math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
}

Python

def code(A, B, C, F):
	t_0 = math.pow(B, 2.0) - ((4.0 * A) * C)
	return -math.sqrt(((2.0 * (t_0 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0

Julia

function code(A, B, C, F)
	t_0 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C))
	return Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_0)
end

MATLAB

function tmp = code(A, B, C, F)
	t_0 = (B ^ 2.0) - ((4.0 * A) * C);
	tmp = -sqrt(((2.0 * (t_0 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0;
end

Wolfram

code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Power[B, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision]]

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

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

   3. Taylor expanded in F around 0

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

      \[\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 \cdot A, C, 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))) < -1e-203

   1. Initial program 99.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. 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.0%

      \[\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 -1e-203 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0

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

   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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 12.6

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

   5. Applied rewrites 12.6%

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

   7. Applied rewrites 12.6%

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

4. Final simplification 40.2%

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

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

   3. Taylor expanded in F around 0

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

      \[\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 \cdot A, C, 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))) < -1e-203

   1. Initial program 99.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. 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.0%

      \[\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 -1e-203 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0

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

   4. Applied rewrites 1.9%

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

   6. Applied rewrites 21.9%

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

   7. Taylor expanded in C around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 42.0

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

   9. Applied rewrites 42.0%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) - \left(-A\right)\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 +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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 12.6

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

   5. Applied rewrites 12.6%

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

   7. Applied rewrites 12.6%

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

4. Final simplification 40.2%

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

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

   4. Applied rewrites 0.0%

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

   6. Applied rewrites 25.5%

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

   7. Taylor expanded in C around inf

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]
   8. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]

      2. mul-1-neg N/A

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

      3. lower-neg.f64 20.2

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

   9. Applied rewrites 20.2%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A - \left(-A\right)\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)} \]
   10. Step-by-step derivation

       1. lift-sqrt.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. *-commutative N/A

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

       4. lift-*.f64 N/A

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

       5. lift-*.f64 N/A

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

       6. associate-*l* N/A

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

       7. lift-fma.f64 N/A

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

       8. *-commutative N/A

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

       9. lift-fma.f64 N/A

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

       10. *-commutative N/A

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

       11. lift-*.f64 N/A

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

   11. Applied rewrites 25.7%

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

   if -1.00000000000000002e100 < (/.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))) < -1e-203

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

   4. Applied rewrites 0.0%

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

   6. Applied rewrites 98.9%

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

   7. Taylor expanded in B around inf

      \[\leadsto \frac{\sqrt{\color{blue}{\left(B \cdot \left(\left(\frac{A}{B} + \frac{C}{B}\right) - 1\right)\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)} \]
   8. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. associate--l+ N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 42.4

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

   9. Applied rewrites 42.4%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(B \cdot \left(\frac{A}{B} + \left(\frac{C}{B} - 1\right)\right)\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 -1e-203 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0

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

   4. Applied rewrites 1.9%

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

   6. Applied rewrites 21.9%

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

   7. Taylor expanded in C around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 42.0

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

   9. Applied rewrites 42.0%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) - \left(-A\right)\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 +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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 12.6

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

   5. Applied rewrites 12.6%

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

   7. Applied rewrites 12.6%

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

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

4. Final simplification 23.3%

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

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

   1. Initial program 40.1%

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

   3. Taylor expanded in F around 0

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

      \[\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 \cdot A, C, B \cdot B\right)}}} \]

   if -2.00000000000000013e-158 < (/.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.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

   4. Applied rewrites 1.9%

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

   6. Applied rewrites 25.5%

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

   7. Taylor expanded in C around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 41.7

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

   9. Applied rewrites 41.7%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) - \left(-A\right)\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 +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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 12.6

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

   5. Applied rewrites 12.6%

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

   7. Applied rewrites 12.6%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\sqrt{\left(\left(\left(C \cdot \left(A \cdot 4\right) - {B}^{2}\right) \cdot F\right) \cdot 2\right) \cdot \left(\sqrt{{\left(A - C\right)}^{2} + {B}^{2}} - \left(C + A\right)\right)}}{C \cdot \left(A \cdot 4\right) - {B}^{2}} \leq -2 \cdot 10^{-158}:\\ \;\;\;\;\sqrt{\frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\right)}{\mathsf{fma}\left(-4 \cdot A, C, B \cdot B\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;\frac{\sqrt{\left(\left(\left(C \cdot \left(A \cdot 4\right) - {B}^{2}\right) \cdot F\right) \cdot 2\right) \cdot \left(\sqrt{{\left(A - C\right)}^{2} + {B}^{2}} - \left(C + A\right)\right)}}{C \cdot \left(A \cdot 4\right) - {B}^{2}} \leq \infty:\\ \;\;\;\;\frac{\sqrt{\left(\left(\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right) \cdot F\right) \cdot 2\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) + A\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right)}\\ \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 5: 41.0% 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 10^{-91}:\\ \;\;\;\;\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) 1e-91)
   (/
    (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) <= 1e-91) {
		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) <= 1e-91)
		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], 1e-91], 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)) < 1.00000000000000002e-91

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

   4. Applied rewrites 1.5%

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

   6. Applied rewrites 23.0%

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

   7. Taylor expanded in C around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 26.3

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

   9. Applied rewrites 26.3%

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

   if 1.00000000000000002e-91 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 14.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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 19.0

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

   5. Applied rewrites 19.0%

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

   7. Applied rewrites 19.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 15.6%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 10^{-91}:\\ \;\;\;\;\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 6: 36.0% 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 10^{-91}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\left(A \cdot A\right) \cdot C\right) \cdot F\right) \cdot -16}}{-\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) 1e-91)
   (/ (sqrt (* (* (* (* A A) C) F) -16.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) <= 1e-91) {
		tmp = sqrt(((((A * A) * C) * F) * -16.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) <= 1e-91)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(A * A) * C) * F) * -16.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], 1e-91], N[(N[Sqrt[N[(N[(N[(N[(A * A), $MachinePrecision] * C), $MachinePrecision] * F), $MachinePrecision] * -16.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)) < 1.00000000000000002e-91

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

   4. Applied rewrites 1.5%

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

   6. Applied rewrites 23.0%

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

   7. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 18.6

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

   9. Applied rewrites 18.6%

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

   if 1.00000000000000002e-91 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 14.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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 19.0

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

   5. Applied rewrites 19.0%

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

   7. Applied rewrites 19.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 15.6%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;{B}^{2} \leq 10^{-91}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\left(A \cdot A\right) \cdot C\right) \cdot F\right) \cdot -16}}{-\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 7: 45.2% accurate, 3.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 \leq 2.7 \cdot 10^{+57}:\\ \;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\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 (<= B_m 2.7e+57)
     (/
      (sqrt (* (* (* t_0 F) 2.0) (+ (fma -0.5 (/ (* B_m B_m) C) A) A)))
      (- 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 (B_m <= 2.7e+57) {
		tmp = sqrt((((t_0 * F) * 2.0) * (fma(-0.5, ((B_m * B_m) / C), A) + A))) / -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.7e+57)
		tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A))) / 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[B$95$m, 2.7e+57], N[(N[Sqrt[N[(N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $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 B < 2.6999999999999998e57

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

   4. Applied rewrites 0.8%

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

   6. Applied rewrites 21.1%

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

   7. Taylor expanded in C around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 19.0

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

   9. Applied rewrites 19.0%

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

   1. Initial program 9.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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 41.4

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

   5. Applied rewrites 41.4%

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

   7. Applied rewrites 41.6%

      \[\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. Final simplification 23.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq 2.7 \cdot 10^{+57}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right) \cdot F\right) \cdot 2\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) + A\right)}}{-\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right)}\\ \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 8: 42.5% accurate, 4.8× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\ \mathbf{if}\;B\_m \leq 8.2 \cdot 10^{+63}:\\ \;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\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 (<= B_m 8.2e+63)
     (/
      (sqrt (* (* (* t_0 F) 2.0) (+ (fma -0.5 (/ (* B_m B_m) C) A) A)))
      (- 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 (B_m <= 8.2e+63) {
		tmp = sqrt((((t_0 * F) * 2.0) * (fma(-0.5, ((B_m * B_m) / C), A) + A))) / -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 <= 8.2e+63)
		tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * Float64(fma(-0.5, Float64(Float64(B_m * B_m) / C), A) + A))) / 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[B$95$m, 8.2e+63], N[(N[Sqrt[N[(N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision] * N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / C), $MachinePrecision] + A), $MachinePrecision] + A), $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 B < 8.19999999999999985e63

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

   4. Applied rewrites 0.7%

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

   6. Applied rewrites 21.1%

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

   7. Taylor expanded in C around inf

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 19.1

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

   9. Applied rewrites 19.1%

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

   1. Initial program 7.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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 43.5

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

   5. Applied rewrites 43.5%

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

   7. Applied rewrites 43.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 37.7%

       \[\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.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq 8.2 \cdot 10^{+63}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right) \cdot F\right) \cdot 2\right) \cdot \left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) + A\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 9: 42.4% accurate, 6.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} t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\ \mathbf{if}\;B\_m \leq 6.2 \cdot 10^{-45}:\\ \;\;\;\;\frac{\sqrt{\left(A + A\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 (<= B_m 6.2e-45)
     (/ (sqrt (* (+ A A) (* (* 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 (B_m <= 6.2e-45) {
		tmp = sqrt(((A + A) * ((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 <= 6.2e-45)
		tmp = Float64(sqrt(Float64(Float64(A + A) * 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[B$95$m, 6.2e-45], N[(N[Sqrt[N[(N[(A + A), $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 B < 6.2000000000000002e-45

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

   4. Applied rewrites 0.8%

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

   6. Applied rewrites 19.1%

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

   7. Taylor expanded in C around inf

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]
   8. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]

      2. mul-1-neg N/A

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

      3. lower-neg.f64 16.7

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

   9. Applied rewrites 16.7%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A - \left(-A\right)\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 6.2000000000000002e-45 < B

   1. Initial program 15.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 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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 39.4

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

   5. Applied rewrites 39.4%

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

   7. Applied rewrites 39.6%

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

       \[\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 6.2 \cdot 10^{-45}:\\ \;\;\;\;\frac{\sqrt{\left(A + A\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 10: 42.7% accurate, 6.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 6.2 \cdot 10^{-45}:\\ \;\;\;\;\frac{\sqrt{\left(\left(A + A\right) \cdot \left(F \cdot 2\right)\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}}{-\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 6.2e-45)
   (/
    (sqrt (* (* (+ A A) (* F 2.0)) (fma -4.0 (* C A) (* B_m B_m))))
    (- (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 <= 6.2e-45) {
		tmp = sqrt((((A + A) * (F * 2.0)) * fma(-4.0, (C * A), (B_m * B_m)))) / -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 <= 6.2e-45)
		tmp = Float64(sqrt(Float64(Float64(Float64(A + A) * Float64(F * 2.0)) * fma(-4.0, Float64(C * A), Float64(B_m * B_m)))) / 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[B$95$m, 6.2e-45], N[(N[Sqrt[N[(N[(N[(A + A), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $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 B < 6.2000000000000002e-45

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

   4. Applied rewrites 0.8%

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

   6. Applied rewrites 19.1%

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

   7. Taylor expanded in C around inf

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]
   8. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]

      2. mul-1-neg N/A

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

      3. lower-neg.f64 16.7

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

   9. Applied rewrites 16.7%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A - \left(-A\right)\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)} \]
   10. Step-by-step derivation

       1. lift-*.f64 N/A

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

       2. *-commutative N/A

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

       3. lift-*.f64 N/A

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

       4. lift-*.f64 N/A

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

       5. associate-*l* N/A

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

       6. lift-fma.f64 N/A

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

       7. *-commutative N/A

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

       8. lift-fma.f64 N/A

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

       9. *-commutative N/A

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

       10. lift-*.f64 N/A

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

       11. associate-*l* N/A

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

       12. lower-*.f64 N/A

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

   11. Applied rewrites 17.0%

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

   if 6.2000000000000002e-45 < B

   1. Initial program 15.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 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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 39.4

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

   5. Applied rewrites 39.4%

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

   7. Applied rewrites 39.6%

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

       \[\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.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq 6.2 \cdot 10^{-45}:\\ \;\;\;\;\frac{\sqrt{\left(\left(A + A\right) \cdot \left(F \cdot 2\right)\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B \cdot B\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 11: 40.0% accurate, 6.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 6.2 \cdot 10^{-45}:\\ \;\;\;\;\frac{\sqrt{\left(\left(A + A\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\right) \cdot \left(F \cdot 2\right)}}{\mathsf{fma}\left(-B\_m, B\_m, C \cdot \left(A \cdot 4\right)\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 6.2e-45)
   (/
    (sqrt (* (* (+ A A) (fma -4.0 (* C A) (* B_m B_m))) (* F 2.0)))
    (fma (- B_m) B_m (* C (* A 4.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 tmp;
	if (B_m <= 6.2e-45) {
		tmp = sqrt((((A + A) * fma(-4.0, (C * A), (B_m * B_m))) * (F * 2.0))) / fma(-B_m, B_m, (C * (A * 4.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)
	tmp = 0.0
	if (B_m <= 6.2e-45)
		tmp = Float64(sqrt(Float64(Float64(Float64(A + A) * fma(-4.0, Float64(C * A), Float64(B_m * B_m))) * Float64(F * 2.0))) / fma(Float64(-B_m), B_m, Float64(C * Float64(A * 4.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_] := If[LessEqual[B$95$m, 6.2e-45], N[(N[Sqrt[N[(N[(N[(A + A), $MachinePrecision] * N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[((-B$95$m) * B$95$m + N[(C * N[(A * 4.0), $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 < 6.2000000000000002e-45

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

   4. Applied rewrites 0.8%

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

   6. Applied rewrites 19.1%

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

   7. Taylor expanded in C around inf

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]
   8. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]

      2. mul-1-neg N/A

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

      3. lower-neg.f64 16.7

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

   9. Applied rewrites 16.7%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A - \left(-A\right)\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)} \]
   10. Step-by-step derivation

   11. Applied rewrites 15.5%

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

   if 6.2000000000000002e-45 < B

   1. Initial program 15.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 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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 39.4

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

   5. Applied rewrites 39.4%

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

   7. Applied rewrites 39.6%

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq 6.2 \cdot 10^{-45}:\\ \;\;\;\;\frac{\sqrt{\left(\left(A + A\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B \cdot B\right)\right) \cdot \left(F \cdot 2\right)}}{\mathsf{fma}\left(-B, B, C \cdot \left(A \cdot 4\right)\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 12: 41.5% accurate, 6.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 \leq 6.2 \cdot 10^{-45}:\\ \;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(\left(\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right) \cdot F\right) \cdot 2\right)}}{\left(C \cdot A\right) \cdot 4}\\ \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 6.2e-45)
   (/
    (sqrt (* (+ A A) (* (* (fma (* C A) -4.0 (* B_m B_m)) F) 2.0)))
    (* (* C A) 4.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 tmp;
	if (B_m <= 6.2e-45) {
		tmp = sqrt(((A + A) * ((fma((C * A), -4.0, (B_m * B_m)) * F) * 2.0))) / ((C * A) * 4.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)
	tmp = 0.0
	if (B_m <= 6.2e-45)
		tmp = Float64(sqrt(Float64(Float64(A + A) * Float64(Float64(fma(Float64(C * A), -4.0, Float64(B_m * B_m)) * F) * 2.0))) / Float64(Float64(C * A) * 4.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_] := If[LessEqual[B$95$m, 6.2e-45], N[(N[Sqrt[N[(N[(A + A), $MachinePrecision] * N[(N[(N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * 4.0), $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 < 6.2000000000000002e-45

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

   4. Applied rewrites 0.8%

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

   6. Applied rewrites 19.1%

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

   7. Taylor expanded in C around inf

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]
   8. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto \frac{\sqrt{\color{blue}{\left(A - -1 \cdot A\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)} \]

      2. mul-1-neg N/A

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

      3. lower-neg.f64 16.7

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

   9. Applied rewrites 16.7%

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

   10. Taylor expanded in C around inf

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

       1. lower-*.f64 N/A

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

       2. lower-*.f64 16.1

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

   12. Applied rewrites 16.1%

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

   if 6.2000000000000002e-45 < B

   1. Initial program 15.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 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. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 39.4

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

   5. Applied rewrites 39.4%

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

   7. Applied rewrites 39.6%

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

       \[\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.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;B \leq 6.2 \cdot 10^{-45}:\\ \;\;\;\;\frac{\sqrt{\left(A + A\right) \cdot \left(\left(\mathsf{fma}\left(C \cdot A, -4, B \cdot B\right) \cdot F\right) \cdot 2\right)}}{\left(C \cdot A\right) \cdot 4}\\ \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 13: 27.8% 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 -2.2 \cdot 10^{+234}:\\ \;\;\;\;\frac{\sqrt{F \cdot \left(A \cdot 4\right)}}{-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 -2.2e+234)
   (/ (sqrt (* F (* A 4.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 <= -2.2e+234) {
		tmp = sqrt((F * (A * 4.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 <= (-2.2d+234)) then
        tmp = sqrt((f * (a * 4.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 <= -2.2e+234) {
		tmp = Math.sqrt((F * (A * 4.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 <= -2.2e+234:
		tmp = math.sqrt((F * (A * 4.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 <= -2.2e+234)
		tmp = Float64(sqrt(Float64(F * Float64(A * 4.0))) / Float64(-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 <= -2.2e+234)
		tmp = sqrt((F * (A * 4.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, -2.2e+234], N[(N[Sqrt[N[(F * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]], $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 < -2.20000000000000007e234

   1. Initial program 0.9%

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

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

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 12.5

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

   5. Applied rewrites 12.5%

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

   7. Applied rewrites 12.5%

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

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

   10. Applied rewrites 12.5%

       \[\leadsto \frac{\sqrt{\left(4 \cdot A\right) \cdot F}}{-B} \]

   if -2.20000000000000007e234 < A

   1. Initial program 18.3%

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

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

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 14.2

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

   5. Applied rewrites 14.2%

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

   7. Applied rewrites 14.3%

      \[\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 B around inf

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

   10. Applied rewrites 12.1%

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

4. Final simplification 12.1%

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

Alternative 14: 26.7% accurate, 14.4× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \frac{\sqrt{\left(F \cdot B\_m\right) \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 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) {
	return sqrt(((F * B_m) * -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 * b_m) * (-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 * B_m) * -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 * B_m) * -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(sqrt(Float64(Float64(F * B_m) * -2.0)) / Float64(-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 * B_m) * -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[Sqrt[N[(N[(F * B$95$m), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]

Derivation

1. Initial program 17.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. +-commutative N/A

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

   12. unpow2 N/A

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

   13. unpow2 N/A

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

   14. lower-hypot.f64 14.1

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

5. Applied rewrites 14.1%

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

7. Applied rewrites 14.2%

   \[\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 B around inf

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

10. Applied rewrites 11.6%

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

11. Final simplification 11.6%

    \[\leadsto \frac{\sqrt{\left(F \cdot B\right) \cdot -2}}{-B} \]
12. Add Preprocessing

Alternative 15: 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{2}{B\_m} \cdot F} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F) :precision binary64 (sqrt (* (/ 2.0 B_m) F)))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	return sqrt(((2.0 / B_m) * F));
}

Fortran

B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = sqrt(((2.0d0 / b_m) * f))
end function

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	return Math.sqrt(((2.0 / B_m) * F));
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	return math.sqrt(((2.0 / B_m) * F))

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

MATLAB

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

Derivation

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

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

5. Applied rewrites 2.2%

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

7. Applied rewrites 2.2%

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

9. Applied rewrites 2.2%

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

Reproduce

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