ABCF->ab-angle a

Percentage Accurate: 18.9% → 60.2%

Time: 19.4s

Alternatives: 16

Speedup: 6.0×

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: 60.2% accurate, 0.3× speedup

Math

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 4.6%

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

   3. Simplified 13.5%

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

      1. pow1/2 13.6%

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

      2. pow-to-exp 13.0%

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

   6. Applied egg-rr 13.0%

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

   7. Taylor expanded in A around -inf 10.8%

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

      1. exp-to-pow 12.1%

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

      2. pow1/2 11.5%

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

      3. associate-*l* 11.5%

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

      4. sqrt-prod 19.4%

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

      5. sqrt-prod 29.0%

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

      6. fma-undefine 29.0%

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

      7. add-sqr-sqrt 28.4%

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

      8. hypot-define 28.4%

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

      9. *-commutative 28.4%

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

   9. Applied egg-rr 28.4%

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

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

   1. Initial program 96.6%

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

   3. Simplified 96.6%

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

   if -5.0000000000000002e-210 < (/.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 16.6%

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

   3. Simplified 23.1%

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

   5. Taylor expanded in A around -inf 26.9%

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

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

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

      2. *-commutative 1.8%

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

      3. *-commutative 1.8%

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

      4. +-commutative 1.8%

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

      5. unpow2 1.8%

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

      6. unpow2 1.8%

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

      7. hypot-define 19.8%

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

   5. Simplified 19.8%

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

      1. sqrt-prod 26.0%

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

   7. Applied egg-rr 26.0%

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

4. Final simplification 36.0%

   \[\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 -5 \cdot 10^{+237}:\\ \;\;\;\;\frac{\left(\sqrt{F} \cdot \mathsf{hypot}\left(B, \sqrt{A \cdot \left(C \cdot -4\right)}\right)\right) \cdot \sqrt{2 \cdot \left(2 \cdot C\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\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 -5 \cdot 10^{-210}:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)\right) \cdot \left(2 \cdot \left(A + \left(C + \mathsf{hypot}\left(B, A - C\right)\right)\right)\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\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 \infty:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot \mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)\right) \cdot \left(4 \cdot C - \frac{{B}^{2}}{A}\right)}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{C + \mathsf{hypot}\left(C, B\right)}\right) \cdot \frac{\sqrt{2}}{-B}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 57.0% 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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-8}:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C - \frac{{B\_m}^{2}}{A}\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right) \cdot \frac{\sqrt{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 (* A (* C -4.0)))))
   (if (<= (pow B_m 2.0) 5e-8)
     (/ (sqrt (* (* F t_0) (- (* 4.0 C) (/ (pow B_m 2.0) A)))) (- t_0))
     (* (* (sqrt F) (sqrt (+ C (hypot C B_m)))) (/ (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, (A * (C * -4.0)));
	double tmp;
	if (pow(B_m, 2.0) <= 5e-8) {
		tmp = sqrt(((F * t_0) * ((4.0 * C) - (pow(B_m, 2.0) / A)))) / -t_0;
	} else {
		tmp = (sqrt(F) * sqrt((C + hypot(C, B_m)))) * (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(A * Float64(C * -4.0)))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-8)
		tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(Float64(4.0 * C) - Float64((B_m ^ 2.0) / A)))) / Float64(-t_0));
	else
		tmp = Float64(Float64(sqrt(F) * sqrt(Float64(C + hypot(C, B_m)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

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

   3. Simplified 23.9%

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

   5. Taylor expanded in A around -inf 18.0%

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

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

   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 A around 0 8.7%

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

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

      2. *-commutative 8.7%

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

      3. *-commutative 8.7%

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

      4. +-commutative 8.7%

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

      5. unpow2 8.7%

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

      6. unpow2 8.7%

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

      7. hypot-define 21.7%

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

   5. Simplified 21.7%

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

      1. sqrt-prod 27.7%

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

   7. Applied egg-rr 27.7%

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

4. Final simplification 23.0%

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

Alternative 3: 57.4% 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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-8}:\\ \;\;\;\;\frac{\sqrt{F \cdot \left(2 \cdot t\_0\right)} \cdot \sqrt{2 \cdot C}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right) \cdot \frac{\sqrt{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 (* A (* C -4.0)))))
   (if (<= (pow B_m 2.0) 5e-8)
     (/ (* (sqrt (* F (* 2.0 t_0))) (sqrt (* 2.0 C))) (- t_0))
     (* (* (sqrt F) (sqrt (+ C (hypot C B_m)))) (/ (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, (A * (C * -4.0)));
	double tmp;
	if (pow(B_m, 2.0) <= 5e-8) {
		tmp = (sqrt((F * (2.0 * t_0))) * sqrt((2.0 * C))) / -t_0;
	} else {
		tmp = (sqrt(F) * sqrt((C + hypot(C, B_m)))) * (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(A * Float64(C * -4.0)))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-8)
		tmp = Float64(Float64(sqrt(Float64(F * Float64(2.0 * t_0))) * sqrt(Float64(2.0 * C))) / Float64(-t_0));
	else
		tmp = Float64(Float64(sqrt(F) * sqrt(Float64(C + hypot(C, B_m)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

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

   3. Simplified 23.9%

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

      1. pow1/2 23.9%

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

      2. pow-to-exp 22.5%

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

   6. Applied egg-rr 22.5%

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

   7. Taylor expanded in A around -inf 16.0%

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

      1. exp-to-pow 17.3%

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

      2. pow1/2 17.2%

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

      3. sqrt-prod 19.4%

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

      4. associate-*l* 19.4%

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

      5. *-commutative 19.4%

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

   9. Applied egg-rr 19.4%

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

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

   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 A around 0 8.7%

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

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

      2. *-commutative 8.7%

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

      3. *-commutative 8.7%

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

      4. +-commutative 8.7%

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

      5. unpow2 8.7%

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

      6. unpow2 8.7%

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

      7. hypot-define 21.7%

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

   5. Simplified 21.7%

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

      1. sqrt-prod 27.7%

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

   7. Applied egg-rr 27.7%

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

4. Final simplification 23.7%

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

Alternative 4: 57.3% 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 := \mathsf{fma}\left(B\_m, B\_m, A \cdot \left(C \cdot -4\right)\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{-8}:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{F} \cdot \sqrt{C + \mathsf{hypot}\left(C, B\_m\right)}\right) \cdot \frac{\sqrt{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 (* A (* C -4.0)))))
   (if (<= (pow B_m 2.0) 5e-8)
     (/ (sqrt (* (* F t_0) (* 4.0 C))) (- t_0))
     (* (* (sqrt F) (sqrt (+ C (hypot C B_m)))) (/ (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, (A * (C * -4.0)));
	double tmp;
	if (pow(B_m, 2.0) <= 5e-8) {
		tmp = sqrt(((F * t_0) * (4.0 * C))) / -t_0;
	} else {
		tmp = (sqrt(F) * sqrt((C + hypot(C, B_m)))) * (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(A * Float64(C * -4.0)))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-8)
		tmp = Float64(sqrt(Float64(Float64(F * t_0) * Float64(4.0 * C))) / Float64(-t_0));
	else
		tmp = Float64(Float64(sqrt(F) * sqrt(Float64(C + hypot(C, B_m)))) * Float64(sqrt(2.0) / Float64(-B_m)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

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

   3. Simplified 23.9%

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

   5. Taylor expanded in A around -inf 17.2%

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

      1. *-commutative 17.2%

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

   7. Simplified 17.2%

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

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

   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 A around 0 8.7%

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

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

      2. *-commutative 8.7%

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

      3. *-commutative 8.7%

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

      4. +-commutative 8.7%

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

      5. unpow2 8.7%

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

      6. unpow2 8.7%

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

      7. hypot-define 21.7%

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

   5. Simplified 21.7%

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

      1. sqrt-prod 27.7%

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

   7. Applied egg-rr 27.7%

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

4. Final simplification 22.7%

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

Alternative 5: 52.5% accurate, 1.5× speedup

Math

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

FPCore

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

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

Derivation

1. Split input into 2 regimes

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

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

   3. Simplified 23.9%

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

   5. Taylor expanded in A around -inf 17.2%

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

      1. *-commutative 17.2%

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

   7. Simplified 17.2%

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

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

   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 A around 0 8.7%

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

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

      2. *-commutative 8.7%

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

      3. *-commutative 8.7%

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

      4. +-commutative 8.7%

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

      5. unpow2 8.7%

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

      6. unpow2 8.7%

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

      7. hypot-define 21.7%

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

   5. Simplified 21.7%

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

      1. sqrt-prod 27.7%

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

   7. Applied egg-rr 27.7%

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

   8. Taylor expanded in C around 0 23.1%

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

4. Final simplification 20.3%

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

Alternative 6: 43.9% accurate, 2.0× speedup

Math

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

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 2.2e+53) {
		tmp = -2.0 * sqrt(((C * F) / (pow(B_m, 2.0) + (-4.0 * (A * C)))));
	} else {
		tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
	}
	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.2d+53) then
        tmp = (-2.0d0) * sqrt(((c * f) / ((b_m ** 2.0d0) + ((-4.0d0) * (a * c)))))
    else
        tmp = (sqrt(2.0d0) / b_m) * (sqrt(f) * -sqrt((b_m + c)))
    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 (B_m <= 2.2e+53) {
		tmp = -2.0 * Math.sqrt(((C * F) / (Math.pow(B_m, 2.0) + (-4.0 * (A * C)))));
	} else {
		tmp = (Math.sqrt(2.0) / B_m) * (Math.sqrt(F) * -Math.sqrt((B_m + C)));
	}
	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 B_m <= 2.2e+53:
		tmp = -2.0 * math.sqrt(((C * F) / (math.pow(B_m, 2.0) + (-4.0 * (A * C)))))
	else:
		tmp = (math.sqrt(2.0) / B_m) * (math.sqrt(F) * -math.sqrt((B_m + C)))
	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.2e+53)
		tmp = Float64(-2.0 * sqrt(Float64(Float64(C * F) / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C))))));
	else
		tmp = Float64(Float64(sqrt(2.0) / B_m) * Float64(sqrt(F) * Float64(-sqrt(Float64(B_m + C)))));
	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.2e+53)
		tmp = -2.0 * sqrt(((C * F) / ((B_m ^ 2.0) + (-4.0 * (A * C)))));
	else
		tmp = (sqrt(2.0) / B_m) * (sqrt(F) * -sqrt((B_m + C)));
	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[B$95$m, 2.2e+53], N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[2.0], $MachinePrecision] / B$95$m), $MachinePrecision] * N[(N[Sqrt[F], $MachinePrecision] * (-N[Sqrt[N[(B$95$m + C), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < 2.19999999999999999e53

   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} \]

   3. Simplified 23.4%

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

      1. pow1/2 23.4%

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

      2. pow-to-exp 22.1%

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

   6. Applied egg-rr 22.1%

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

   7. Taylor expanded in A around -inf 10.9%

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

   8. Taylor expanded in F around 0 11.7%

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

   if 2.19999999999999999e53 < B

   1. Initial program 11.4%

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

   3. Taylor expanded in A around 0 13.8%

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

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

      2. *-commutative 13.8%

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

      3. *-commutative 13.8%

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

      4. +-commutative 13.8%

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

      5. unpow2 13.8%

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

      6. unpow2 13.8%

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

      7. hypot-define 49.2%

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

   5. Simplified 49.2%

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

      1. sqrt-prod 65.8%

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

   7. Applied egg-rr 65.8%

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

   8. Taylor expanded in C around 0 58.3%

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

4. Final simplification 20.2%

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

Alternative 7: 43.2% 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 \leq 2.2 \cdot 10^{+53}:\\ \;\;\;\;-2 \cdot \sqrt{\frac{C \cdot F}{{B\_m}^{2} + -4 \cdot \left(A \cdot C\right)}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2 \cdot F} \cdot \left(-{B\_m}^{-0.5}\right)\\ \end{array} \end{array} \]

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 2.2e+53) {
		tmp = -2.0 * sqrt(((C * F) / (pow(B_m, 2.0) + (-4.0 * (A * C)))));
	} else {
		tmp = sqrt((2.0 * F)) * -pow(B_m, -0.5);
	}
	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.2d+53) then
        tmp = (-2.0d0) * sqrt(((c * f) / ((b_m ** 2.0d0) + ((-4.0d0) * (a * c)))))
    else
        tmp = sqrt((2.0d0 * f)) * -(b_m ** (-0.5d0))
    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 (B_m <= 2.2e+53) {
		tmp = -2.0 * Math.sqrt(((C * F) / (Math.pow(B_m, 2.0) + (-4.0 * (A * C)))));
	} else {
		tmp = Math.sqrt((2.0 * F)) * -Math.pow(B_m, -0.5);
	}
	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 B_m <= 2.2e+53:
		tmp = -2.0 * math.sqrt(((C * F) / (math.pow(B_m, 2.0) + (-4.0 * (A * C)))))
	else:
		tmp = math.sqrt((2.0 * F)) * -math.pow(B_m, -0.5)
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if (B_m <= 2.2e+53)
		tmp = Float64(-2.0 * sqrt(Float64(Float64(C * F) / Float64((B_m ^ 2.0) + Float64(-4.0 * Float64(A * C))))));
	else
		tmp = Float64(sqrt(Float64(2.0 * F)) * Float64(-(B_m ^ -0.5)));
	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.2e+53)
		tmp = -2.0 * sqrt(((C * F) / ((B_m ^ 2.0) + (-4.0 * (A * C)))));
	else
		tmp = sqrt((2.0 * F)) * -(B_m ^ -0.5);
	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[B$95$m, 2.2e+53], N[(-2.0 * N[Sqrt[N[(N[(C * F), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(2.0 * F), $MachinePrecision]], $MachinePrecision] * (-N[Power[B$95$m, -0.5], $MachinePrecision])), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < 2.19999999999999999e53

   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} \]

   3. Simplified 23.4%

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

      1. pow1/2 23.4%

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

      2. pow-to-exp 22.1%

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

   6. Applied egg-rr 22.1%

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

   7. Taylor expanded in A around -inf 10.9%

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

   8. Taylor expanded in F around 0 11.7%

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

   if 2.19999999999999999e53 < B

   1. Initial program 11.4%

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

   3. Taylor expanded in B around inf 40.1%

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

      1. mul-1-neg 40.1%

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

      2. *-commutative 40.1%

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

   5. Simplified 40.1%

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

      1. *-commutative 40.1%

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

      2. pow1/2 40.1%

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

      3. pow1/2 40.1%

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

      4. pow-prod-down 40.3%

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

   7. Applied egg-rr 40.3%

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

      1. unpow1/2 40.3%

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

   9. Simplified 40.3%

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

       1. sqrt-prod 40.1%

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

       2. div-inv 40.1%

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

       3. sqrt-unprod 58.6%

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

       4. *-commutative 58.6%

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

       5. associate-*r* 58.8%

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

       6. distribute-rgt-neg-in 58.8%

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

       7. sqrt-unprod 58.7%

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

       8. inv-pow 58.7%

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

       9. sqrt-pow1 58.7%

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

       10. metadata-eval 58.7%

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

   11. Applied egg-rr 58.7%

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

       1. distribute-rgt-neg-out 58.7%

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

       2. distribute-lft-neg-out 58.7%

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

       3. *-commutative 58.7%

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

       4. *-commutative 58.7%

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

   13. Simplified 58.7%

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

4. Final simplification 20.3%

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

Alternative 8: 38.8% 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}\;F \leq 8.8 \cdot 10^{+49}:\\ \;\;\;\;\frac{\sqrt{\left(C + \mathsf{hypot}\left(C, B\_m\right)\right) \cdot \left(2 \cdot F\right)}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2 \cdot F} \cdot \left(-{B\_m}^{-0.5}\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if F < 8.8000000000000003e49

   1. Initial program 22.7%

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

   3. Taylor expanded in A around 0 6.7%

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

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

      2. *-commutative 6.7%

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

      3. *-commutative 6.7%

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

      4. +-commutative 6.7%

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

      5. unpow2 6.7%

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

      6. unpow2 6.7%

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

      7. hypot-define 17.3%

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

   5. Simplified 17.3%

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

      1. sqrt-prod 17.9%

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

   7. Applied egg-rr 17.9%

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

      1. neg-sub0 17.9%

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

      2. associate-*r/ 17.9%

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

      3. sqrt-unprod 17.2%

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

      4. sqrt-prod 17.3%

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

      5. associate-*l* 17.3%

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

   9. Applied egg-rr 17.3%

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

       1. neg-sub0 17.3%

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

       2. distribute-frac-neg2 17.3%

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

   11. Simplified 17.3%

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

   if 8.8000000000000003e49 < F

   1. Initial program 8.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 B around inf 13.6%

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

      1. mul-1-neg 13.6%

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

      2. *-commutative 13.6%

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

   5. Simplified 13.6%

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

      1. *-commutative 13.6%

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

      2. pow1/2 14.0%

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

      3. pow1/2 14.0%

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

      4. pow-prod-down 14.1%

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

   7. Applied egg-rr 14.1%

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

      1. unpow1/2 13.6%

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

   9. Simplified 13.6%

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

       1. sqrt-prod 13.6%

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

       2. div-inv 13.6%

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

       3. sqrt-unprod 13.7%

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

       4. *-commutative 13.7%

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

       5. associate-*r* 13.7%

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

       6. distribute-rgt-neg-in 13.7%

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

       7. sqrt-unprod 13.7%

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

       8. inv-pow 13.7%

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

       9. sqrt-pow1 13.7%

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

       10. metadata-eval 13.7%

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

   11. Applied egg-rr 13.7%

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

       1. distribute-rgt-neg-out 13.7%

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

       2. distribute-lft-neg-out 13.7%

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

       3. *-commutative 13.7%

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

       4. *-commutative 13.7%

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

   13. Simplified 13.7%

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

4. Final simplification 15.8%

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

Alternative 9: 38.8% 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}\;F \leq 2.3 \cdot 10^{+50}:\\ \;\;\;\;\frac{\sqrt{2 \cdot \left(F \cdot \left(C + \mathsf{hypot}\left(C, B\_m\right)\right)\right)}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{2 \cdot F} \cdot \left(-{B\_m}^{-0.5}\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if F < 2.29999999999999997e50

   1. Initial program 22.7%

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

   3. Taylor expanded in A around 0 6.7%

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

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

      2. *-commutative 6.7%

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

      3. *-commutative 6.7%

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

      4. +-commutative 6.7%

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

      5. unpow2 6.7%

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

      6. unpow2 6.7%

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

      7. hypot-define 17.3%

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

   5. Simplified 17.3%

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

      1. neg-sub0 17.3%

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

      2. associate-*r/ 17.2%

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

      3. pow1/2 17.4%

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

      4. pow1/2 17.4%

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

      5. pow-prod-down 17.4%

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

   7. Applied egg-rr 17.4%

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

      1. neg-sub0 17.4%

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

      2. distribute-neg-frac2 17.4%

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

      3. unpow1/2 17.3%

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

   9. Simplified 17.3%

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

   if 2.29999999999999997e50 < F

   1. Initial program 8.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 B around inf 13.6%

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

      1. mul-1-neg 13.6%

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

      2. *-commutative 13.6%

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

   5. Simplified 13.6%

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

      1. *-commutative 13.6%

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

      2. pow1/2 14.0%

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

      3. pow1/2 14.0%

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

      4. pow-prod-down 14.1%

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

   7. Applied egg-rr 14.1%

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

      1. unpow1/2 13.6%

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

   9. Simplified 13.6%

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

       1. sqrt-prod 13.6%

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

       2. div-inv 13.6%

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

       3. sqrt-unprod 13.7%

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

       4. *-commutative 13.7%

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

       5. associate-*r* 13.7%

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

       6. distribute-rgt-neg-in 13.7%

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

       7. sqrt-unprod 13.7%

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

       8. inv-pow 13.7%

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

       9. sqrt-pow1 13.7%

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

       10. metadata-eval 13.7%

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

   11. Applied egg-rr 13.7%

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

       1. distribute-rgt-neg-out 13.7%

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

       2. distribute-lft-neg-out 13.7%

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

       3. *-commutative 13.7%

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

       4. *-commutative 13.7%

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

   13. Simplified 13.7%

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

4. Final simplification 15.8%

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

Alternative 10: 35.5% accurate, 3.1× 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 F} \cdot \left(-{B\_m}^{-0.5}\right) \end{array} \]

FPCore

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

C

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

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 ** (-0.5d0))
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)) * -Math.pow(B_m, -0.5);
}

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)) * -math.pow(B_m, -0.5)

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 * F)) * Float64(-(B_m ^ -0.5)))
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 ^ -0.5);
end

