ABCF->ab-angle b

Percentage Accurate: 19.3% → 53.0%

Time: 16.8s

Alternatives: 14

Speedup: 6.3×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 19.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 53.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 10^{-216}:\\ \;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(F \cdot 2\right)\right) \cdot \left(A + A\right)}}{-t\_0}\\ \mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+299}:\\ \;\;\;\;\sqrt{\frac{\left(A + C\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)} \cdot F} \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;e^{0.5 \cdot \left(\log \left(-F\right) + \log B\_m\right)} \cdot \left(\left(-{\left({2}^{-0.5}\right)}^{-1}\right) \cdot {B\_m}^{-1}\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 (* A C) (* B_m B_m))))
   (if (<= (pow B_m 2.0) 1e-216)
     (/ (sqrt (* (* t_0 (* F 2.0)) (+ A A))) (- t_0))
     (if (<= (pow B_m 2.0) 5e+299)
       (*
        (sqrt
         (*
          (/ (- (+ A C) (hypot (- A C) B_m)) (fma (* -4.0 A) C (* B_m B_m)))
          F))
        (- (sqrt 2.0)))
       (*
        (exp (* 0.5 (+ (log (- F)) (log B_m))))
        (* (- (pow (pow 2.0 -0.5) -1.0)) (pow B_m -1.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 = fma(-4.0, (A * C), (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 1e-216) {
		tmp = sqrt(((t_0 * (F * 2.0)) * (A + A))) / -t_0;
	} else if (pow(B_m, 2.0) <= 5e+299) {
		tmp = sqrt(((((A + C) - hypot((A - C), B_m)) / fma((-4.0 * A), C, (B_m * B_m))) * F)) * -sqrt(2.0);
	} else {
		tmp = exp((0.5 * (log(-F) + log(B_m)))) * (-pow(pow(2.0, -0.5), -1.0) * pow(B_m, -1.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 = fma(-4.0, Float64(A * C), Float64(B_m * B_m))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-216)
		tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * Float64(A + A))) / Float64(-t_0));
	elseif ((B_m ^ 2.0) <= 5e+299)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(A + C) - hypot(Float64(A - C), B_m)) / fma(Float64(-4.0 * A), C, Float64(B_m * B_m))) * F)) * Float64(-sqrt(2.0)));
	else
		tmp = Float64(exp(Float64(0.5 * Float64(log(Float64(-F)) + log(B_m)))) * Float64(Float64(-((2.0 ^ -0.5) ^ -1.0)) * (B_m ^ -1.0)));
	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[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 1e-216], N[(N[Sqrt[N[(N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+299], N[(N[Sqrt[N[(N[(N[(N[(A + C), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(N[(-4.0 * A), $MachinePrecision] * C + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[2.0], $MachinePrecision])), $MachinePrecision], N[(N[Exp[N[(0.5 * N[(N[Log[(-F)], $MachinePrecision] + N[Log[B$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[((-N[Power[N[Power[2.0, -0.5], $MachinePrecision], -1.0], $MachinePrecision]) * N[Power[B$95$m, -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 21.1%

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

   5. Taylor expanded in C around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 17.9

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

   7. Applied rewrites 17.9%

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

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

   1. Initial program 29.8%

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

   3. Taylor expanded in F around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

   5. Applied rewrites 50.6%

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

   if 5.0000000000000003e299 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 1.8%

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

   3. Taylor expanded in C around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 21.8

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

   5. Applied rewrites 21.8%

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

   7. Applied rewrites 20.6%

      \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot e^{\log \left(\left(A - \mathsf{hypot}\left(A, B\right)\right) \cdot F\right) \cdot 0.5} \]

   8. Taylor expanded in B around inf

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

   10. Applied rewrites 25.0%

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

   12. Applied rewrites 25.0%

       \[\leadsto \left(-{B}^{-1} \cdot {\left({2}^{-0.5}\right)}^{-1}\right) \cdot e^{\color{blue}{\left(\log B + \log \left(-F\right)\right)} \cdot 0.5} \]
3. Recombined 3 regimes into one program.

4. Final simplification 33.8%

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

Alternative 2: 32.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\ t_1 := t\_0 \cdot \left(F \cdot 2\right)\\ t_2 := \left(4 \cdot A\right) \cdot C\\ t_3 := \frac{\sqrt{\left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_2\right) \cdot F\right) \cdot 2\right)}}{t\_2 - {B\_m}^{2}}\\ t_4 := -t\_0\\ \mathbf{if}\;t\_3 \leq -1 \cdot 10^{+162}:\\ \;\;\;\;\frac{\sqrt{t\_1 \cdot \left(A + A\right)}}{t\_4}\\ \mathbf{elif}\;t\_3 \leq -5 \cdot 10^{-217}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\left(\frac{C}{B\_m} - 1\right) + \frac{A}{B\_m}\right) \cdot B\_m\right) \cdot t\_1}}{t\_4}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right) \cdot t\_1}}{t\_4}\\ \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 (* A C) (* B_m B_m)))
        (t_1 (* t_0 (* F 2.0)))
        (t_2 (* (* 4.0 A) C))
        (t_3
         (/
          (sqrt
           (*
            (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* (- (pow B_m 2.0) t_2) F) 2.0)))
          (- t_2 (pow B_m 2.0))))
        (t_4 (- t_0)))
   (if (<= t_3 -1e+162)
     (/ (sqrt (* t_1 (+ A A))) t_4)
     (if (<= t_3 -5e-217)
       (/ (sqrt (* (* (+ (- (/ C B_m) 1.0) (/ A B_m)) B_m) t_1)) t_4)
       (/ (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) C) A) A) t_1)) t_4)))))

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

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 28.7%

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

   5. Taylor expanded in C around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 27.1

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

   7. Applied rewrites 27.1%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A + A\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 -9.9999999999999994e161 < (/.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.0000000000000002e-217

   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
   3. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 99.4%

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

   5. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. associate--l+ N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 40.2

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

   7. Applied rewrites 40.2%

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

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

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 6.3%

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

   5. Taylor expanded in C around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 9.0

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

   7. Applied rewrites 9.0%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) + A\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)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 16.6%

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

Alternative 3: 31.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\ t_1 := t\_0 \cdot \left(F \cdot 2\right)\\ t_2 := \mathsf{fma}\left(A \cdot C, -4, B\_m \cdot B\_m\right)\\ t_3 := \left(4 \cdot A\right) \cdot C\\ t_4 := \frac{\sqrt{\left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(\left({B\_m}^{2} - t\_3\right) \cdot F\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\ t_5 := -t\_0\\ \mathbf{if}\;t\_4 \leq -1 \cdot 10^{+162}:\\ \;\;\;\;\frac{\sqrt{t\_1 \cdot \left(A + A\right)}}{t\_5}\\ \mathbf{elif}\;t\_4 \leq -5 \cdot 10^{-217}:\\ \;\;\;\;\frac{-1}{t\_2} \cdot \sqrt{\left(\left(t\_2 \cdot F\right) \cdot 2\right) \cdot \left(-B\_m\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{C}, A\right) + A\right) \cdot t\_1}}{t\_5}\\ \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 (* A C) (* B_m B_m)))
        (t_1 (* t_0 (* F 2.0)))
        (t_2 (fma (* A C) -4.0 (* B_m B_m)))
        (t_3 (* (* 4.0 A) C))
        (t_4
         (/
          (sqrt
           (*
            (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))
            (* (* (- (pow B_m 2.0) t_3) F) 2.0)))
          (- t_3 (pow B_m 2.0))))
        (t_5 (- t_0)))
   (if (<= t_4 -1e+162)
     (/ (sqrt (* t_1 (+ A A))) t_5)
     (if (<= t_4 -5e-217)
       (* (/ -1.0 t_2) (sqrt (* (* (* t_2 F) 2.0) (- B_m))))
       (/ (sqrt (* (+ (fma -0.5 (/ (* B_m B_m) C) A) A) t_1)) t_5)))))

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

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 28.7%

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

   5. Taylor expanded in C around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 27.1

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

   7. Applied rewrites 27.1%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A + A\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 -9.9999999999999994e161 < (/.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.0000000000000002e-217

   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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 34.6

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

   5. Applied rewrites 34.6%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. div-inv N/A

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

      4. lift-neg.f64 N/A

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

      5. remove-double-neg N/A

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

      6. lift--.f64 N/A

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

   7. Applied rewrites 34.6%

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

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

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 6.3%

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

   5. Taylor expanded in C around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 9.0

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

   7. Applied rewrites 9.0%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) + A\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)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 15.9%

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

