ABCF->ab-angle a

Percentage Accurate: 19.1% → 64.0%

Time: 23.7s

Alternatives: 14

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: 19.1% 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: 64.0% accurate, 0.2× speedup

Math

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

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (let* ((t_0 (fma B_m B_m (* -4.0 (* A C))))
        (t_1 (fma B_m B_m (* A (* C -4.0))))
        (t_2 (- t_1))
        (t_3 (* F t_1))
        (t_4 (* (* 4.0 A) C))
        (t_5
         (/
          (sqrt
           (*
            (* 2.0 (* (- (pow B_m 2.0) t_4) F))
            (+ (sqrt (+ (pow B_m 2.0) (pow (- A C) 2.0))) (+ A C))))
          (- t_4 (pow B_m 2.0)))))
   (if (<= t_5 (- INFINITY))
     (*
      (sqrt
       (*
        F
        (/ (+ (+ A C) (hypot B_m (- A C))) (fma -4.0 (* A C) (pow B_m 2.0)))))
      (- (sqrt 2.0)))
     (if (<= t_5 -5e-217)
       (*
        (sqrt (* F (* 2.0 t_0)))
        (/ (sqrt (+ (+ A C) (hypot (- A C) B_m))) (- t_0)))
       (if (<= t_5 1e+105)
         (/ (sqrt (* t_3 (- (* 4.0 C) (/ (pow B_m 2.0) A)))) t_2)
         (if (<= t_5 INFINITY)
           (/ (* (sqrt (* 2.0 t_3)) (sqrt (* 2.0 C))) t_2)
           (*
            (* (sqrt (+ C (hypot C B_m))) (sqrt F))
            (/ (exp (* (log 2.0) 0.5)) (- B_m)))))))))

C

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

Julia

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

Derivation