Wolfram

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

Derivation

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

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

   1. mul-1-neg 11.2%

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

   2. *-commutative 11.2%

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

5. Simplified 11.2%

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

   1. *-commutative 11.2%

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

   2. pow1/2 11.4%

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

   3. pow1/2 11.4%

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

   4. pow-prod-down 11.4%

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

7. Applied egg-rr 11.4%

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

   1. unpow1/2 11.2%

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

9. Simplified 11.2%

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

    1. sqrt-prod 11.2%

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

    2. div-inv 11.2%

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

    3. sqrt-unprod 14.2%

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

    4. *-commutative 14.2%

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

    5. associate-*r* 14.2%

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

    6. distribute-rgt-neg-in 14.2%

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

    7. sqrt-unprod 14.2%

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

    8. inv-pow 14.2%

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

    9. sqrt-pow1 14.2%

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

    10. metadata-eval 14.2%

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

11. Applied egg-rr 14.2%

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

    1. distribute-rgt-neg-out 14.2%

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

    2. distribute-lft-neg-out 14.2%

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

    3. *-commutative 14.2%

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

    4. *-commutative 14.2%

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

13. Simplified 14.2%

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

14. Final simplification 14.2%

    \[\leadsto \sqrt{2 \cdot F} \cdot \left(-{B}^{-0.5}\right) \]
