ABCF->ab-angle a

Percentage Accurate: 18.7% → 62.9%

Time: 12.1s

Alternatives: 18

Speedup: 16.9×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 18.7% 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: 62.9% 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 := \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(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_3}\\ \mathbf{if}\;t\_4 \leq -5 \cdot 10^{-195}:\\ \;\;\;\;\frac{\sqrt{F} \cdot \left(\sqrt{\left(\left(C + A\right) + t\_1\right) \cdot 2} \cdot \sqrt{\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\right)}{t\_3}\\ \mathbf{elif}\;t\_4 \leq 0:\\ \;\;\;\;\frac{\sqrt{\left(t\_0 \cdot 2\right) \cdot \left(\left(\frac{B\_m \cdot B\_m}{A} \cdot -0.5 + C\right) + C\right)} \cdot \sqrt{F}}{t\_3}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot 2\right) \cdot t\_0}}{t\_0} \cdot \frac{\sqrt{\left(t\_1 + A\right) + C}}{-1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
        (t_1 (hypot (- A C) B_m))
        (t_2 (* C (* A 4.0)))
        (t_3 (- t_2 (pow B_m 2.0)))
        (t_4
         (/
          (sqrt
           (*
            (+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* F (- (pow B_m 2.0) t_2)) 2.0)))
          t_3)))
   (if (<= t_4 -5e-195)
     (/
      (*
       (sqrt F)
       (*
        (sqrt (* (+ (+ C A) t_1) 2.0))
        (sqrt (fma (* C A) -4.0 (* B_m B_m)))))
      t_3)
     (if (<= t_4 0.0)
       (/
        (*
         (sqrt (* (* t_0 2.0) (+ (+ (* (/ (* B_m B_m) A) -0.5) C) C)))
         (sqrt F))
        t_3)
       (if (<= t_4 INFINITY)
         (* (/ (sqrt (* (* F 2.0) t_0)) t_0) (/ (sqrt (+ (+ t_1 A) C)) -1.0))
         (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) B_m) (- (sqrt 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) {
	double t_0 = fma(-4.0, (C * A), (B_m * B_m));
	double t_1 = 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((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_2)) * 2.0))) / t_3;
	double tmp;
	if (t_4 <= -5e-195) {
		tmp = (sqrt(F) * (sqrt((((C + A) + t_1) * 2.0)) * sqrt(fma((C * A), -4.0, (B_m * B_m))))) / t_3;
	} else if (t_4 <= 0.0) {
		tmp = (sqrt(((t_0 * 2.0) * (((((B_m * B_m) / A) * -0.5) + C) + C))) * sqrt(F)) / t_3;
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = (sqrt(((F * 2.0) * t_0)) / t_0) * (sqrt(((t_1 + A) + C)) / -1.0);
	} else {
		tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / B_m) * -sqrt(F);
	}
	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 = 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(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_2)) * 2.0))) / t_3)
	tmp = 0.0
	if (t_4 <= -5e-195)
		tmp = Float64(Float64(sqrt(F) * Float64(sqrt(Float64(Float64(Float64(C + A) + t_1) * 2.0)) * sqrt(fma(Float64(C * A), -4.0, Float64(B_m * B_m))))) / t_3);
	elseif (t_4 <= 0.0)
		tmp = Float64(Float64(sqrt(Float64(Float64(t_0 * 2.0) * Float64(Float64(Float64(Float64(Float64(B_m * B_m) / A) * -0.5) + C) + C))) * sqrt(F)) / t_3);
	elseif (t_4 <= Inf)
		tmp = Float64(Float64(sqrt(Float64(Float64(F * 2.0) * t_0)) / t_0) * Float64(sqrt(Float64(Float64(t_1 + A) + C)) / -1.0));
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / B_m) * Float64(-sqrt(F)));
	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[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $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[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, -5e-195], N[(N[(N[Sqrt[F], $MachinePrecision] * N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + t$95$1), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[N[(N[(t$95$0 * 2.0), $MachinePrecision] * N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[Sqrt[N[(N[(t$95$1 + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 4 regimes

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

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

      1. lift-sqrt.f64 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)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*r* N/A

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

      7. associate-*r* N/A

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

      8. sqrt-prod N/A

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

      9. pow1/2 N/A

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

   4. Applied rewrites 46.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

      9. pow1/2 N/A

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

      10. lower-sqrt.f64 N/A

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

      11. lift-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 N/A

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

      14. lower-sqrt.f64 N/A

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

      15. lower-*.f64 76.8

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

   6. Applied rewrites 75.8%

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

   if -5.00000000000000009e-195 < (/.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))) < -0.0

   1. Initial program 3.5%

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

      1. lift-sqrt.f64 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)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*r* N/A

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

      7. associate-*r* N/A

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

      8. sqrt-prod N/A

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

      9. pow1/2 N/A

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

   4. Applied rewrites 15.1%

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

   5. Taylor expanded in A around -inf

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 21.4

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

   7. Applied rewrites 21.4%

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

   if -0.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))) < +inf.0

   1. Initial program 34.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 72.7%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 19.7

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

   5. Applied rewrites 19.7%

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

   7. Applied rewrites 33.5%

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

   9. Applied rewrites 33.6%

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

4. Final simplification 51.9%

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

Alternative 2: 60.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 := \left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C\\ t_1 := C \cdot \left(A \cdot 4\right)\\ t_2 := t\_1 - {B\_m}^{2}\\ t_3 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_2}\\ t_4 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\ t_5 := t\_4 \cdot 2\\ \mathbf{if}\;t\_3 \leq -5 \cdot 10^{-195}:\\ \;\;\;\;\frac{\sqrt{t\_0 \cdot F} \cdot \sqrt{t\_5}}{t\_2}\\ \mathbf{elif}\;t\_3 \leq 0:\\ \;\;\;\;\frac{\sqrt{t\_5 \cdot \left(\left(\frac{B\_m \cdot B\_m}{A} \cdot -0.5 + C\right) + C\right)} \cdot \sqrt{F}}{t\_2}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot 2\right) \cdot t\_4}}{t\_4} \cdot \frac{\sqrt{t\_0}}{-1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (+ (+ (hypot (- A C) B_m) A) C))
        (t_1 (* C (* A 4.0)))
        (t_2 (- t_1 (pow B_m 2.0)))
        (t_3
         (/
          (sqrt
           (*
            (+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* F (- (pow B_m 2.0) t_1)) 2.0)))
          t_2))
        (t_4 (fma -4.0 (* C A) (* B_m B_m)))
        (t_5 (* t_4 2.0)))
   (if (<= t_3 -5e-195)
     (/ (* (sqrt (* t_0 F)) (sqrt t_5)) t_2)
     (if (<= t_3 0.0)
       (/
        (* (sqrt (* t_5 (+ (+ (* (/ (* B_m B_m) A) -0.5) C) C))) (sqrt F))
        t_2)
       (if (<= t_3 INFINITY)
         (* (/ (sqrt (* (* F 2.0) t_4)) t_4) (/ (sqrt t_0) -1.0))
         (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) B_m) (- (sqrt 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) {
	double t_0 = (hypot((A - C), B_m) + A) + C;
	double t_1 = C * (A * 4.0);
	double t_2 = t_1 - pow(B_m, 2.0);
	double t_3 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / t_2;
	double t_4 = fma(-4.0, (C * A), (B_m * B_m));
	double t_5 = t_4 * 2.0;
	double tmp;
	if (t_3 <= -5e-195) {
		tmp = (sqrt((t_0 * F)) * sqrt(t_5)) / t_2;
	} else if (t_3 <= 0.0) {
		tmp = (sqrt((t_5 * (((((B_m * B_m) / A) * -0.5) + C) + C))) * sqrt(F)) / t_2;
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = (sqrt(((F * 2.0) * t_4)) / t_4) * (sqrt(t_0) / -1.0);
	} else {
		tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / B_m) * -sqrt(F);
	}
	return tmp;
}

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64(Float64(hypot(Float64(A - C), B_m) + A) + C)
	t_1 = Float64(C * Float64(A * 4.0))
	t_2 = Float64(t_1 - (B_m ^ 2.0))
	t_3 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / t_2)
	t_4 = fma(-4.0, Float64(C * A), Float64(B_m * B_m))
	t_5 = Float64(t_4 * 2.0)
	tmp = 0.0
	if (t_3 <= -5e-195)
		tmp = Float64(Float64(sqrt(Float64(t_0 * F)) * sqrt(t_5)) / t_2);
	elseif (t_3 <= 0.0)
		tmp = Float64(Float64(sqrt(Float64(t_5 * Float64(Float64(Float64(Float64(Float64(B_m * B_m) / A) * -0.5) + C) + C))) * sqrt(F)) / t_2);
	elseif (t_3 <= Inf)
		tmp = Float64(Float64(sqrt(Float64(Float64(F * 2.0) * t_4)) / t_4) * Float64(sqrt(t_0) / -1.0));
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / B_m) * Float64(-sqrt(F)));
	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[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 * 2.0), $MachinePrecision]}, If[LessEqual[t$95$3, -5e-195], N[(N[(N[Sqrt[N[(t$95$0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[t$95$5], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, 0.0], N[(N[(N[Sqrt[N[(t$95$5 * N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(N[(N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$4), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision] * N[(N[Sqrt[t$95$0], $MachinePrecision] / -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

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

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

      1. lift-sqrt.f64 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)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

         \[\leadsto \frac{-\sqrt{\color{blue}{\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} \]

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. associate-*l* N/A

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

      7. sqrt-prod N/A

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

      8. pow1/2 N/A

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

      9. lower-*.f64 N/A

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

   4. Applied rewrites 69.9%

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

   if -5.00000000000000009e-195 < (/.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))) < -0.0

   1. Initial program 3.5%

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

      1. lift-sqrt.f64 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)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*r* N/A

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

      7. associate-*r* N/A

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

      8. sqrt-prod N/A

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

      9. pow1/2 N/A

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

   4. Applied rewrites 15.1%

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

   5. Taylor expanded in A around -inf

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 21.4

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

   7. Applied rewrites 21.4%

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

   if -0.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))) < +inf.0

   1. Initial program 34.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 72.7%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 19.7

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

   5. Applied rewrites 19.7%

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

   7. Applied rewrites 33.5%

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

   9. Applied rewrites 33.6%

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

4. Final simplification 49.6%

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

Alternative 3: 59.6% 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 := \sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}\\ t_2 := C \cdot \left(A \cdot 4\right)\\ t_3 := t\_2 - {B\_m}^{2}\\ t_4 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_3}\\ t_5 := \sqrt{\left(F \cdot 2\right) \cdot t\_0}\\ \mathbf{if}\;t\_4 \leq -5 \cdot 10^{-195}:\\ \;\;\;\;\frac{t\_1}{t\_0} \cdot \frac{t\_5}{-1}\\ \mathbf{elif}\;t\_4 \leq 0:\\ \;\;\;\;\frac{\sqrt{\left(t\_0 \cdot 2\right) \cdot \left(\left(\frac{B\_m \cdot B\_m}{A} \cdot -0.5 + C\right) + C\right)} \cdot \sqrt{F}}{t\_3}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;\frac{t\_5}{t\_0} \cdot \frac{t\_1}{-1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
        (t_1 (sqrt (+ (+ (hypot (- A C) B_m) A) C)))
        (t_2 (* C (* A 4.0)))
        (t_3 (- t_2 (pow B_m 2.0)))
        (t_4
         (/
          (sqrt
           (*
            (+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* F (- (pow B_m 2.0) t_2)) 2.0)))
          t_3))
        (t_5 (sqrt (* (* F 2.0) t_0))))
   (if (<= t_4 -5e-195)
     (* (/ t_1 t_0) (/ t_5 -1.0))
     (if (<= t_4 0.0)
       (/
        (*
         (sqrt (* (* t_0 2.0) (+ (+ (* (/ (* B_m B_m) A) -0.5) C) C)))
         (sqrt F))
        t_3)
       (if (<= t_4 INFINITY)
         (* (/ t_5 t_0) (/ t_1 -1.0))
         (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) B_m) (- (sqrt 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) {
	double t_0 = fma(-4.0, (C * A), (B_m * B_m));
	double t_1 = sqrt(((hypot((A - C), B_m) + A) + C));
	double t_2 = C * (A * 4.0);
	double t_3 = t_2 - pow(B_m, 2.0);
	double t_4 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_2)) * 2.0))) / t_3;
	double t_5 = sqrt(((F * 2.0) * t_0));
	double tmp;
	if (t_4 <= -5e-195) {
		tmp = (t_1 / t_0) * (t_5 / -1.0);
	} else if (t_4 <= 0.0) {
		tmp = (sqrt(((t_0 * 2.0) * (((((B_m * B_m) / A) * -0.5) + C) + C))) * sqrt(F)) / t_3;
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = (t_5 / t_0) * (t_1 / -1.0);
	} else {
		tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / B_m) * -sqrt(F);
	}
	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 = sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C))
	t_2 = Float64(C * Float64(A * 4.0))
	t_3 = Float64(t_2 - (B_m ^ 2.0))
	t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_2)) * 2.0))) / t_3)
	t_5 = sqrt(Float64(Float64(F * 2.0) * t_0))
	tmp = 0.0
	if (t_4 <= -5e-195)
		tmp = Float64(Float64(t_1 / t_0) * Float64(t_5 / -1.0));
	elseif (t_4 <= 0.0)
		tmp = Float64(Float64(sqrt(Float64(Float64(t_0 * 2.0) * Float64(Float64(Float64(Float64(Float64(B_m * B_m) / A) * -0.5) + C) + C))) * sqrt(F)) / t_3);
	elseif (t_4 <= Inf)
		tmp = Float64(Float64(t_5 / t_0) * Float64(t_1 / -1.0));
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / B_m) * Float64(-sqrt(F)));
	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[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $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[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$4, -5e-195], N[(N[(t$95$1 / t$95$0), $MachinePrecision] * N[(t$95$5 / -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[Sqrt[N[(N[(t$95$0 * 2.0), $MachinePrecision] * N[(N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] * -0.5), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / t$95$3), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(t$95$5 / t$95$0), $MachinePrecision] * N[(t$95$1 / -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 48.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 69.6%

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

   if -5.00000000000000009e-195 < (/.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))) < -0.0

   1. Initial program 3.5%

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

      1. lift-sqrt.f64 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)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*r* N/A

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

      7. associate-*r* N/A

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

      8. sqrt-prod N/A

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

      9. pow1/2 N/A

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

   4. Applied rewrites 15.1%

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

   5. Taylor expanded in A around -inf

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 21.4

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

   7. Applied rewrites 21.4%

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

   if -0.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))) < +inf.0

   1. Initial program 34.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 72.7%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 19.7

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

   5. Applied rewrites 19.7%

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

   7. Applied rewrites 33.5%

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

   9. Applied rewrites 33.6%

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

4. Final simplification 49.5%

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

Alternative 4: 57.1% 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(F \cdot 2\right) \cdot t\_0\\ t_2 := \sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}\\ t_3 := C \cdot \left(A \cdot 4\right)\\ t_4 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_3\right)\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\ t_5 := \sqrt{t\_1}\\ \mathbf{if}\;t\_4 \leq -5 \cdot 10^{-195}:\\ \;\;\;\;\frac{t\_2}{t\_0} \cdot \frac{t\_5}{-1}\\ \mathbf{elif}\;t\_4 \leq 0:\\ \;\;\;\;\frac{t\_0 \cdot 0 - \sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\right) \cdot t\_1} \cdot t\_0}{t\_0 \cdot t\_0}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;\frac{t\_5}{t\_0} \cdot \frac{t\_2}{-1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
        (t_1 (* (* F 2.0) t_0))
        (t_2 (sqrt (+ (+ (hypot (- A C) B_m) A) C)))
        (t_3 (* C (* A 4.0)))
        (t_4
         (/
          (sqrt
           (*
            (+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* F (- (pow B_m 2.0) t_3)) 2.0)))
          (- t_3 (pow B_m 2.0))))
        (t_5 (sqrt t_1)))
   (if (<= t_4 -5e-195)
     (* (/ t_2 t_0) (/ t_5 -1.0))
     (if (<= t_4 0.0)
       (/
        (-
         (* t_0 0.0)
         (* (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) t_1)) t_0))
        (* t_0 t_0))
       (if (<= t_4 INFINITY)
         (* (/ t_5 t_0) (/ t_2 -1.0))
         (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) B_m) (- (sqrt 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) {
	double t_0 = fma(-4.0, (C * A), (B_m * B_m));
	double t_1 = (F * 2.0) * t_0;
	double t_2 = sqrt(((hypot((A - C), B_m) + A) + C));
	double t_3 = C * (A * 4.0);
	double t_4 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_3)) * 2.0))) / (t_3 - pow(B_m, 2.0));
	double t_5 = sqrt(t_1);
	double tmp;
	if (t_4 <= -5e-195) {
		tmp = (t_2 / t_0) * (t_5 / -1.0);
	} else if (t_4 <= 0.0) {
		tmp = ((t_0 * 0.0) - (sqrt(((fma(-0.5, ((B_m * B_m) / A), C) + C) * t_1)) * t_0)) / (t_0 * t_0);
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = (t_5 / t_0) * (t_2 / -1.0);
	} else {
		tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / B_m) * -sqrt(F);
	}
	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(F * 2.0) * t_0)
	t_2 = sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C))
	t_3 = Float64(C * Float64(A * 4.0))
	t_4 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_3)) * 2.0))) / Float64(t_3 - (B_m ^ 2.0)))
	t_5 = sqrt(t_1)
	tmp = 0.0
	if (t_4 <= -5e-195)
		tmp = Float64(Float64(t_2 / t_0) * Float64(t_5 / -1.0));
	elseif (t_4 <= 0.0)
		tmp = Float64(Float64(Float64(t_0 * 0.0) - Float64(sqrt(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * t_1)) * t_0)) / Float64(t_0 * t_0));
	elseif (t_4 <= Inf)
		tmp = Float64(Float64(t_5 / t_0) * Float64(t_2 / -1.0));
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / B_m) * Float64(-sqrt(F)));
	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[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[t$95$1], $MachinePrecision]}, If[LessEqual[t$95$4, -5e-195], N[(N[(t$95$2 / t$95$0), $MachinePrecision] * N[(t$95$5 / -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(N[(N[(t$95$0 * 0.0), $MachinePrecision] - N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(t$95$5 / t$95$0), $MachinePrecision] * N[(t$95$2 / -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 48.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 69.6%

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

   if -5.00000000000000009e-195 < (/.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))) < -0.0

   1. Initial program 3.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 3.8%

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

   5. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 1.6

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

   7. Applied rewrites 1.6%

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

   8. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 19.7

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

   10. Applied rewrites 19.7%

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

   if -0.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))) < +inf.0

   1. Initial program 34.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 72.7%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 19.7

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

   5. Applied rewrites 19.7%

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

   7. Applied rewrites 33.5%

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

   9. Applied rewrites 33.6%

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

4. Final simplification 49.2%

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

Alternative 5: 57.1% 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 := C \cdot \left(A \cdot 4\right)\\ t_2 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\ t_3 := \left(F \cdot 2\right) \cdot t\_0\\ t_4 := \frac{\sqrt{\left(\mathsf{hypot}\left(A - C, B\_m\right) + A\right) + C}}{t\_0} \cdot \frac{\sqrt{t\_3}}{-1}\\ \mathbf{if}\;t\_2 \leq -5 \cdot 10^{-195}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_2 \leq 0:\\ \;\;\;\;\frac{t\_0 \cdot 0 - \sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\right) \cdot t\_3} \cdot t\_0}{t\_0 \cdot t\_0}\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
        (t_1 (* C (* A 4.0)))
        (t_2
         (/
          (sqrt
           (*
            (+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* F (- (pow B_m 2.0) t_1)) 2.0)))
          (- t_1 (pow B_m 2.0))))
        (t_3 (* (* F 2.0) t_0))
        (t_4
         (*
          (/ (sqrt (+ (+ (hypot (- A C) B_m) A) C)) t_0)
          (/ (sqrt t_3) -1.0))))
   (if (<= t_2 -5e-195)
     t_4
     (if (<= t_2 0.0)
       (/
        (-
         (* t_0 0.0)
         (* (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) t_3)) t_0))
        (* t_0 t_0))
       (if (<= t_2 INFINITY)
         t_4
         (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) B_m) (- (sqrt 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) {
	double t_0 = fma(-4.0, (C * A), (B_m * B_m));
	double t_1 = C * (A * 4.0);
	double t_2 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
	double t_3 = (F * 2.0) * t_0;
	double t_4 = (sqrt(((hypot((A - C), B_m) + A) + C)) / t_0) * (sqrt(t_3) / -1.0);
	double tmp;
	if (t_2 <= -5e-195) {
		tmp = t_4;
	} else if (t_2 <= 0.0) {
		tmp = ((t_0 * 0.0) - (sqrt(((fma(-0.5, ((B_m * B_m) / A), C) + C) * t_3)) * t_0)) / (t_0 * t_0);
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / B_m) * -sqrt(F);
	}
	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(C * Float64(A * 4.0))
	t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0)))
	t_3 = Float64(Float64(F * 2.0) * t_0)
	t_4 = Float64(Float64(sqrt(Float64(Float64(hypot(Float64(A - C), B_m) + A) + C)) / t_0) * Float64(sqrt(t_3) / -1.0))
	tmp = 0.0
	if (t_2 <= -5e-195)
		tmp = t_4;
	elseif (t_2 <= 0.0)
		tmp = Float64(Float64(Float64(t_0 * 0.0) - Float64(sqrt(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * t_3)) * t_0)) / Float64(t_0 * t_0));
	elseif (t_2 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / B_m) * Float64(-sqrt(F)));
	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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[Sqrt[N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$0), $MachinePrecision] * N[(N[Sqrt[t$95$3], $MachinePrecision] / -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-195], t$95$4, If[LessEqual[t$95$2, 0.0], N[(N[(N[(t$95$0 * 0.0), $MachinePrecision] - N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * t$95$3), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], t$95$4, N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $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))) < -5.00000000000000009e-195 or -0.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))) < +inf.0

   1. Initial program 46.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 70.2%

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

   if -5.00000000000000009e-195 < (/.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))) < -0.0

   1. Initial program 3.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 3.8%

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

   5. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 1.6

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

   7. Applied rewrites 1.6%

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

   8. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 19.7

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

   10. Applied rewrites 19.7%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 19.7

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

   5. Applied rewrites 19.7%

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

   7. Applied rewrites 33.5%

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

   9. Applied rewrites 33.6%

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