Alternative 4: 53.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := -\sqrt{2}\\ t_1 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 10^{-216}:\\ \;\;\;\;\frac{\sqrt{\left(t\_1 \cdot \left(F \cdot 2\right)\right) \cdot \left(A + A\right)}}{-t\_1}\\ \mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+299}:\\ \;\;\;\;\sqrt{\frac{\left(A + C\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)} \cdot F} \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_0}{B\_m} \cdot e^{0.5 \cdot \left(\log \left(-F\right) + \log B\_m\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 2.0))) (t_1 (fma -4.0 (* A C) (* B_m B_m))))
   (if (<= (pow B_m 2.0) 1e-216)
     (/ (sqrt (* (* t_1 (* F 2.0)) (+ A A))) (- t_1))
     (if (<= (pow B_m 2.0) 5e+299)
       (*
        (sqrt
         (*
          (/ (- (+ A C) (hypot (- A C) B_m)) (fma (* -4.0 A) C (* B_m B_m)))
          F))
        t_0)
       (* (/ t_0 B_m) (exp (* 0.5 (+ (log (- F)) (log B_m)))))))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = -sqrt(2.0);
	double t_1 = fma(-4.0, (A * C), (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 1e-216) {
		tmp = sqrt(((t_1 * (F * 2.0)) * (A + A))) / -t_1;
	} else if (pow(B_m, 2.0) <= 5e+299) {
		tmp = sqrt(((((A + C) - hypot((A - C), B_m)) / fma((-4.0 * A), C, (B_m * B_m))) * F)) * t_0;
	} else {
		tmp = (t_0 / B_m) * exp((0.5 * (log(-F) + log(B_m))));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 21.1%

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

   5. Taylor expanded in C around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 17.9

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

   7. Applied rewrites 17.9%

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

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

   1. Initial program 29.8%

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

   3. Taylor expanded in F around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

   5. Applied rewrites 50.6%

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

   if 5.0000000000000003e299 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 1.8%

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

   3. Taylor expanded in C around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 21.8

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

   5. Applied rewrites 21.8%

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

   7. Applied rewrites 20.6%

      \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot e^{\log \left(\left(A - \mathsf{hypot}\left(A, B\right)\right) \cdot F\right) \cdot 0.5} \]

   8. Taylor expanded in B around inf

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

   10. Applied rewrites 25.0%

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

4. Final simplification 33.8%

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

Alternative 5: 48.8% accurate, 1.3× speedup

Math

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

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma(-4.0, (A * C), (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 1e-216) {
		tmp = sqrt(((t_0 * (F * 2.0)) * (A + A))) / -t_0;
	} else if (pow(B_m, 2.0) <= 5e+299) {
		tmp = sqrt(((((A + C) - hypot((A - C), B_m)) / fma((-4.0 * A), C, (B_m * B_m))) * F)) * -sqrt(2.0);
	} else {
		tmp = sqrt((((A - hypot(A, B_m)) * F) * 2.0)) / -B_m;
	}
	return tmp;
}

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = fma(-4.0, Float64(A * C), Float64(B_m * B_m))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-216)
		tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * Float64(A + A))) / Float64(-t_0));
	elseif ((B_m ^ 2.0) <= 5e+299)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(A + C) - hypot(Float64(A - C), B_m)) / fma(Float64(-4.0 * A), C, Float64(B_m * B_m))) * F)) * Float64(-sqrt(2.0)));
	else
		tmp = Float64(sqrt(Float64(Float64(Float64(A - hypot(A, B_m)) * F) * 2.0)) / Float64(-B_m));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 21.1%

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

   5. Taylor expanded in C around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 17.9

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

   7. Applied rewrites 17.9%

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

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

   1. Initial program 29.8%

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

   3. Taylor expanded in F around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

   5. Applied rewrites 50.6%

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

   if 5.0000000000000003e299 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 1.8%

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

   3. Taylor expanded in C around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 21.8

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

   5. Applied rewrites 21.8%

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

   7. Applied rewrites 21.8%

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

   9. Applied rewrites 21.9%

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

