ABCF->ab-angle a

Percentage Accurate: 18.9% → 51.8%

Time: 17.5s

Alternatives: 13

Speedup: 16.9×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 18.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 51.8% accurate, 1.2× speedup

Math

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

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

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

      1. lower-*.f64 16.3

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

   5. Applied rewrites 16.3%

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

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

   1. Initial program 36.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*r* N/A

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

      7. associate-*r* N/A

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

      8. sqrt-prod N/A

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

      9. pow1/2 N/A

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

   4. Applied rewrites 48.8%

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

   if 4.00000000000000013e139 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 5.0%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 19.5

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

   5. Applied rewrites 19.5%

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

   7. Applied rewrites 26.3%

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

   9. Applied rewrites 26.4%

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

4. Final simplification 29.7%

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

Alternative 2: 50.8% accurate, 0.2× speedup

Math

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
	double t_1 = t_0 * (2.0 * F);
	double t_2 = (sqrt(F) * sqrt((B_m * ((B_m * -0.5) / A)))) * (sqrt(2.0) / -B_m);
	double t_3 = (4.0 * A) * C;
	double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B_m, 2.0));
	double t_5 = sqrt(fma((A - C), (A - C), (B_m * B_m))) + (A + C);
	double tmp;
	if (t_4 <= -((double) INFINITY)) {
		tmp = t_2;
	} else if (t_4 <= -2e-188) {
		tmp = sqrt((t_5 * t_1)) / -t_0;
	} else if (t_4 <= 0.0) {
		tmp = t_2;
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = (sqrt(t_5) / -1.0) * (sqrt(t_1) / t_0);
	} else {
		tmp = -(sqrt(F) * sqrt((2.0 / B_m)));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 3.5%

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

   3. 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. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

   5. Applied rewrites 7.2%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 9.4%

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

   10. Applied rewrites 8.8%

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

   12. Applied rewrites 11.3%

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

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

   1. Initial program 98.5%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      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 98.5%

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

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

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

   4. Applied rewrites 38.4%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 16.2

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

   5. Applied rewrites 16.2%

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

   7. Applied rewrites 20.8%

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

   9. Applied rewrites 20.9%

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

4. Final simplification 30.7%

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

Alternative 3: 50.6% accurate, 0.2× speedup

Math

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
	double t_1 = sqrt(((sqrt(fma((A - C), (A - C), (B_m * B_m))) + (A + C)) * (t_0 * (2.0 * F))));
	double t_2 = (sqrt(F) * sqrt((B_m * ((B_m * -0.5) / A)))) * (sqrt(2.0) / -B_m);
	double t_3 = (4.0 * A) * C;
	double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B_m, 2.0));
	double tmp;
	if (t_4 <= -((double) INFINITY)) {
		tmp = t_2;
	} else if (t_4 <= -2e-188) {
		tmp = t_1 / -t_0;
	} else if (t_4 <= 0.0) {
		tmp = t_2;
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_1 * (-1.0 / t_0);
	} else {
		tmp = -(sqrt(F) * sqrt((2.0 / B_m)));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 3.5%

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

   3. 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. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

   5. Applied rewrites 7.2%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 9.4%

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

   10. Applied rewrites 8.8%

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

   12. Applied rewrites 11.3%

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

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

   1. Initial program 98.5%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      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 98.5%

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

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

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

   4. Applied rewrites 34.2%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 16.2

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

   5. Applied rewrites 16.2%

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

   7. Applied rewrites 20.8%

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

   9. Applied rewrites 20.9%

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

4. Final simplification 30.4%

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

Alternative 4: 50.7% accurate, 0.2× speedup

Math

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma(B_m, B_m, (-4.0 * (A * C)));
	double t_1 = sqrt(((sqrt(fma((A - C), (A - C), (B_m * B_m))) + (A + C)) * (t_0 * (2.0 * F)))) / -t_0;
	double t_2 = (sqrt(F) * sqrt((B_m * ((B_m * -0.5) / A)))) * (sqrt(2.0) / -B_m);
	double t_3 = (4.0 * A) * C;
	double t_4 = sqrt(((2.0 * ((pow(B_m, 2.0) - t_3) * F)) * ((A + C) + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (t_3 - pow(B_m, 2.0));
	double tmp;
	if (t_4 <= -((double) INFINITY)) {
		tmp = t_2;
	} else if (t_4 <= -2e-188) {
		tmp = t_1;
	} else if (t_4 <= 0.0) {
		tmp = t_2;
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = -(sqrt(F) * sqrt((2.0 / B_m)));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 3.5%

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

   3. 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. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

   5. Applied rewrites 7.2%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 9.4%

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

   10. Applied rewrites 8.8%

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

   12. Applied rewrites 11.3%

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

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

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      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 75.3%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 16.2

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

   5. Applied rewrites 16.2%

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

   7. Applied rewrites 20.8%

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

   9. Applied rewrites 20.9%

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

4. Final simplification 30.4%

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

Alternative 5: 42.2% 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 := \left(4 \cdot A\right) \cdot C\\ t_1 := \frac{\sqrt{\left(2 \cdot \left(\left({B\_m}^{2} - t\_0\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)}}{t\_0 - {B\_m}^{2}}\\ \mathbf{if}\;t\_1 \leq -4 \cdot 10^{+143}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{B\_m \cdot \frac{B\_m \cdot -0.5}{A}}\right) \cdot \frac{\sqrt{2}}{-B\_m}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\sqrt{\frac{F \cdot \left(\left(A + C\right) + \sqrt{\mathsf{fma}\left(B\_m, B\_m, \left(A - C\right) \cdot \left(A - C\right)\right)}\right)}{\mathsf{fma}\left(B\_m, B\_m, -4 \cdot \left(A \cdot C\right)\right)}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{F} \cdot \sqrt{\frac{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 (* (* 4.0 A) C))
        (t_1
         (/
          (sqrt
           (*
            (* 2.0 (* (- (pow B_m 2.0) t_0) F))
            (+ (+ A C) (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))))))
          (- t_0 (pow B_m 2.0)))))
   (if (<= t_1 -4e+143)
     (* (* (sqrt F) (sqrt (* B_m (/ (* B_m -0.5) A)))) (/ (sqrt 2.0) (- B_m)))
     (if (<= t_1 INFINITY)
       (*
        (sqrt
         (/
          (* F (+ (+ A C) (sqrt (fma B_m B_m (* (- A C) (- A C))))))
          (fma B_m B_m (* -4.0 (* A C)))))
        (- (sqrt 2.0)))
       (- (* (sqrt F) (sqrt (/ 2.0 B_m))))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 10.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. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

   5. Applied rewrites 6.2%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 12.1%

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

   10. Applied rewrites 11.3%

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

   12. Applied rewrites 12.2%

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

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

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

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-neg-in N/A

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

      3. lower-*.f64 N/A

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

   5. Applied rewrites 44.4%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 16.2

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

   5. Applied rewrites 16.2%

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

   7. Applied rewrites 20.8%

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

   9. Applied rewrites 20.9%

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

4. Final simplification 28.1%

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

Alternative 6: 41.9% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999943e-30

   1. Initial program 19.1%

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

   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. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

   5. Applied rewrites 6.8%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 7.8%

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

   10. Applied rewrites 7.4%

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

   12. Applied rewrites 8.6%

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

   if 9.99999999999999943e-30 < (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000019e120

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

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

      1. mul-1-neg N/A

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

      2. associate-*l/ N/A

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

      3. distribute-neg-frac2 N/A

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

      4. mul-1-neg N/A

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

      5. lower-/.f64 N/A

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

   5. Applied rewrites 42.6%

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

   if 5.00000000000000019e120 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 7.8%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 19.1

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

   5. Applied rewrites 19.1%

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

   7. Applied rewrites 25.3%

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

   9. Applied rewrites 25.4%

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

4. Final simplification 19.1%

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

Alternative 7: 38.9% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 17.8%

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

   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. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

   5. Applied rewrites 2.8%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 5.4%

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

   10. Applied rewrites 10.2%

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

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

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

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

      1. mul-1-neg N/A

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

      2. associate-*l/ N/A

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

      3. distribute-neg-frac2 N/A

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

      4. mul-1-neg N/A

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

      5. lower-/.f64 N/A

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

   5. Applied rewrites 26.2%

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

   if 5.00000000000000019e120 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 7.8%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 19.1

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

   5. Applied rewrites 19.1%

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

   7. Applied rewrites 25.3%

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

   9. Applied rewrites 25.4%

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

4. Final simplification 21.0%

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

Alternative 8: 38.9% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 17.8%

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

   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. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

   5. Applied rewrites 2.8%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 5.4%

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

   10. Applied rewrites 10.2%

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

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

   1. Initial program 35.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 \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 16.8

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

   5. Applied rewrites 16.8%

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

   7. Applied rewrites 18.0%

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

   8. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-sqrt.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. lower-fma.f64 N/A

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

      14. unpow2 N/A

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

      15. lower-*.f64 26.2

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

   10. Applied rewrites 26.2%

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

   if 5.00000000000000019e120 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 7.8%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 19.1

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

   5. Applied rewrites 19.1%

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

   7. Applied rewrites 25.3%

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

   9. Applied rewrites 25.4%

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

4. Final simplification 21.0%

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

Alternative 9: 39.3% accurate, 2.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-29)
		tmp = Float64(Float64(sqrt(2.0) / Float64(-B_m)) * sqrt(Float64(Float64(-0.5 * Float64(B_m * Float64(B_m * F))) / A)));
	else
		tmp = Float64(-Float64(sqrt(F) * sqrt(Float64(2.0 / 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 ((B_m ^ 2.0) <= 1e-29)
		tmp = (sqrt(2.0) / -B_m) * sqrt(((-0.5 * (B_m * (B_m * F))) / A));
	else
		tmp = -(sqrt(F) * sqrt((2.0 / B_m)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999943e-30

   1. Initial program 19.1%

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

   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. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

   5. Applied rewrites 6.8%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 8.1%

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

   10. Applied rewrites 11.1%

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

   if 9.99999999999999943e-30 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 19.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 \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 21.5

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

   5. Applied rewrites 21.5%

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

   7. Applied rewrites 26.3%

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

   9. Applied rewrites 26.5%

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

4. Final simplification 18.8%

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

Alternative 10: 39.0% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if ((B_m ^ 2.0) <= 1e-29)
		tmp = Float64(sqrt(Float64(2.0 * Float64(F * Float64(B_m * Float64(Float64(B_m * -0.5) / A))))) / Float64(-B_m));
	else
		tmp = Float64(-Float64(sqrt(F) * sqrt(Float64(2.0 / 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 ((B_m ^ 2.0) <= 1e-29)
		tmp = sqrt((2.0 * (F * (B_m * ((B_m * -0.5) / A))))) / -B_m;
	else
		tmp = -(sqrt(F) * sqrt((2.0 / B_m)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 9.99999999999999943e-30

   1. Initial program 19.1%

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

   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. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. lower-*.f64 N/A

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

   5. Applied rewrites 6.8%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 7.8%

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

   10. Applied rewrites 7.4%

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

   12. Applied rewrites 12.8%

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

   if 9.99999999999999943e-30 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 19.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 \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 21.5

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

   5. Applied rewrites 21.5%

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

   7. Applied rewrites 26.3%

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

   9. Applied rewrites 26.5%

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

4. Final simplification 19.7%

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

Alternative 11: 35.5% accurate, 12.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 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 \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

   5. lower-sqrt.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-/.f64 13.5

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

5. Applied rewrites 13.5%

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

7. Applied rewrites 16.3%

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

9. Applied rewrites 16.4%

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

Alternative 12: 27.1% accurate, 16.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Derivation

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 \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

   5. lower-sqrt.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-/.f64 13.5

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

5. Applied rewrites 13.5%

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

7. Applied rewrites 13.5%

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

9. Applied rewrites 13.5%

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

10. Final simplification 13.5%

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

Alternative 13: 27.1% accurate, 16.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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 \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. *-commutative N/A

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

   4. lower-*.f64 N/A

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

   5. lower-sqrt.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-/.f64 13.5

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

5. Applied rewrites 13.5%

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

7. Applied rewrites 13.5%

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

9. Applied rewrites 13.5%

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

Reproduce

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