15. Add Preprocessing

Alternative 11: 27.8% accurate, 5.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}\;C \leq 4.5 \cdot 10^{+162}:\\ \;\;\;\;-{\left(2 \cdot \frac{F}{B\_m}\right)}^{0.5}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{\sqrt{C \cdot F}}{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 (<= C 4.5e+162)
   (- (pow (* 2.0 (/ F B_m)) 0.5))
   (* -2.0 (/ (sqrt (* C 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) {
	double tmp;
	if (C <= 4.5e+162) {
		tmp = -pow((2.0 * (F / B_m)), 0.5);
	} else {
		tmp = -2.0 * (sqrt((C * F)) / 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 (c <= 4.5d+162) then
        tmp = -((2.0d0 * (f / b_m)) ** 0.5d0)
    else
        tmp = (-2.0d0) * (sqrt((c * f)) / 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 (C <= 4.5e+162) {
		tmp = -Math.pow((2.0 * (F / B_m)), 0.5);
	} else {
		tmp = -2.0 * (Math.sqrt((C * F)) / 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 C <= 4.5e+162:
		tmp = -math.pow((2.0 * (F / B_m)), 0.5)
	else:
		tmp = -2.0 * (math.sqrt((C * F)) / 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 (C <= 4.5e+162)
		tmp = Float64(-(Float64(2.0 * Float64(F / B_m)) ^ 0.5));
	else
		tmp = Float64(-2.0 * Float64(sqrt(Float64(C * F)) / 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 (C <= 4.5e+162)
		tmp = -((2.0 * (F / B_m)) ^ 0.5);
	else
		tmp = -2.0 * (sqrt((C * F)) / 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[C, 4.5e+162], (-N[Power[N[(2.0 * N[(F / B$95$m), $MachinePrecision]), $MachinePrecision], 0.5], $MachinePrecision]), N[(-2.0 * N[(N[Sqrt[N[(C * F), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if C < 4.49999999999999972e162

   1. Initial program 18.8%

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

   3. Taylor expanded in B around inf 12.2%

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

      1. mul-1-neg 12.2%

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

      2. *-commutative 12.2%

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

   5. Simplified 12.2%

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

      1. *-commutative 12.2%

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

      2. pow1/2 12.3%

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

      3. pow1/2 12.3%

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

      4. pow-prod-down 12.4%

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

   7. Applied egg-rr 12.4%

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

   if 4.49999999999999972e162 < C

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

   3. Simplified 13.5%

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

      1. pow1/2 13.5%

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

      2. pow-to-exp 12.4%

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

   6. Applied egg-rr 12.4%

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

   7. Taylor expanded in A around -inf 12.4%

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

   8. Taylor expanded in B around inf 12.8%

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

      1. associate-*l/ 12.8%

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

      2. *-lft-identity 12.8%

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

      3. *-commutative 12.8%

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

   10. Simplified 12.8%

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

4. Final simplification 12.4%

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

Alternative 12: 27.1% accurate, 5.9× speedup

Math

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

C

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

Fortran

B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = -((2.0d0 * (f / b_m)) ** 0.5d0)
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.pow((2.0 * (F / B_m)), 0.5);
}

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.pow((2.0 * (F / B_m)), 0.5)

Julia

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

MATLAB

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

Derivation

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

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

   1. mul-1-neg 11.2%

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

   2. *-commutative 11.2%

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

5. Simplified 11.2%

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

   1. *-commutative 11.2%

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

   2. pow1/2 11.4%

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

   3. pow1/2 11.4%

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

   4. pow-prod-down 11.4%

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

7. Applied egg-rr 11.4%

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

8. Final simplification 11.4%

   \[\leadsto -{\left(2 \cdot \frac{F}{B}\right)}^{0.5} \]
9. Add Preprocessing

Alternative 13: 27.1% accurate, 6.0× 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 17.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 11.2%

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

   1. mul-1-neg 11.2%

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

   2. *-commutative 11.2%

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

5. Simplified 11.2%

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

   1. *-commutative 11.2%

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

   2. pow1/2 11.4%

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

   3. pow1/2 11.4%

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

   4. pow-prod-down 11.4%

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

7. Applied egg-rr 11.4%

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

   1. unpow1/2 11.2%

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

9. Simplified 11.2%

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

10. Final simplification 11.2%

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

Alternative 14: 27.1% accurate, 6.0× 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 17.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 11.2%

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

   1. mul-1-neg 11.2%

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

   2. *-commutative 11.2%

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

5. Simplified 11.2%

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

   1. *-commutative 11.2%

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

   2. pow1/2 11.4%

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

   3. pow1/2 11.4%

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

   4. pow-prod-down 11.4%

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

7. Applied egg-rr 11.4%

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

   1. unpow1/2 11.2%

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

9. Simplified 11.2%

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

    1. *-commutative 11.2%

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

    2. clear-num 11.0%

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

    3. un-div-inv 11.0%

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

11. Applied egg-rr 11.0%

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

    1. associate-/r/ 11.2%

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

13. Simplified 11.2%

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

14. Final simplification 11.2%

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

Alternative 15: 2.4% accurate, 6.0× 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 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 17.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 11.2%

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

   1. mul-1-neg 11.2%

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

   2. *-commutative 11.2%

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

5. Simplified 11.2%

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

   1. *-commutative 11.2%

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

   2. pow1/2 11.4%

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

   3. pow1/2 11.4%

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

   4. pow-prod-down 11.4%

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

7. Applied egg-rr 11.4%

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

   1. unpow1/2 11.2%

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

9. Simplified 11.2%

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

    1. sqrt-prod 11.2%

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

    2. div-inv 11.2%

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

    3. sqrt-unprod 14.2%

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

    4. *-commutative 14.2%

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

    5. add-sqr-sqrt 0.0%

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

    6. sqrt-unprod 1.1%

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

    7. *-commutative 1.1%

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

    8. sqrt-unprod 1.1%

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

    9. div-inv 1.1%

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

    10. *-commutative 1.1%

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

    11. sqrt-unprod 1.9%

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

    12. div-inv 1.9%

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

11. Applied egg-rr 1.9%

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

Alternative 16: 2.1% accurate, 6.1× speedup

Math

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

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 / -C));
}

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 / -c))
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 / -C));
}

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 / -C))

Julia

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

Derivation

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

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

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

   2. *-commutative 6.3%

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

   3. *-commutative 6.3%

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

   4. +-commutative 6.3%

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

   5. unpow2 6.3%

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

   6. unpow2 6.3%

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

   7. hypot-define 13.5%

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

5. Simplified 13.5%

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

   1. sqrt-prod 17.0%

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

7. Applied egg-rr 17.0%

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

   1. associate-*r/ 16.9%

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

   2. sqrt-unprod 13.4%

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

   3. sqrt-prod 13.5%

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

   4. expm1-log1p-u 13.2%

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

   5. add-sqr-sqrt 1.8%

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

   6. sqrt-unprod 2.4%

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

   7. sqr-neg 2.4%

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

9. Applied egg-rr 2.1%

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

    1. associate-*l* 2.4%

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

11. Simplified 2.4%

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

12. Taylor expanded in C around -inf 11.3%

    \[\leadsto \sqrt{\color{blue}{-1 \cdot \frac{F}{C}}} \]
13. Step-by-step derivation

    1. associate-*r/ 11.3%

       \[\leadsto \sqrt{\color{blue}{\frac{-1 \cdot F}{C}}} \]

    2. mul-1-neg 11.3%

       \[\leadsto \sqrt{\frac{\color{blue}{-F}}{C}} \]

14. Simplified 11.3%

    \[\leadsto \sqrt{\color{blue}{\frac{-F}{C}}} \]

15. Final simplification 11.3%

    \[\leadsto \sqrt{\frac{F}{-C}} \]
16. Add Preprocessing

Reproduce

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