4. Final simplification 33.1%

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

Alternative 6: 30.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-64}:\\ \;\;\;\;\frac{\sqrt{\left(t\_0 \cdot \left(F \cdot 2\right)\right) \cdot \left(A + A\right)}}{-t\_0}\\ \mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+303}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\left(B\_m \cdot B\_m\right) \cdot F\right) \cdot 2\right) \cdot \left(-B\_m\right)}}{-B\_m \cdot B\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{B\_m} \cdot \sqrt{F \cdot A}\\ \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 (* A C) (* B_m B_m))))
   (if (<= (pow B_m 2.0) 5e-64)
     (/ (sqrt (* (* t_0 (* F 2.0)) (+ A A))) (- t_0))
     (if (<= (pow B_m 2.0) 5e+303)
       (/ (sqrt (* (* (* (* B_m B_m) F) 2.0) (- B_m))) (- (* B_m B_m)))
       (* (/ -2.0 B_m) (sqrt (* F A)))))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma(-4.0, (A * C), (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 5e-64) {
		tmp = sqrt(((t_0 * (F * 2.0)) * (A + A))) / -t_0;
	} else if (pow(B_m, 2.0) <= 5e+303) {
		tmp = sqrt(((((B_m * B_m) * F) * 2.0) * -B_m)) / -(B_m * B_m);
	} else {
		tmp = (-2.0 / B_m) * sqrt((F * A));
	}
	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(A * C), Float64(B_m * B_m))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-64)
		tmp = Float64(sqrt(Float64(Float64(t_0 * Float64(F * 2.0)) * Float64(A + A))) / Float64(-t_0));
	elseif ((B_m ^ 2.0) <= 5e+303)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B_m * B_m) * F) * 2.0) * Float64(-B_m))) / Float64(-Float64(B_m * B_m)));
	else
		tmp = Float64(Float64(-2.0 / B_m) * sqrt(Float64(F * A)));
	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[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e-64], N[(N[Sqrt[N[(N[(t$95$0 * N[(F * 2.0), $MachinePrecision]), $MachinePrecision] * N[(A + A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 5e+303], N[(N[Sqrt[N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision] * (-B$95$m)), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m), $MachinePrecision])), $MachinePrecision], N[(N[(-2.0 / B$95$m), $MachinePrecision] * N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000033e-64

   1. Initial program 13.4%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 22.2%

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

   5. Taylor expanded in C around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 17.1

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

   7. Applied rewrites 17.1%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(A + A\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.00000000000000033e-64 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999997e303

   1. Initial program 34.3%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 13.5

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

   5. Applied rewrites 13.5%

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

   6. Taylor expanded in C around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 13.3

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

   8. Applied rewrites 13.3%

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

   9. Taylor expanded in C around 0

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

       1. unpow2 N/A

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

       2. lower-*.f64 13.6

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

   11. Applied rewrites 13.6%

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

   if 4.9999999999999997e303 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 0.0%

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

   3. Taylor expanded in C around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 20.8

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

   5. Applied rewrites 20.8%

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

   7. Applied rewrites 20.8%

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

   8. Taylor expanded in A around -inf

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

   10. Applied rewrites 4.7%

       \[\leadsto \sqrt{A \cdot F} \cdot \color{blue}{\frac{-2}{B}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 13.4%

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

Alternative 7: 29.0% accurate, 1.9× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-64}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\left(F \cdot \left(A + A\right)\right) \cdot C\right) \cdot A\right) \cdot -8}}{-\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}\\ \mathbf{elif}\;{B\_m}^{2} \leq 5 \cdot 10^{+303}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\left(B\_m \cdot B\_m\right) \cdot F\right) \cdot 2\right) \cdot \left(-B\_m\right)}}{-B\_m \cdot B\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{B\_m} \cdot \sqrt{F \cdot A}\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (if (<= (pow B_m 2.0) 5e-64)
   (/
    (sqrt (* (* (* (* F (+ A A)) C) A) -8.0))
    (- (fma -4.0 (* A C) (* B_m B_m))))
   (if (<= (pow B_m 2.0) 5e+303)
     (/ (sqrt (* (* (* (* B_m B_m) F) 2.0) (- B_m))) (- (* B_m B_m)))
     (* (/ -2.0 B_m) (sqrt (* F A))))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (pow(B_m, 2.0) <= 5e-64) {
		tmp = sqrt(((((F * (A + A)) * C) * A) * -8.0)) / -fma(-4.0, (A * C), (B_m * B_m));
	} else if (pow(B_m, 2.0) <= 5e+303) {
		tmp = sqrt(((((B_m * B_m) * F) * 2.0) * -B_m)) / -(B_m * B_m);
	} else {
		tmp = (-2.0 / B_m) * sqrt((F * A));
	}
	return tmp;
}

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-64)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(F * Float64(A + A)) * C) * A) * -8.0)) / Float64(-fma(-4.0, Float64(A * C), Float64(B_m * B_m))));
	elseif ((B_m ^ 2.0) <= 5e+303)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B_m * B_m) * F) * 2.0) * Float64(-B_m))) / Float64(-Float64(B_m * B_m)));
	else
		tmp = Float64(Float64(-2.0 / B_m) * sqrt(Float64(F * A)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000033e-64

   1. Initial program 13.4%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 22.2%

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

   5. Taylor expanded in C around inf

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

      1. rem-square-sqrt N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. rem-square-sqrt N/A

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

      6. lower-*.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. sub-neg N/A

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

      10. mul-1-neg N/A

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

      11. remove-double-neg N/A

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

      12. lower-+.f64 15.7

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

   7. Applied rewrites 15.7%

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

   if 5.00000000000000033e-64 < (pow.f64 B #s(literal 2 binary64)) < 4.9999999999999997e303

   1. Initial program 34.3%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 13.5

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

   5. Applied rewrites 13.5%

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

   6. Taylor expanded in C around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 13.3

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

   8. Applied rewrites 13.3%

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

   9. Taylor expanded in C around 0

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

       1. unpow2 N/A

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

       2. lower-*.f64 13.6

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

   11. Applied rewrites 13.6%

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

   if 4.9999999999999997e303 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 0.0%

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

   3. Taylor expanded in C around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 20.8

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

   5. Applied rewrites 20.8%

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

   7. Applied rewrites 20.8%

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

   8. Taylor expanded in A around -inf

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

   10. Applied rewrites 4.7%

       \[\leadsto \sqrt{A \cdot F} \cdot \color{blue}{\frac{-2}{B}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 12.7%

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

Alternative 8: 47.7% accurate, 2.0× speedup

Math

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

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma(-4.0, (A * C), (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 5e-64) {
		tmp = sqrt(((fma(-0.5, ((B_m * B_m) / C), A) + A) * (t_0 * (F * 2.0)))) / -t_0;
	} else {
		tmp = sqrt((((A - hypot(A, B_m)) * F) * 2.0)) / -B_m;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000033e-64

   1. Initial program 13.4%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 22.2%

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

   5. Taylor expanded in C around inf

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

      1. sub-neg N/A

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

      2. mul-1-neg N/A

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

      3. remove-double-neg N/A

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

      4. lower-+.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 17.8

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

   7. Applied rewrites 17.8%

      \[\leadsto \frac{\sqrt{\color{blue}{\left(\mathsf{fma}\left(-0.5, \frac{B \cdot B}{C}, A\right) + A\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.00000000000000033e-64 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 19.9%

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

   3. Taylor expanded in C around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 21.4

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

   5. Applied rewrites 21.4%

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

   7. Applied rewrites 21.4%

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

   9. Applied rewrites 21.4%

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

4. Final simplification 19.7%

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

Alternative 9: 23.0% accurate, 6.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 := \frac{\sqrt{\left(\left(\left(A \cdot A\right) \cdot C\right) \cdot F\right) \cdot -16}}{-\mathsf{fma}\left(-4, A \cdot C, B\_m \cdot B\_m\right)}\\ \mathbf{if}\;A \leq -1.5 \cdot 10^{+135}:\\ \;\;\;\;\frac{\left(--2\right) \cdot \sqrt{F \cdot A}}{-B\_m}\\ \mathbf{elif}\;A \leq -3.3 \cdot 10^{-122}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;A \leq 2.45 \cdot 10^{-117}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\left(B\_m \cdot B\_m\right) \cdot F\right) \cdot 2\right) \cdot \left(-B\_m\right)}}{-B\_m \cdot B\_m}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \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 (* (* (* (* A A) C) F) -16.0))
          (- (fma -4.0 (* A C) (* B_m B_m))))))
   (if (<= A -1.5e+135)
     (/ (* (- -2.0) (sqrt (* F A))) (- B_m))
     (if (<= A -3.3e-122)
       t_0
       (if (<= A 2.45e-117)
         (/ (sqrt (* (* (* (* B_m B_m) F) 2.0) (- B_m))) (- (* B_m B_m)))
         t_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 = sqrt(((((A * A) * C) * F) * -16.0)) / -fma(-4.0, (A * C), (B_m * B_m));
	double tmp;
	if (A <= -1.5e+135) {
		tmp = (-(-2.0) * sqrt((F * A))) / -B_m;
	} else if (A <= -3.3e-122) {
		tmp = t_0;
	} else if (A <= 2.45e-117) {
		tmp = sqrt(((((B_m * B_m) * F) * 2.0) * -B_m)) / -(B_m * B_m);
	} else {
		tmp = t_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(sqrt(Float64(Float64(Float64(Float64(A * A) * C) * F) * -16.0)) / Float64(-fma(-4.0, Float64(A * C), Float64(B_m * B_m))))
	tmp = 0.0
	if (A <= -1.5e+135)
		tmp = Float64(Float64(Float64(-(-2.0)) * sqrt(Float64(F * A))) / Float64(-B_m));
	elseif (A <= -3.3e-122)
		tmp = t_0;
	elseif (A <= 2.45e-117)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(B_m * B_m) * F) * 2.0) * Float64(-B_m))) / Float64(-Float64(B_m * B_m)));
	else
		tmp = t_0;
	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[Sqrt[N[(N[(N[(N[(A * A), $MachinePrecision] * C), $MachinePrecision] * F), $MachinePrecision] * -16.0), $MachinePrecision]], $MachinePrecision] / (-N[(-4.0 * N[(A * C), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision])), $MachinePrecision]}, If[LessEqual[A, -1.5e+135], N[(N[((--2.0) * N[Sqrt[N[(F * A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[A, -3.3e-122], t$95$0, If[LessEqual[A, 2.45e-117], N[(N[Sqrt[N[(N[(N[(N[(B$95$m * B$95$m), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision] * (-B$95$m)), $MachinePrecision]], $MachinePrecision] / (-N[(B$95$m * B$95$m), $MachinePrecision])), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if A < -1.5e135

   1. Initial program 4.5%

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

   3. Taylor expanded in C around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 5.9

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

   5. Applied rewrites 5.9%

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

   7. Applied rewrites 5.9%

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

   8. Taylor expanded in A around -inf

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

   10. Applied rewrites 5.9%

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

   if -1.5e135 < A < -3.29999999999999999e-122 or 2.4499999999999999e-117 < A

   1. Initial program 15.6%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lower-/.f64 N/A

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

   4. Applied rewrites 17.5%

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

   5. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 11.8

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

   7. Applied rewrites 11.8%

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

   if -3.29999999999999999e-122 < A < 2.4499999999999999e-117

   1. Initial program 25.1%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 10.5

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

   5. Applied rewrites 10.5%

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

   6. Taylor expanded in C around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 10.1

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

   8. Applied rewrites 10.1%

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

   9. Taylor expanded in C around 0

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

       1. unpow2 N/A

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

       2. lower-*.f64 9.9

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

   11. Applied rewrites 9.9%

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

4. Final simplification 10.3%

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

Alternative 10: 14.5% accurate, 8.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if A < -8.19999999999999998e-61

   1. Initial program 9.4%

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

   3. Taylor expanded in C around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 8.9

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

   5. Applied rewrites 8.9%

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

   7. Applied rewrites 8.9%

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

   8. Taylor expanded in A around -inf

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

   10. Applied rewrites 5.0%

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

   if -8.19999999999999998e-61 < A

   1. Initial program 19.2%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 6.9

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

   5. Applied rewrites 6.9%

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

   6. Taylor expanded in C around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 6.4

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

   8. Applied rewrites 6.4%

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

   9. Taylor expanded in C around 0

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

       1. unpow2 N/A

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

       2. lower-*.f64 6.6

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

   11. Applied rewrites 6.6%

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

4. Final simplification 6.2%

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

Alternative 11: 9.3% accurate, 13.6× speedup

Math

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

MATLAB

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

Derivation

1. Initial program 16.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. lower--.f64 N/A

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

   11. +-commutative N/A

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

   12. unpow2 N/A

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

   13. unpow2 N/A

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

   14. lower-hypot.f64 14.2

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

5. Applied rewrites 14.2%

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

7. Applied rewrites 14.2%

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

8. Taylor expanded in A around -inf

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

10. Applied rewrites 2.4%

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

11. Final simplification 2.4%

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

Alternative 12: 9.3% accurate, 15.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 16.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. lower--.f64 N/A

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

   11. +-commutative N/A

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

   12. unpow2 N/A

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

   13. unpow2 N/A

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

   14. lower-hypot.f64 14.2

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

5. Applied rewrites 14.2%

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

7. Applied rewrites 14.2%

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

8. Taylor expanded in A around -inf

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

10. Applied rewrites 2.4%

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

11. Final simplification 2.4%

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

Alternative 13: 1.6% accurate, 18.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. *-commutative N/A

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

   7. unpow2 N/A

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

   8. rem-square-sqrt N/A

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

   9. lower-*.f64 N/A

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

   10. lower-sqrt.f64 N/A

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

   11. lower-sqrt.f64 N/A

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

   12. lower-/.f64 1.9

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

5. Applied rewrites 1.9%

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

7. Applied rewrites 1.9%

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

9. Applied rewrites 1.9%

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

Alternative 14: 1.6% accurate, 18.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. *-commutative N/A

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

   7. unpow2 N/A

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

   8. rem-square-sqrt N/A

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

   9. lower-*.f64 N/A

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

   10. lower-sqrt.f64 N/A

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

   11. lower-sqrt.f64 N/A

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

   12. lower-/.f64 1.9

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

5. Applied rewrites 1.9%

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

7. Applied rewrites 1.9%

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

9. Applied rewrites 1.9%

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

11. Applied rewrites 1.9%

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

12. Final simplification 1.9%

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

Reproduce

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