4. Final simplification 49.2%

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

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

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (hypot (- A C) B_m))
        (t_1 (fma -4.0 (* C A) (* B_m B_m)))
        (t_2 (* (* F 2.0) t_1))
        (t_3 (* C (* A 4.0)))
        (t_4
         (/
          (sqrt
           (*
            (+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* F (- (pow B_m 2.0) t_3)) 2.0)))
          (- t_3 (pow B_m 2.0)))))
   (if (<= t_4 (- INFINITY))
     (* (sqrt (/ (* (+ (+ t_0 C) A) F) t_1)) (- (sqrt 2.0)))
     (if (<= t_4 -5e-195)
       (/ (sqrt (* t_2 (+ (+ t_0 A) C))) (- t_1))
       (if (<= t_4 INFINITY)
         (/
          (-
           (* t_1 0.0)
           (* (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) t_2)) t_1))
          (* t_1 t_1))
         (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) B_m) (- (sqrt 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) {
	double t_0 = hypot((A - C), B_m);
	double t_1 = fma(-4.0, (C * A), (B_m * B_m));
	double t_2 = (F * 2.0) * t_1;
	double t_3 = C * (A * 4.0);
	double t_4 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_3)) * 2.0))) / (t_3 - pow(B_m, 2.0));
	double tmp;
	if (t_4 <= -((double) INFINITY)) {
		tmp = sqrt(((((t_0 + C) + A) * F) / t_1)) * -sqrt(2.0);
	} else if (t_4 <= -5e-195) {
		tmp = sqrt((t_2 * ((t_0 + A) + C))) / -t_1;
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = ((t_1 * 0.0) - (sqrt(((fma(-0.5, ((B_m * B_m) / A), C) + C) * t_2)) * t_1)) / (t_1 * t_1);
	} else {
		tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / B_m) * -sqrt(F);
	}
	return tmp;
}