1. Split input into 5 regimes

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

   1. Initial program 3.1%

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

   3. Taylor expanded in F around 0 27.5%

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

   5. Simplified 67.9%

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

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

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

   3. Simplified 97.7%

      \[\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. associate-*r* 97.7%

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

      2. associate-+r+ 97.7%

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

      3. hypot-undefine 97.7%

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

      4. unpow2 97.7%

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

      5. unpow2 97.7%

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

      6. +-commutative 97.7%

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

      7. sqrt-prod 97.7%

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

      8. *-commutative 97.7%

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

      9. associate-+l+ 97.7%

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

   6. Applied egg-rr 97.7%

      \[\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{A + \left(C + \mathsf{hypot}\left(A - C, B\right)\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
   7. Step-by-step derivation

      1. associate-/l* 97.8%

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

      2. associate-*l* 97.8%

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

      3. associate-+r+ 97.8%

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

      4. +-commutative 97.8%

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

   8. Applied egg-rr 97.8%

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

      1. associate-*r* 97.8%

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

      2. associate-*r* 97.8%

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

   10. Simplified 97.8%

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

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

   1. Initial program 10.1%

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

   3. Simplified 12.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. Taylor expanded in A around -inf 36.6%

      \[\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 9.9999999999999994e104 < (/.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 13.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 54.2%

      \[\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. associate-*r* 54.2%

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

      2. associate-+r+ 54.2%

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

      3. hypot-undefine 13.6%

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

      4. unpow2 13.6%

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

      5. unpow2 13.6%

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

      6. +-commutative 13.6%

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

      7. sqrt-prod 13.6%

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

      8. *-commutative 13.6%

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

      9. associate-+l+ 13.6%

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

   6. Applied egg-rr 89.0%

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

   7. Taylor expanded in A around -inf 29.6%

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

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

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

      2. *-commutative 1.6%

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

      3. *-commutative 1.6%

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

      4. +-commutative 1.6%

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

      5. unpow2 1.6%

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

      6. unpow2 1.6%

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

      7. hypot-define 20.2%

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

   5. Simplified 20.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 27.1%

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

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

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

      2. pow-to-exp 27.1%

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

   9. Applied egg-rr 27.1%

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

4. Final simplification 46.7%

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

Alternative 2: 58.4% accurate, 0.9× speedup

Math

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

C

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

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 2.00000000000000008e-156

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

   3. Simplified 28.3%

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

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

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

      \[\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 2.00000000000000008e-156 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e142

   1. Initial program 38.5%

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

   3. Taylor expanded in F around 0 45.6%

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

   5. Simplified 59.4%

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

   if 5.0000000000000001e142 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 4.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 6.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 6.8%

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

      2. *-commutative 6.8%

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

      3. *-commutative 6.8%

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

      4. +-commutative 6.8%

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

      5. unpow2 6.8%

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

      6. unpow2 6.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 26.9%

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

   5. Simplified 26.9%

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

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

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

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

      2. pow-to-exp 36.6%

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

   9. Applied egg-rr 36.6%

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

4. Final simplification 38.4%

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

Alternative 3: 53.4% accurate, 1.0× speedup

Math

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999999e-72

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

   3. Simplified 29.2%

      \[\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 24.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(4 \cdot C\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
   6. Step-by-step derivation

      1. *-commutative 24.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(C \cdot 4\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

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

   if 3.9999999999999999e-72 < (pow.f64 B #s(literal 2 binary64)) < 5.0000000000000001e291

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

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

      2. *-commutative 21.8%

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

      3. *-commutative 21.8%

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

      4. +-commutative 21.8%

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

      5. unpow2 21.8%

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

      6. unpow2 21.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 22.3%

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

   5. Simplified 22.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 22.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/ 22.3%

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

      3. pow1/2 22.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 22.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 22.5%

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

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

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

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

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

      4. associate-*l* 22.4%

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

   9. Simplified 22.4%

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

   if 5.0000000000000001e291 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 0.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 C around 0 1.7%

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

      1. mul-1-neg 1.7%

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

      2. *-commutative 1.7%

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

      3. *-commutative 1.7%

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

      4. +-commutative 1.7%

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

   5. Simplified 1.7%

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

      1. sqrt-prod 3.2%

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

      2. unpow2 3.2%

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

      3. unpow2 3.2%

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

      4. hypot-define 40.7%

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

   7. Applied egg-rr 40.7%

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

4. Final simplification 27.8%

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

Alternative 4: 57.4% accurate, 1.0× speedup

Math

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma(B_m, B_m, (A * (C * -4.0)));
	double tmp;
	if (pow(B_m, 2.0) <= 4e-72) {
		tmp = sqrt(((F * t_0) * ((4.0 * C) - (pow(B_m, 2.0) / A)))) / -t_0;
	} else {
		tmp = (sqrt((C + hypot(C, B_m))) * sqrt(F)) * (exp((log(2.0) * 0.5)) / -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) <= 4e-72)
		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(Float64(C + hypot(C, B_m))) * sqrt(F)) * Float64(exp(Float64(log(2.0) * 0.5)) / 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], 4e-72], 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[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] * N[(N[Exp[N[(N[Log[2.0], $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999999e-72

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

   3. Simplified 29.2%

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

      \[\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 3.9999999999999999e-72 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 17.3%

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

   3. Taylor expanded in A around 0 12.4%

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

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

      2. *-commutative 12.4%

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

      3. *-commutative 12.4%

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

      4. +-commutative 12.4%

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

      5. unpow2 12.4%

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

      6. unpow2 12.4%

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

      7. hypot-define 26.5%

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

   5. Simplified 26.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 33.3%

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

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

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

      2. pow-to-exp 33.3%

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

   9. Applied egg-rr 33.3%

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

4. Final simplification 28.6%

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

Alternative 5: 57.5% 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 4 \cdot 10^{-72}:\\ \;\;\;\;\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{C + \mathsf{hypot}\left(C, B\_m\right)} \cdot \sqrt{F}\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) 4e-72)
     (/ (sqrt (* (* F t_0) (- (* 4.0 C) (/ (pow B_m 2.0) A)))) (- t_0))
     (* (* (sqrt (+ C (hypot C B_m))) (sqrt F)) (/ (sqrt 2.0) (- B_m))))))

C

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

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = fma(B_m, B_m, Float64(A * Float64(C * -4.0)))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 4e-72)
		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(Float64(C + hypot(C, B_m))) * sqrt(F)) * 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], 4e-72], 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[N[(C + N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $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)) < 3.9999999999999999e-72

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

   3. Simplified 29.2%

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

      \[\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 3.9999999999999999e-72 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 17.3%

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

   3. Taylor expanded in A around 0 12.4%

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

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

      2. *-commutative 12.4%

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

      3. *-commutative 12.4%

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

      4. +-commutative 12.4%

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

      5. unpow2 12.4%

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

      6. unpow2 12.4%

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

      7. hypot-define 26.5%

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

   5. Simplified 26.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 33.3%

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

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

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

Alternative 6: 57.8% accurate, 1.2× speedup

Math

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

C

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

Julia

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

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

   3. Simplified 29.2%

      \[\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 24.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(4 \cdot C\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
   6. Step-by-step derivation

      1. *-commutative 24.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(C \cdot 4\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

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

   if 3.9999999999999999e-72 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 17.3%

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

   3. Taylor expanded in A around 0 12.4%

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

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

      2. *-commutative 12.4%

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

      3. *-commutative 12.4%

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

      4. +-commutative 12.4%

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

      5. unpow2 12.4%

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

      6. unpow2 12.4%

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

      7. hypot-define 26.5%

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

   5. Simplified 26.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 33.3%

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

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

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

Alternative 7: 53.1% 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 4 \cdot 10^{-72}:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot t\_0\right) \cdot \left(4 \cdot C\right)}}{-t\_0}\\ \mathbf{elif}\;{B\_m}^{2} \leq 2 \cdot 10^{+168}:\\ \;\;\;\;\frac{\sqrt{\left(C + \mathsf{hypot}\left(C, B\_m\right)\right) \cdot \left(2 \cdot F\right)}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 3.9999999999999999e-72

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

   3. Simplified 29.2%

      \[\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 24.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(4 \cdot C\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]
   6. Step-by-step derivation

      1. *-commutative 24.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(C \cdot 4\right)}}}{-\mathsf{fma}\left(B, B, A \cdot \left(C \cdot -4\right)\right)} \]

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

   if 3.9999999999999999e-72 < (pow.f64 B #s(literal 2 binary64)) < 1.9999999999999999e168

   1. Initial program 41.6%

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

   3. Taylor expanded in A around 0 22.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 22.7%

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

      2. *-commutative 22.7%

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

      3. *-commutative 22.7%

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

      4. +-commutative 22.7%

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

      5. unpow2 22.7%

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

      6. unpow2 22.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 23.1%

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

   5. Simplified 23.1%

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

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

      2. associate-*r/ 23.0%

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

      3. pow1/2 23.0%

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

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

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

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

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

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

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

      4. associate-*l* 23.1%

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

   9. Simplified 23.1%

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

   if 1.9999999999999999e168 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 4.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 23.2%

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

      1. mul-1-neg 23.2%

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

      2. *-commutative 23.2%

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

   5. Simplified 23.2%

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

      1. *-commutative 23.2%

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

      2. pow1/2 23.2%

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

      3. pow1/2 23.2%

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

      4. pow-prod-down 23.4%

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

   7. Applied egg-rr 23.4%

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

      1. unpow1/2 23.4%

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

   9. Simplified 23.4%

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

   10. Taylor expanded in F around 0 23.4%

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

       1. associate-*r/ 23.4%

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

       2. *-commutative 23.4%

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

       3. associate-/l* 23.3%

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

   12. Simplified 23.3%

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

       1. pow1/2 23.3%

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

       2. *-commutative 23.3%

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

       3. unpow-prod-down 32.8%

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

       4. pow1/2 32.8%

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

       5. pow1/2 32.8%

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

   14. Applied egg-rr 32.8%

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

4. Final simplification 27.0%

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

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

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (F <= 7e+66) {
		tmp = sqrt(((C + hypot(C, B_m)) * (2.0 * F))) / -B_m;
	} else {
		tmp = sqrt(F) * -sqrt((2.0 / B_m));
	}
	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 <= 7e+66) {
		tmp = Math.sqrt(((C + Math.hypot(C, B_m)) * (2.0 * F))) / -B_m;
	} else {
		tmp = Math.sqrt(F) * -Math.sqrt((2.0 / B_m));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if F < 6.9999999999999994e66

   1. Initial program 16.3%

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

   3. Taylor expanded in A around 0 9.0%

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

      1. mul-1-neg 9.0%

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

      2. *-commutative 9.0%

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

      3. *-commutative 9.0%

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

      4. +-commutative 9.0%

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

      5. unpow2 9.0%

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

      6. unpow2 9.0%

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

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

   5. Simplified 19.0%

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

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

      2. associate-*r/ 19.0%

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

      3. pow1/2 19.1%

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

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

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

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

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

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

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

      4. associate-*l* 19.1%

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

   9. Simplified 19.1%

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

   if 6.9999999999999994e66 < F

   1. Initial program 17.6%

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

   3. Taylor expanded in B around inf 24.0%

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

      1. mul-1-neg 24.0%

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

      2. *-commutative 24.0%

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

   5. Simplified 24.0%

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

      1. *-commutative 24.0%

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

      2. pow1/2 24.7%

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

      3. pow1/2 24.7%

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

      4. pow-prod-down 24.9%

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

   7. Applied egg-rr 24.9%

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

      1. unpow1/2 24.2%

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

   9. Simplified 24.2%

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

   10. Taylor expanded in F around 0 24.2%

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

       1. associate-*r/ 24.2%

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

       2. *-commutative 24.2%

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

       3. associate-/l* 24.1%

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

   12. Simplified 24.1%

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

       1. pow1/2 24.8%

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

       2. *-commutative 24.8%

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

       3. unpow-prod-down 24.2%

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

       4. pow1/2 24.2%

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

       5. pow1/2 24.2%

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

   14. Applied egg-rr 24.2%

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

4. Final simplification 20.6%

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

Alternative 9: 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{F} \cdot \left(-\sqrt{\frac{2}{B\_m}}\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 F) (- (sqrt (/ 2.0 B_m)))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 16.7%

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

3. Taylor expanded in B around inf 14.8%

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

   1. mul-1-neg 14.8%

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

   2. *-commutative 14.8%

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

5. Simplified 14.8%

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

   1. *-commutative 14.8%

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

   2. pow1/2 15.0%

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

   3. pow1/2 15.0%

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

   4. pow-prod-down 15.1%

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

7. Applied egg-rr 15.1%

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

   1. unpow1/2 14.9%

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

9. Simplified 14.9%

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

10. Taylor expanded in F around 0 14.9%

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

    1. associate-*r/ 14.9%

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

    2. *-commutative 14.9%

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

    3. associate-/l* 14.9%

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

12. Simplified 14.9%

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

    1. pow1/2 15.1%

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

    2. *-commutative 15.1%

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

    3. unpow-prod-down 18.1%

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

    4. pow1/2 18.1%

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

    5. pow1/2 18.1%

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

14. Applied egg-rr 18.1%

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

15. Final simplification 18.1%

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

Alternative 10: 27.4% 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{\left|\frac{2 \cdot F}{B\_m}\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 (fabs (/ (* 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(fabs(((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(abs(((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(Math.abs(((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(math.fabs(((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(abs(Float64(Float64(2.0 * 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(abs(((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[Abs[N[(N[(2.0 * F), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 16.7%

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

3. Taylor expanded in B around inf 14.8%

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

   1. mul-1-neg 14.8%

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

   2. *-commutative 14.8%

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

5. Simplified 14.8%

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

   1. *-commutative 14.8%

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

   2. pow1/2 15.0%

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

   3. pow1/2 15.0%

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

   4. pow-prod-down 15.1%

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

7. Applied egg-rr 15.1%

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

   1. unpow1/2 14.9%

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

9. Simplified 14.9%

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

10. Taylor expanded in F around 0 14.9%

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

    1. associate-*r/ 14.9%

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

    2. *-commutative 14.9%

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

    3. associate-/l* 14.9%

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

12. Simplified 14.9%

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

    1. add-sqr-sqrt 14.9%

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

    2. pow1/2 14.9%

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

    3. pow1/2 15.1%

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

    4. pow-prod-down 19.5%

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

    5. pow2 19.5%

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

14. Applied egg-rr 19.5%

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

    1. unpow1/2 19.5%

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

    2. unpow2 19.5%

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

    3. rem-sqrt-square 27.4%

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

    4. associate-*r/ 27.5%

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

16. Simplified 27.5%

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

17. Final simplification 27.5%

    \[\leadsto -\sqrt{\left|\frac{2 \cdot F}{B}\right|} \]
18. Add Preprocessing

Alternative 11: 27.4% 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{\left|F \cdot \frac{2}{B\_m}\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 (fabs (* 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(fabs((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(abs((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(Math.abs((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(math.fabs((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(abs(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(abs((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[Abs[N[(F * N[(2.0 / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 16.7%

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

3. Taylor expanded in B around inf 14.8%

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

   1. mul-1-neg 14.8%

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

   2. *-commutative 14.8%

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

5. Simplified 14.8%

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

   1. *-commutative 14.8%

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

   2. pow1/2 15.0%

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

   3. pow1/2 15.0%

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

   4. pow-prod-down 15.1%

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

7. Applied egg-rr 15.1%

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

   1. unpow1/2 14.9%

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

9. Simplified 14.9%

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

    1. add-sqr-sqrt 14.9%

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

    2. pow1/2 14.9%

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

    3. pow1/2 15.1%

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

    4. pow-prod-down 19.5%

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

    5. pow2 19.5%

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

    6. *-commutative 19.5%

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

11. Applied egg-rr 19.5%

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

    1. unpow1/2 19.5%

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

    2. unpow2 19.5%

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

    3. rem-sqrt-square 27.5%

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

    4. associate-*r/ 27.5%

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

    5. *-commutative 27.5%

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

    6. associate-/l* 27.4%

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

13. Simplified 27.4%

    \[\leadsto -\sqrt{\color{blue}{\left|F \cdot \frac{2}{B}\right|}} \]
14. Add Preprocessing

Alternative 12: 27.2% 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 16.7%

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

3. Taylor expanded in B around inf 14.8%

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

   1. mul-1-neg 14.8%

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

   2. *-commutative 14.8%

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

5. Simplified 14.8%

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

   1. *-commutative 14.8%

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

   2. pow1/2 15.0%

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

   3. pow1/2 15.0%

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

   4. pow-prod-down 15.1%

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

7. Applied egg-rr 15.1%

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

8. Final simplification 15.1%

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

Alternative 13: 27.2% 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 16.7%

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

3. Taylor expanded in B around inf 14.8%

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

   1. mul-1-neg 14.8%

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

   2. *-commutative 14.8%

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

5. Simplified 14.8%

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

   1. *-commutative 14.8%

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

   2. pow1/2 15.0%

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

   3. pow1/2 15.0%

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

   4. pow-prod-down 15.1%

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

7. Applied egg-rr 15.1%

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

   1. unpow1/2 14.9%

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

9. Simplified 14.9%

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

10. Final simplification 14.9%

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

Alternative 14: 27.2% 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 16.7%

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

3. Taylor expanded in B around inf 14.8%

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

   1. mul-1-neg 14.8%

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

   2. *-commutative 14.8%

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

5. Simplified 14.8%

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

   1. *-commutative 14.8%

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

   2. pow1/2 15.0%

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

   3. pow1/2 15.0%

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

   4. pow-prod-down 15.1%

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

7. Applied egg-rr 15.1%

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

   1. unpow1/2 14.9%

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

9. Simplified 14.9%

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

10. Taylor expanded in F around 0 14.9%

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

    1. associate-*r/ 14.9%

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

    2. *-commutative 14.9%

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

    3. associate-/l* 14.9%

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

12. Simplified 14.9%

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

Reproduce

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