Julia

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

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$3), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$3 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(N[Sqrt[N[(N[(N[(N[(t$95$0 + C), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision] / t$95$1), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], If[LessEqual[t$95$4, -5e-195], N[(N[Sqrt[N[(t$95$2 * N[(N[(t$95$0 + A), $MachinePrecision] + C), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$1)), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[(N[(t$95$1 * 0.0), $MachinePrecision] - N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * t$95$2), $MachinePrecision]], $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision] / N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 3.2%

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

   3. Taylor expanded in F around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      8. lower-/.f64 N/A

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

   5. Applied rewrites 43.7%

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

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

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

   4. Applied rewrites 99.3%

      \[\leadsto \color{blue}{\frac{\sqrt{\left(\left(\mathsf{hypot}\left(A - C, B\right) + A\right) + C\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 -5.00000000000000009e-195 < (/.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 15.6%

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

   4. Applied rewrites 16.6%

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

   5. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 3.7

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

   7. Applied rewrites 3.7%

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

   8. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 17.6

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

   10. Applied rewrites 17.6%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 19.7

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

   5. Applied rewrites 19.7%

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

   7. Applied rewrites 33.5%

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

   9. Applied rewrites 33.6%

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

4. Final simplification 43.7%

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

Alternative 7: 52.5% 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 := C \cdot \left(A \cdot 4\right)\\ t_2 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_1\right)\right) \cdot 2\right)}}{t\_1 - {B\_m}^{2}}\\ t_3 := -\sqrt{2}\\ \mathbf{if}\;t\_2 \leq -1 \cdot 10^{-146}:\\ \;\;\;\;\sqrt{\frac{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + C\right) + A\right) \cdot F}{t\_0}} \cdot t\_3\\ \mathbf{elif}\;t\_2 \leq -5 \cdot 10^{-195}:\\ \;\;\;\;\sqrt{\left(\mathsf{hypot}\left(A, B\_m\right) + A\right) \cdot F} \cdot \frac{t\_3}{B\_m}\\ \mathbf{elif}\;t\_2 \leq \infty:\\ \;\;\;\;\frac{t\_0 \cdot 0 - \sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C\right) + C\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_0\right)} \cdot t\_0}{t\_0 \cdot t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (fma -4.0 (* C A) (* B_m B_m)))
        (t_1 (* C (* A 4.0)))
        (t_2
         (/
          (sqrt
           (*
            (+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* F (- (pow B_m 2.0) t_1)) 2.0)))
          (- t_1 (pow B_m 2.0))))
        (t_3 (- (sqrt 2.0))))
   (if (<= t_2 -1e-146)
     (* (sqrt (/ (* (+ (+ (hypot (- A C) B_m) C) A) F) t_0)) t_3)
     (if (<= t_2 -5e-195)
       (* (sqrt (* (+ (hypot A B_m) A) F)) (/ t_3 B_m))
       (if (<= t_2 INFINITY)
         (/
          (-
           (* t_0 0.0)
           (*
            (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) (* (* F 2.0) t_0)))
            t_0))
          (* t_0 t_0))
         (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) B_m) (- (sqrt 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) {
	double t_0 = fma(-4.0, (C * A), (B_m * B_m));
	double t_1 = C * (A * 4.0);
	double t_2 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
	double t_3 = -sqrt(2.0);
	double tmp;
	if (t_2 <= -1e-146) {
		tmp = sqrt(((((hypot((A - C), B_m) + C) + A) * F) / t_0)) * t_3;
	} else if (t_2 <= -5e-195) {
		tmp = sqrt(((hypot(A, B_m) + A) * F)) * (t_3 / B_m);
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = ((t_0 * 0.0) - (sqrt(((fma(-0.5, ((B_m * B_m) / A), C) + C) * ((F * 2.0) * t_0))) * t_0)) / (t_0 * t_0);
	} else {
		tmp = (sqrt(((hypot(C, B_m) + C) * 2.0)) / B_m) * -sqrt(F);
	}
	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(C * Float64(A * 4.0))
	t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0)))
	t_3 = Float64(-sqrt(2.0))
	tmp = 0.0
	if (t_2 <= -1e-146)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(hypot(Float64(A - C), B_m) + C) + A) * F) / t_0)) * t_3);
	elseif (t_2 <= -5e-195)
		tmp = Float64(sqrt(Float64(Float64(hypot(A, B_m) + A) * F)) * Float64(t_3 / B_m));
	elseif (t_2 <= Inf)
		tmp = Float64(Float64(Float64(t_0 * 0.0) - Float64(sqrt(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * Float64(Float64(F * 2.0) * t_0))) * t_0)) / Float64(t_0 * t_0));
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / B_m) * Float64(-sqrt(F)));
	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[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[t$95$2, -1e-146], N[(N[Sqrt[N[(N[(N[(N[(N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision] / t$95$0), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision], If[LessEqual[t$95$2, -5e-195], N[(N[Sqrt[N[(N[(N[Sqrt[A ^ 2 + B$95$m ^ 2], $MachinePrecision] + A), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * N[(t$95$3 / B$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[(N[(t$95$0 * 0.0), $MachinePrecision] - N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision] / N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 45.6%

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

   3. Taylor expanded in F around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      8. lower-/.f64 N/A

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

   5. Applied rewrites 66.2%

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

   if -1.00000000000000003e-146 < (/.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))) < -5.00000000000000009e-195

   1. Initial program 99.7%

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

   3. Taylor expanded in C around 0

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

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 67.3

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

   5. Applied rewrites 67.3%

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

   if -5.00000000000000009e-195 < (/.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 15.6%

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

   4. Applied rewrites 16.6%

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

   5. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 3.7

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

   7. Applied rewrites 3.7%

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

   8. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 17.6

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

   10. Applied rewrites 17.6%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 19.7

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

   5. Applied rewrites 19.7%

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

   7. Applied rewrites 33.5%

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

   9. Applied rewrites 33.6%

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

4. Final simplification 42.2%

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

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

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (sqrt (* (+ (hypot C B_m) C) 2.0)))
        (t_1 (* C (* A 4.0)))
        (t_2
         (/
          (sqrt
           (*
            (+ (+ C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* F (- (pow B_m 2.0) t_1)) 2.0)))
          (- t_1 (pow B_m 2.0))))
        (t_3 (fma -4.0 (* C A) (* B_m B_m))))
   (if (<= t_2 -5e-195)
     (* (/ (sqrt F) (- B_m)) t_0)
     (if (<= t_2 INFINITY)
       (/
        (-
         (* t_3 0.0)
         (*
          (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) A) C) C) (* (* F 2.0) t_3)))
          t_3))
        (* t_3 t_3))
       (* (/ t_0 B_m) (- (sqrt 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) {
	double t_0 = sqrt(((hypot(C, B_m) + C) * 2.0));
	double t_1 = C * (A * 4.0);
	double t_2 = sqrt((((C + A) + sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))) * ((F * (pow(B_m, 2.0) - t_1)) * 2.0))) / (t_1 - pow(B_m, 2.0));
	double t_3 = fma(-4.0, (C * A), (B_m * B_m));
	double tmp;
	if (t_2 <= -5e-195) {
		tmp = (sqrt(F) / -B_m) * t_0;
	} else if (t_2 <= ((double) INFINITY)) {
		tmp = ((t_3 * 0.0) - (sqrt(((fma(-0.5, ((B_m * B_m) / A), C) + C) * ((F * 2.0) * t_3))) * t_3)) / (t_3 * t_3);
	} else {
		tmp = (t_0 / B_m) * -sqrt(F);
	}
	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 = sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0))
	t_1 = Float64(C * Float64(A * 4.0))
	t_2 = Float64(sqrt(Float64(Float64(Float64(C + A) + sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))) * Float64(Float64(F * Float64((B_m ^ 2.0) - t_1)) * 2.0))) / Float64(t_1 - (B_m ^ 2.0)))
	t_3 = fma(-4.0, Float64(C * A), Float64(B_m * B_m))
	tmp = 0.0
	if (t_2 <= -5e-195)
		tmp = Float64(Float64(sqrt(F) / Float64(-B_m)) * t_0);
	elseif (t_2 <= Inf)
		tmp = Float64(Float64(Float64(t_3 * 0.0) - Float64(sqrt(Float64(Float64(fma(-0.5, Float64(Float64(B_m * B_m) / A), C) + C) * Float64(Float64(F * 2.0) * t_3))) * t_3)) / Float64(t_3 * t_3));
	else
		tmp = Float64(Float64(t_0 / B_m) * Float64(-sqrt(F)));
	end
	return tmp
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(C * N[(A * 4.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] + N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(N[(F * N[(N[Power[B$95$m, 2.0], $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(t$95$1 - N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -5e-195], N[(N[(N[Sqrt[F], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * t$95$0), $MachinePrecision], If[LessEqual[t$95$2, Infinity], N[(N[(N[(t$95$3 * 0.0), $MachinePrecision] - N[(N[Sqrt[N[(N[(N[(-0.5 * N[(N[(B$95$m * B$95$m), $MachinePrecision] / A), $MachinePrecision] + C), $MachinePrecision] + C), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision] / N[(t$95$3 * t$95$3), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $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))) < -5.00000000000000009e-195

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

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 23.2

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

   5. Applied rewrites 23.2%

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

   7. Applied rewrites 23.2%

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

   9. Applied rewrites 23.2%

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

   11. Applied rewrites 23.1%

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

   if -5.00000000000000009e-195 < (/.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 15.6%

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

   4. Applied rewrites 16.6%

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

   5. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 3.7

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

   7. Applied rewrites 3.7%

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

   8. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 17.6

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

   10. Applied rewrites 17.6%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 19.7

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

   5. Applied rewrites 19.7%

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

   7. Applied rewrites 33.5%

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

   9. Applied rewrites 33.6%

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

4. Final simplification 25.5%

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

Alternative 9: 42.0% accurate, 3.2× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{hypot}\left(C, B\_m\right) + C\\ \mathbf{if}\;F \leq 2 \cdot 10^{-14}:\\ \;\;\;\;\frac{\sqrt{\left(t\_0 \cdot F\right) \cdot 2}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{F}}{-B\_m} \cdot \sqrt{t\_0 \cdot 2}\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (+ (hypot C B_m) C)))
   (if (<= F 2e-14)
     (/ (sqrt (* (* t_0 F) 2.0)) (- B_m))
     (* (/ (sqrt F) (- B_m)) (sqrt (* t_0 2.0))))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = hypot(C, B_m) + C;
	double tmp;
	if (F <= 2e-14) {
		tmp = sqrt(((t_0 * F) * 2.0)) / -B_m;
	} else {
		tmp = (sqrt(F) / -B_m) * sqrt((t_0 * 2.0));
	}
	return tmp;
}

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double t_0 = Math.hypot(C, B_m) + C;
	double tmp;
	if (F <= 2e-14) {
		tmp = Math.sqrt(((t_0 * F) * 2.0)) / -B_m;
	} else {
		tmp = (Math.sqrt(F) / -B_m) * Math.sqrt((t_0 * 2.0));
	}
	return tmp;
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	t_0 = math.hypot(C, B_m) + C
	tmp = 0
	if F <= 2e-14:
		tmp = math.sqrt(((t_0 * F) * 2.0)) / -B_m
	else:
		tmp = (math.sqrt(F) / -B_m) * math.sqrt((t_0 * 2.0))
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64(hypot(C, B_m) + C)
	tmp = 0.0
	if (F <= 2e-14)
		tmp = Float64(sqrt(Float64(Float64(t_0 * F) * 2.0)) / Float64(-B_m));
	else
		tmp = Float64(Float64(sqrt(F) / Float64(-B_m)) * sqrt(Float64(t_0 * 2.0)));
	end
	return tmp
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	t_0 = hypot(C, B_m) + C;
	tmp = 0.0;
	if (F <= 2e-14)
		tmp = sqrt(((t_0 * F) * 2.0)) / -B_m;
	else
		tmp = (sqrt(F) / -B_m) * sqrt((t_0 * 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := Block[{t$95$0 = N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision]}, If[LessEqual[F, 2e-14], N[(N[Sqrt[N[(N[(t$95$0 * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[F], $MachinePrecision] / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(t$95$0 * 2.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if F < 2e-14

   1. Initial program 32.8%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 20.9

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

   5. Applied rewrites 20.9%

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

   7. Applied rewrites 20.9%

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

   if 2e-14 < F

   1. Initial program 9.7%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 11.3

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

   5. Applied rewrites 11.3%

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

   7. Applied rewrites 21.9%

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

   9. Applied rewrites 22.1%

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

   11. Applied rewrites 21.8%

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

4. Final simplification 21.3%

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

Alternative 10: 42.5% accurate, 3.3× speedup

Math

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

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) B_m) (- (sqrt 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(((hypot(C, B_m) + C) * 2.0)) / B_m) * -sqrt(F);
}

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(((Math.hypot(C, B_m) + C) * 2.0)) / B_m) * -Math.sqrt(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(((math.hypot(C, B_m) + C) * 2.0)) / B_m) * -math.sqrt(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 Float64(Float64(sqrt(Float64(Float64(hypot(C, B_m) + C) * 2.0)) / B_m) * Float64(-sqrt(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(((hypot(C, B_m) + C) * 2.0)) / B_m) * -sqrt(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[(N[(N[Sqrt[N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]

Derivation

1. Initial program 22.8%

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

3. Taylor expanded in A around 0

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

   1. associate-*r* N/A

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

   2. lower-*.f64 N/A

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

   4. lower-neg.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 N/A

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

   10. +-commutative N/A

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

   11. lower-+.f64 N/A

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

   12. +-commutative N/A

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

   13. unpow2 N/A

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

   14. unpow2 N/A

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

   15. lower-hypot.f64 16.7

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

5. Applied rewrites 16.7%

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

7. Applied rewrites 22.3%

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

9. Applied rewrites 22.4%

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

10. Final simplification 22.4%

    \[\leadsto \frac{\sqrt{\left(\mathsf{hypot}\left(C, B\right) + C\right) \cdot 2}}{B} \cdot \left(-\sqrt{F}\right) \]
11. Add Preprocessing

Alternative 11: 38.7% 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} \mathbf{if}\;F \leq 0.00022:\\ \;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right) \cdot 2}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (if (<= F 0.00022)
   (/ (sqrt (* (* (+ (hypot C B_m) C) F) 2.0)) (- B_m))
   (* (/ (sqrt (* (+ C B_m) 2.0)) B_m) (- (sqrt 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) {
	double tmp;
	if (F <= 0.00022) {
		tmp = sqrt((((hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
	} else {
		tmp = (sqrt(((C + B_m) * 2.0)) / B_m) * -sqrt(F);
	}
	return tmp;
}

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (F <= 0.00022) {
		tmp = Math.sqrt((((Math.hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
	} else {
		tmp = (Math.sqrt(((C + B_m) * 2.0)) / B_m) * -Math.sqrt(F);
	}
	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 F <= 0.00022:
		tmp = math.sqrt((((math.hypot(C, B_m) + C) * F) * 2.0)) / -B_m
	else:
		tmp = (math.sqrt(((C + B_m) * 2.0)) / B_m) * -math.sqrt(F)
	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 (F <= 0.00022)
		tmp = Float64(sqrt(Float64(Float64(Float64(hypot(C, B_m) + C) * F) * 2.0)) / Float64(-B_m));
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(C + B_m) * 2.0)) / B_m) * Float64(-sqrt(F)));
	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 (F <= 0.00022)
		tmp = sqrt((((hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
	else
		tmp = (sqrt(((C + B_m) * 2.0)) / B_m) * -sqrt(F);
	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[F, 0.00022], N[(N[Sqrt[N[(N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if F < 2.20000000000000008e-4

   1. Initial program 31.8%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 20.6

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

   5. Applied rewrites 20.6%

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

   7. Applied rewrites 20.7%

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

   if 2.20000000000000008e-4 < F

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

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 11.2

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

   5. Applied rewrites 11.2%

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

   7. Applied rewrites 22.3%

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

   9. Applied rewrites 22.5%

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

   10. Taylor expanded in C around 0

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

   12. Applied rewrites 19.6%

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

4. Final simplification 20.2%

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

Alternative 12: 37.0% accurate, 9.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}\;C \leq 1.46 \cdot 10^{+212}:\\ \;\;\;\;\frac{\sqrt{F \cdot 2}}{-\sqrt{B\_m}}\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{2}{-B\_m} \cdot \sqrt{C}\right) \cdot \sqrt{F}\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (if (<= C 1.46e+212)
   (/ (sqrt (* F 2.0)) (- (sqrt B_m)))
   (* (* (/ 2.0 (- B_m)) (sqrt C)) (sqrt 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) {
	double tmp;
	if (C <= 1.46e+212) {
		tmp = sqrt((F * 2.0)) / -sqrt(B_m);
	} else {
		tmp = ((2.0 / -B_m) * sqrt(C)) * sqrt(F);
	}
	return tmp;
}

Fortran

B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (c <= 1.46d+212) then
        tmp = sqrt((f * 2.0d0)) / -sqrt(b_m)
    else
        tmp = ((2.0d0 / -b_m) * sqrt(c)) * sqrt(f)
    end if
    code = tmp
end function

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (C <= 1.46e+212) {
		tmp = Math.sqrt((F * 2.0)) / -Math.sqrt(B_m);
	} else {
		tmp = ((2.0 / -B_m) * Math.sqrt(C)) * Math.sqrt(F);
	}
	return tmp;
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	tmp = 0
	if C <= 1.46e+212:
		tmp = math.sqrt((F * 2.0)) / -math.sqrt(B_m)
	else:
		tmp = ((2.0 / -B_m) * math.sqrt(C)) * math.sqrt(F)
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if (C <= 1.46e+212)
		tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m)));
	else
		tmp = Float64(Float64(Float64(2.0 / Float64(-B_m)) * sqrt(C)) * sqrt(F));
	end
	return tmp
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	tmp = 0.0;
	if (C <= 1.46e+212)
		tmp = sqrt((F * 2.0)) / -sqrt(B_m);
	else
		tmp = ((2.0 / -B_m) * sqrt(C)) * sqrt(F);
	end
	tmp_2 = tmp;
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 1.46e+212], N[(N[Sqrt[N[(F * 2.0), $MachinePrecision]], $MachinePrecision] / (-N[Sqrt[B$95$m], $MachinePrecision])), $MachinePrecision], N[(N[(N[(2.0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[C], $MachinePrecision]), $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if C < 1.46e212

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

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 14.9

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

   5. Applied rewrites 14.9%

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

   7. Applied rewrites 15.0%

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

   9. Applied rewrites 20.5%

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

   if 1.46e212 < C

   1. Initial program 1.6%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 13.2

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

   5. Applied rewrites 13.2%

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

   7. Applied rewrites 21.4%

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

   9. Applied rewrites 21.4%

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

   10. Taylor expanded in B around 0

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

   12. Applied rewrites 13.8%

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

4. Final simplification 19.9%

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

Alternative 13: 35.9% accurate, 10.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(C + B\_m\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right) \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (* (/ (sqrt (* (+ C B_m) 2.0)) B_m) (- (sqrt 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(((C + B_m) * 2.0)) / B_m) * -sqrt(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(((c + b_m) * 2.0d0)) / b_m) * -sqrt(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(((C + B_m) * 2.0)) / B_m) * -Math.sqrt(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(((C + B_m) * 2.0)) / B_m) * -math.sqrt(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 Float64(Float64(sqrt(Float64(Float64(C + B_m) * 2.0)) / B_m) * Float64(-sqrt(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(((C + B_m) * 2.0)) / B_m) * -sqrt(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[(N[(N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]

Derivation

1. Initial program 22.8%

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

3. Taylor expanded in A around 0

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

   1. associate-*r* N/A

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

   2. lower-*.f64 N/A

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

   4. lower-neg.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 N/A

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

   10. +-commutative N/A

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

   11. lower-+.f64 N/A

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

   12. +-commutative N/A

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

   13. unpow2 N/A

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

   14. unpow2 N/A

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

   15. lower-hypot.f64 16.7

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

5. Applied rewrites 16.7%

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

7. Applied rewrites 22.3%

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

9. Applied rewrites 22.4%

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

10. Taylor expanded in C around 0

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

12. Applied rewrites 19.4%

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

13. Final simplification 19.4%

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

Alternative 14: 35.3% accurate, 12.6× speedup

Math

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

Derivation

1. Initial program 22.8%

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

3. Taylor expanded in B around inf

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. lower-/.f64 13.8

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

5. Applied rewrites 13.8%

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

7. Applied rewrites 13.8%

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

9. Applied rewrites 19.5%

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

10. Final simplification 19.5%

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

Alternative 15: 35.3% accurate, 12.6× speedup

Math

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

Julia

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

Derivation

1. Initial program 22.8%

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

3. Taylor expanded in B around inf

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. lower-/.f64 13.8

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

5. Applied rewrites 13.8%

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

7. Applied rewrites 13.8%

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

9. Applied rewrites 13.9%

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

11. Applied rewrites 19.5%

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

12. Final simplification 19.5%

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

Alternative 16: 35.3% accurate, 12.6× speedup

Math

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	return -sqrt(F) * sqrt((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) * sqrt((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) * Math.sqrt((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) * math.sqrt((2.0 / B_m))

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	return Float64(Float64(-sqrt(F)) * sqrt(Float64(2.0 / B_m)))
end

MATLAB

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

Derivation

1. Initial program 22.8%

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

3. Taylor expanded in B around inf

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. lower-/.f64 13.8

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

5. Applied rewrites 13.8%

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

7. Applied rewrites 13.8%

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

9. Applied rewrites 19.6%

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

10. Final simplification 19.6%

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

Alternative 17: 27.3% accurate, 16.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	return Float64(-sqrt(Float64(Float64(F / B_m) * 2.0)))
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
	tmp = -sqrt(((F / B_m) * 2.0));
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 22.8%

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

3. Taylor expanded in B around inf

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. lower-/.f64 13.8

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

5. Applied rewrites 13.8%

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

7. Applied rewrites 13.8%

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

Alternative 18: 27.3% accurate, 16.9× 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 Float64(-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 22.8%

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

3. Taylor expanded in B around inf

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. lower-/.f64 13.8

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

5. Applied rewrites 13.8%

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

7. Applied rewrites 13.8%

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

9. Applied rewrites 13.9%

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

10. Final simplification 13.9%

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

Reproduce

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