ABCF->ab-angle a

Percentage Accurate: 18.6% → 58.0%

Time: 17.6s

Alternatives: 21

Speedup: 16.9×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 18.6% 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: 58.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 48.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. associate-*l* N/A

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

      7. sqrt-prod N/A

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

      8. pow1/2 N/A

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

      9. lower-*.f64 N/A

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

   4. Applied rewrites 75.7%

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

   if -1e-216 < (/.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 22.1%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 3.0

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

   5. Applied rewrites 3.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 3.0%

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

   8. Taylor expanded in A around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 36.9

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

   10. Applied rewrites 36.9%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 15.1

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

   5. Applied rewrites 15.1%

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

   7. Applied rewrites 24.2%

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

   9. Applied rewrites 24.2%

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

   11. Applied rewrites 27.1%

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

4. Final simplification 45.6%

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

Alternative 2: 57.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\ t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\ t_2 := \mathsf{hypot}\left(A - C, B\_m\right)\\ t_3 := C \cdot \left(A \cdot 4\right)\\ t_4 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_3\right)\right) \cdot 2\right)}}{t\_3 - {B\_m}^{2}}\\ \mathbf{if}\;t\_4 \leq -\infty:\\ \;\;\;\;\sqrt{\frac{\left(\left(t\_2 + C\right) + A\right) \cdot F}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;t\_4 \leq -1 \cdot 10^{-216}:\\ \;\;\;\;\frac{-1}{t\_1} \cdot \sqrt{\left(\left(F \cdot 2\right) \cdot t\_1\right) \cdot \left(\left(t\_2 + A\right) + C\right)}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{-B\_m} \cdot \sqrt{F \cdot 2}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 2.8%

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

   3. Taylor expanded in F around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 N/A

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

   5. Applied rewrites 54.0%

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

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

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

   4. Applied rewrites 97.3%

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

   if -1e-216 < (/.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 22.1%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 3.0

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

   5. Applied rewrites 3.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 3.0%

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

   8. Taylor expanded in A around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 36.9

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

   10. Applied rewrites 36.9%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 15.1

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

   5. Applied rewrites 15.1%

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

   7. Applied rewrites 24.2%

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

   9. Applied rewrites 24.2%

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

   11. Applied rewrites 27.1%

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

4. Final simplification 45.4%

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

Alternative 3: 57.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\ t_1 := \mathsf{hypot}\left(A - C, B\_m\right)\\ t_2 := C \cdot \left(A \cdot 4\right)\\ t_3 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_2\right)\right) \cdot 2\right)}}{t\_2 - {B\_m}^{2}}\\ t_4 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\ \mathbf{if}\;t\_3 \leq -\infty:\\ \;\;\;\;\sqrt{\frac{\left(\left(t\_1 + C\right) + A\right) \cdot F}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;t\_3 \leq -1 \cdot 10^{-216}:\\ \;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_0\right) \cdot \left(\left(t\_1 + A\right) + C\right)}}{-t\_0}\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;\frac{\sqrt{\left(\left(t\_4 \cdot F\right) \cdot 2\right) \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{-t\_4}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\mathsf{hypot}\left(C, B\_m\right) + C}}{-B\_m} \cdot \sqrt{F \cdot 2}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 2.8%

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

   3. Taylor expanded in F around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 N/A

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

   5. Applied rewrites 54.0%

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

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

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

   4. Applied rewrites 97.3%

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

   if -1e-216 < (/.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 22.1%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 3.0

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

   5. Applied rewrites 3.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 3.0%

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

   8. Taylor expanded in A around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 36.9

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

   10. Applied rewrites 36.9%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 15.1

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

   5. Applied rewrites 15.1%

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

   7. Applied rewrites 24.2%

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

   9. Applied rewrites 24.2%

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

   11. Applied rewrites 27.1%

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

4. Final simplification 45.4%

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

Alternative 4: 57.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{hypot}\left(C, B\_m\right) + C\\ t_1 := \mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)\\ t_2 := \left(t\_1 \cdot F\right) \cdot 2\\ t_3 := -t\_1\\ t_4 := C \cdot \left(A \cdot 4\right)\\ t_5 := \frac{\sqrt{\left(\left(C + A\right) + \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right) \cdot \left(\left(F \cdot \left({B\_m}^{2} - t\_4\right)\right) \cdot 2\right)}}{t\_4 - {B\_m}^{2}}\\ \mathbf{if}\;t\_5 \leq -\infty:\\ \;\;\;\;\sqrt{\frac{\left(\left(\mathsf{hypot}\left(A - C, B\_m\right) + C\right) + A\right) \cdot F}{\mathsf{fma}\left(-4 \cdot A, C, B\_m \cdot B\_m\right)}} \cdot \left(-\sqrt{2}\right)\\ \mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-216}:\\ \;\;\;\;\frac{\sqrt{t\_0 \cdot t\_2}}{t\_3}\\ \mathbf{elif}\;t\_5 \leq \infty:\\ \;\;\;\;\frac{\sqrt{t\_2 \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{t\_3}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{t\_0}}{-B\_m} \cdot \sqrt{F \cdot 2}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 2.8%

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

   3. Taylor expanded in F around 0

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 N/A

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

   5. Applied rewrites 54.0%

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

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

   1. Initial program 97.3%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 33.4

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

   5. Applied rewrites 33.4%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 33.4%

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

   8. Taylor expanded in A around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. unpow2 N/A

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

      5. unpow2 N/A

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

      6. lower-hypot.f64 83.0

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

   10. Applied rewrites 83.0%

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

   if -1e-216 < (/.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 22.1%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 3.0

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

   5. Applied rewrites 3.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 3.0%

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

   8. Taylor expanded in A around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 36.9

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

   10. Applied rewrites 36.9%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 15.1

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

   5. Applied rewrites 15.1%

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

   7. Applied rewrites 24.2%

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

   9. Applied rewrites 24.2%

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

   11. Applied rewrites 27.1%

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

4. Final simplification 43.1%

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

Alternative 5: 57.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 48.9%

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

   4. Applied rewrites 57.6%

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

   6. Applied rewrites 74.4%

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

   if -1e-216 < (/.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 22.1%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 3.0

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

   5. Applied rewrites 3.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 3.0%

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

   8. Taylor expanded in A around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 36.9

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

   10. Applied rewrites 36.9%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 15.1

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

   5. Applied rewrites 15.1%

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

   7. Applied rewrites 24.2%

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

   9. Applied rewrites 24.2%

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

   11. Applied rewrites 27.1%

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

4. Final simplification 45.2%

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

Alternative 6: 57.5% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 48.9%

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

   4. Applied rewrites 69.3%

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

   if -1e-216 < (/.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 22.1%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 3.0

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

   5. Applied rewrites 3.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 3.0%

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

   8. Taylor expanded in A around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 36.9

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

   10. Applied rewrites 36.9%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 15.1

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

   5. Applied rewrites 15.1%

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

   7. Applied rewrites 24.2%

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

   9. Applied rewrites 24.2%

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

   11. Applied rewrites 27.1%

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

4. Final simplification 43.5%

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

Alternative 7: 57.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 48.9%

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

   4. Applied rewrites 69.2%

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

   if -1e-216 < (/.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 22.1%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 3.0

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

   5. Applied rewrites 3.0%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 3.0%

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

   8. Taylor expanded in A around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 36.9

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

   10. Applied rewrites 36.9%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 15.1

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

   5. Applied rewrites 15.1%

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

   7. Applied rewrites 24.2%

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

   9. Applied rewrites 24.2%

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

   11. Applied rewrites 27.1%

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

4. Final simplification 43.5%

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

Alternative 8: 57.8% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000003e-42

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

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 4.3

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

   5. Applied rewrites 4.3%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 4.3%

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

   8. Taylor expanded in C around inf

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

      1. lower-*.f64 28.9

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

   10. Applied rewrites 28.9%

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

   if 5.00000000000000003e-42 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 19.2%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 23.2

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

   5. Applied rewrites 23.2%

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

   7. Applied rewrites 32.9%

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

   9. Applied rewrites 33.0%

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

   11. Applied rewrites 35.2%

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

4. Final simplification 32.3%

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

Alternative 9: 50.7% accurate, 2.1× 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(C \cdot A, -4, B\_m \cdot B\_m\right)\\ \mathbf{if}\;{B\_m}^{2} \leq 5 \cdot 10^{+80}:\\ \;\;\;\;\frac{\sqrt{\left(\left(t\_0 \cdot F\right) \cdot 2\right) \cdot \mathsf{fma}\left(-0.5, \frac{B\_m \cdot B\_m}{A}, C \cdot 2\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\left(-{B\_m}^{-0.5}\right) \cdot \sqrt{F \cdot 2}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999961e80

   1. Initial program 28.4%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 7.5

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

   5. Applied rewrites 7.5%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 7.5%

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

   8. Taylor expanded in A around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 29.6

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

   10. Applied rewrites 29.6%

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

   if 4.99999999999999961e80 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 14.0%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 29.4

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

   5. Applied rewrites 29.4%

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

   7. Applied rewrites 29.5%

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

   9. Applied rewrites 33.2%

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

4. Final simplification 31.2%

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

Alternative 10: 50.7% accurate, 2.4× speedup

Math

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma((C * A), -4.0, (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 5e+80) {
		tmp = sqrt((((t_0 * F) * 2.0) * fma(-0.5, ((B_m * B_m) / A), (C * 2.0)))) / -t_0;
	} else {
		tmp = sqrt((F * 2.0)) / -sqrt(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(Float64(C * A), -4.0, Float64(B_m * B_m))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e+80)
		tmp = Float64(sqrt(Float64(Float64(Float64(t_0 * F) * 2.0) * fma(-0.5, Float64(Float64(B_m * B_m) / A), Float64(C * 2.0)))) / Float64(-t_0));
	else
		tmp = Float64(sqrt(Float64(F * 2.0)) / Float64(-sqrt(B_m)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 4.99999999999999961e80

   1. Initial program 28.4%

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

   3. Taylor expanded in B around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 7.5

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

   5. Applied rewrites 7.5%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 7.5%

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

   8. Taylor expanded in A around -inf

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

      1. lower-fma.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 29.6

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

   10. Applied rewrites 29.6%

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

   if 4.99999999999999961e80 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 14.0%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 29.4

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

   5. Applied rewrites 29.4%

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

   7. Applied rewrites 29.5%

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

   9. Applied rewrites 33.2%

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

4. Final simplification 31.2%

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

Alternative 11: 51.2% accurate, 2.7× speedup

Math

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

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = fma((C * A), -4.0, (B_m * B_m));
	double tmp;
	if (pow(B_m, 2.0) <= 5e-42) {
		tmp = sqrt(((C * 2.0) * ((t_0 * F) * 2.0))) / -t_0;
	} else {
		tmp = -sqrt(F) / sqrt((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(Float64(C * A), -4.0, Float64(B_m * B_m))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-42)
		tmp = Float64(sqrt(Float64(Float64(C * 2.0) * Float64(Float64(t_0 * F) * 2.0))) / Float64(-t_0));
	else
		tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * B_m)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000003e-42

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

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 4.3

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

   5. Applied rewrites 4.3%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 4.3%

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

   8. Taylor expanded in C around inf

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

      1. lower-*.f64 28.9

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

   10. Applied rewrites 28.9%

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

   if 5.00000000000000003e-42 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 19.2%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 27.3

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

   5. Applied rewrites 27.3%

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

   7. Applied rewrites 27.5%

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

   9. Applied rewrites 27.5%

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

   11. Applied rewrites 30.6%

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

4. Final simplification 29.8%

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

Alternative 12: 43.4% accurate, 2.9× speedup

Math

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

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (pow(B_m, 2.0) <= 5e-42) {
		tmp = sqrt(((((C * C) * F) * A) * -16.0)) / -fma((C * A), -4.0, (B_m * B_m));
	} else {
		tmp = -sqrt(F) / sqrt((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)
	tmp = 0.0
	if ((B_m ^ 2.0) <= 5e-42)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(C * C) * F) * A) * -16.0)) / Float64(-fma(Float64(C * A), -4.0, Float64(B_m * B_m))));
	else
		tmp = Float64(Float64(-sqrt(F)) / sqrt(Float64(0.5 * B_m)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 5.00000000000000003e-42

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

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 4.3

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

   5. Applied rewrites 4.3%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-neg.f64 N/A

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

      4. remove-double-neg N/A

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

      5. lift--.f64 N/A

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

      6. lift-pow.f64 N/A

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

      7. pow2 N/A

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

      8. lift-*.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. associate-*l* N/A

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

      12. *-commutative N/A

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

      13. lift-*.f64 N/A

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

   7. Applied rewrites 4.3%

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

   8. Taylor expanded in C around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 21.1

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

   10. Applied rewrites 21.1%

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

   if 5.00000000000000003e-42 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 19.2%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 27.3

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

   5. Applied rewrites 27.3%

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

   7. Applied rewrites 27.5%

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

   9. Applied rewrites 27.5%

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

   11. Applied rewrites 30.6%

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

4. Final simplification 26.2%

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

Alternative 13: 37.0% accurate, 8.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}\;C \leq 2.2 \cdot 10^{+197}:\\ \;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{C \cdot 2} \cdot \frac{\sqrt{F \cdot 2}}{-B\_m}\\ \end{array} \end{array} \]

FPCore

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

Fortran

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

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (C <= 2.2e+197) {
		tmp = -Math.sqrt(F) / Math.sqrt((0.5 * B_m));
	} else {
		tmp = Math.sqrt((C * 2.0)) * (Math.sqrt((F * 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 C <= 2.2e+197:
		tmp = -math.sqrt(F) / math.sqrt((0.5 * B_m))
	else:
		tmp = math.sqrt((C * 2.0)) * (math.sqrt((F * 2.0)) / -B_m)
	return tmp

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if C < 2.19999999999999989e197

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

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 16.9

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

   5. Applied rewrites 16.9%

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

   7. Applied rewrites 17.0%

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

   9. Applied rewrites 17.0%

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

   11. Applied rewrites 19.3%

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

   if 2.19999999999999989e197 < C

   1. Initial program 2.2%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 15.9

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

   5. Applied rewrites 15.9%

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

   7. Applied rewrites 20.7%

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

   9. Applied rewrites 20.9%

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

   10. Taylor expanded in C around inf

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

   12. Applied rewrites 20.9%

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

4. Final simplification 19.4%

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

Alternative 14: 35.8% accurate, 10.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}\;C \leq 3.2 \cdot 10^{+198}:\\ \;\;\;\;\frac{-\sqrt{F}}{\sqrt{0.5 \cdot B\_m}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{-B\_m} \cdot \sqrt{F \cdot C}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if C < 3.1999999999999998e198

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

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 16.9

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

   5. Applied rewrites 16.9%

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

   7. Applied rewrites 17.0%

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

   9. Applied rewrites 17.0%

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

   11. Applied rewrites 19.3%

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

   if 3.1999999999999998e198 < C

   1. Initial program 2.2%

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

   3. Taylor expanded in A around 0

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 15.9

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

   5. Applied rewrites 15.9%

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

   6. Taylor expanded in C around inf

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

   8. Applied rewrites 16.0%

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

4. Final simplification 19.0%

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

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if C < 3.1999999999999998e198

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

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

      5. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\sqrt{2}\right)} \cdot \sqrt{\frac{F}{B}} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\color{blue}{\sqrt{2}}\right) \cdot \sqrt{\frac{F}{B}} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\sqrt{2}\right) \cdot \color{blue}{\sqrt{\frac{F}{B}}} \]

      8. lower-/.f64 16.9

         \[\leadsto \left(-\sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{F}{B}}} \]

   5. Applied rewrites 16.9%

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{\frac{F}{B}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 17.0%

      \[\leadsto \color{blue}{-\sqrt{\frac{F}{B} \cdot 2}} \]
   8. Step-by-step derivation

   9. Applied rewrites 19.3%

      \[\leadsto -\sqrt{F} \cdot \sqrt{\frac{2}{B}} \]

   if 3.1999999999999998e198 < C

   1. Initial program 2.2%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   2. Add Preprocessing

   3. Taylor expanded in A around 0

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \frac{\sqrt{2}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \frac{\sqrt{2}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\sqrt{2}}{B}\right)\right)} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      4. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\frac{\sqrt{2}}{B}\right)} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      5. lower-/.f64 N/A

         \[\leadsto \left(-\color{blue}{\frac{\sqrt{2}}{B}}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\frac{\color{blue}{\sqrt{2}}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \color{blue}{\sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      8. *-commutative N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(C + \sqrt{{B}^{2} + {C}^{2}}\right) \cdot F}} \]

      9. lower-*.f64 N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(C + \sqrt{{B}^{2} + {C}^{2}}\right) \cdot F}} \]

      10. +-commutative N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(\sqrt{{B}^{2} + {C}^{2}} + C\right)} \cdot F} \]

      11. lower-+.f64 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(\sqrt{{B}^{2} + {C}^{2}} + C\right)} \cdot F} \]

      12. +-commutative N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{\color{blue}{{C}^{2} + {B}^{2}}} + C\right) \cdot F} \]

      13. unpow2 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{\color{blue}{C \cdot C} + {B}^{2}} + C\right) \cdot F} \]

      14. unpow2 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{C \cdot C + \color{blue}{B \cdot B}} + C\right) \cdot F} \]

      15. lower-hypot.f64 15.9

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\color{blue}{\mathsf{hypot}\left(C, B\right)} + C\right) \cdot F} \]

   5. Applied rewrites 15.9%

      \[\leadsto \color{blue}{\left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\mathsf{hypot}\left(C, B\right) + C\right) \cdot F}} \]

   6. Taylor expanded in C around inf

      \[\leadsto -1 \cdot \color{blue}{\left(\frac{{\left(\sqrt{2}\right)}^{2}}{B} \cdot \sqrt{C \cdot F}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 16.0%

      \[\leadsto -\frac{2}{B} \cdot \sqrt{C \cdot F} \]
3. Recombined 2 regimes into one program.

4. Final simplification 19.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;C \leq 3.2 \cdot 10^{+198}:\\ \;\;\;\;\left(-\sqrt{F}\right) \cdot \sqrt{\frac{2}{B}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{-B} \cdot \sqrt{F \cdot C}\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 34.4% accurate, 11.4× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} \mathbf{if}\;F \leq 1.7 \cdot 10^{+31}:\\ \;\;\;\;\frac{\sqrt{\left(C + B\_m\right) \cdot \left(F \cdot 2\right)}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{F}{B\_m} \cdot 2}\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (if (<= F 1.7e+31)
   (/ (sqrt (* (+ C B_m) (* F 2.0))) (- B_m))
   (- (sqrt (* (/ F B_m) 2.0)))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (F <= 1.7e+31) {
		tmp = sqrt(((C + B_m) * (F * 2.0))) / -B_m;
	} else {
		tmp = -sqrt(((F / B_m) * 2.0));
	}
	return tmp;
}

Fortran

B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (f <= 1.7d+31) then
        tmp = sqrt(((c + b_m) * (f * 2.0d0))) / -b_m
    else
        tmp = -sqrt(((f / b_m) * 2.0d0))
    end if
    code = tmp
end function

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (F <= 1.7e+31) {
		tmp = Math.sqrt(((C + B_m) * (F * 2.0))) / -B_m;
	} else {
		tmp = -Math.sqrt(((F / B_m) * 2.0));
	}
	return tmp;
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	tmp = 0
	if F <= 1.7e+31:
		tmp = math.sqrt(((C + B_m) * (F * 2.0))) / -B_m
	else:
		tmp = -math.sqrt(((F / B_m) * 2.0))
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if (F <= 1.7e+31)
		tmp = Float64(sqrt(Float64(Float64(C + B_m) * Float64(F * 2.0))) / Float64(-B_m));
	else
		tmp = Float64(-sqrt(Float64(Float64(F / B_m) * 2.0)));
	end
	return tmp
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	tmp = 0.0;
	if (F <= 1.7e+31)
		tmp = sqrt(((C + B_m) * (F * 2.0))) / -B_m;
	else
		tmp = -sqrt(((F / B_m) * 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 1.7e+31], N[(N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * N[(F * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if F < 1.6999999999999999e31

   1. Initial program 27.2%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   2. Add Preprocessing

   3. Taylor expanded in A around 0

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \frac{\sqrt{2}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \frac{\sqrt{2}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\sqrt{2}}{B}\right)\right)} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      4. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\frac{\sqrt{2}}{B}\right)} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      5. lower-/.f64 N/A

         \[\leadsto \left(-\color{blue}{\frac{\sqrt{2}}{B}}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\frac{\color{blue}{\sqrt{2}}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \color{blue}{\sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      8. *-commutative N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(C + \sqrt{{B}^{2} + {C}^{2}}\right) \cdot F}} \]

      9. lower-*.f64 N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(C + \sqrt{{B}^{2} + {C}^{2}}\right) \cdot F}} \]

      10. +-commutative N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(\sqrt{{B}^{2} + {C}^{2}} + C\right)} \cdot F} \]

      11. lower-+.f64 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(\sqrt{{B}^{2} + {C}^{2}} + C\right)} \cdot F} \]

      12. +-commutative N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{\color{blue}{{C}^{2} + {B}^{2}}} + C\right) \cdot F} \]

      13. unpow2 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{\color{blue}{C \cdot C} + {B}^{2}} + C\right) \cdot F} \]

      14. unpow2 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{C \cdot C + \color{blue}{B \cdot B}} + C\right) \cdot F} \]

      15. lower-hypot.f64 20.3

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\color{blue}{\mathsf{hypot}\left(C, B\right)} + C\right) \cdot F} \]

   5. Applied rewrites 20.3%

      \[\leadsto \color{blue}{\left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\mathsf{hypot}\left(C, B\right) + C\right) \cdot F}} \]
   6. Step-by-step derivation

   7. Applied rewrites 18.9%

      \[\leadsto \sqrt{\mathsf{hypot}\left(C, B\right) + C} \cdot \color{blue}{\left(\sqrt{F} \cdot \frac{\sqrt{2}}{-B}\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 20.4%

      \[\leadsto \frac{\sqrt{\left(\mathsf{hypot}\left(C, B\right) + C\right) \cdot \left(F \cdot 2\right)}}{\color{blue}{-B}} \]

   10. Taylor expanded in C around 0

       \[\leadsto \frac{\sqrt{\left(B + C\right) \cdot \left(F \cdot 2\right)}}{-B} \]
   11. Step-by-step derivation

   12. Applied rewrites 16.0%

       \[\leadsto \frac{\sqrt{\left(C + B\right) \cdot \left(F \cdot 2\right)}}{-B} \]

   if 1.6999999999999999e31 < F

   1. Initial program 14.1%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   2. Add Preprocessing

   3. Taylor expanded in B around inf

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

      5. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\sqrt{2}\right)} \cdot \sqrt{\frac{F}{B}} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\color{blue}{\sqrt{2}}\right) \cdot \sqrt{\frac{F}{B}} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\sqrt{2}\right) \cdot \color{blue}{\sqrt{\frac{F}{B}}} \]

      8. lower-/.f64 19.6

         \[\leadsto \left(-\sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{F}{B}}} \]

   5. Applied rewrites 19.6%

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{\frac{F}{B}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 19.8%

      \[\leadsto \color{blue}{-\sqrt{\frac{F}{B} \cdot 2}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 17: 34.3% accurate, 12.3× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} \mathbf{if}\;F \leq 10^{-17}:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot B\_m\right) \cdot 2}}{-B\_m}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{F}{B\_m} \cdot 2}\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (if (<= F 1e-17)
   (/ (sqrt (* (* F B_m) 2.0)) (- B_m))
   (- (sqrt (* (/ F B_m) 2.0)))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (F <= 1e-17) {
		tmp = sqrt(((F * B_m) * 2.0)) / -B_m;
	} else {
		tmp = -sqrt(((F / B_m) * 2.0));
	}
	return tmp;
}

Fortran

B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (f <= 1d-17) then
        tmp = sqrt(((f * b_m) * 2.0d0)) / -b_m
    else
        tmp = -sqrt(((f / b_m) * 2.0d0))
    end if
    code = tmp
end function

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (F <= 1e-17) {
		tmp = Math.sqrt(((F * B_m) * 2.0)) / -B_m;
	} else {
		tmp = -Math.sqrt(((F / B_m) * 2.0));
	}
	return tmp;
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	tmp = 0
	if F <= 1e-17:
		tmp = math.sqrt(((F * B_m) * 2.0)) / -B_m
	else:
		tmp = -math.sqrt(((F / B_m) * 2.0))
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if (F <= 1e-17)
		tmp = Float64(sqrt(Float64(Float64(F * B_m) * 2.0)) / Float64(-B_m));
	else
		tmp = Float64(-sqrt(Float64(Float64(F / B_m) * 2.0)));
	end
	return tmp
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	tmp = 0.0;
	if (F <= 1e-17)
		tmp = sqrt(((F * B_m) * 2.0)) / -B_m;
	else
		tmp = -sqrt(((F / B_m) * 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := If[LessEqual[F, 1e-17], N[(N[Sqrt[N[(N[(F * B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if F < 1.00000000000000007e-17

   1. Initial program 27.0%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   2. Add Preprocessing

   3. Taylor expanded in A around 0

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \frac{\sqrt{2}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \frac{\sqrt{2}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\sqrt{2}}{B}\right)\right)} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      4. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\frac{\sqrt{2}}{B}\right)} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      5. lower-/.f64 N/A

         \[\leadsto \left(-\color{blue}{\frac{\sqrt{2}}{B}}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\frac{\color{blue}{\sqrt{2}}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \color{blue}{\sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      8. *-commutative N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(C + \sqrt{{B}^{2} + {C}^{2}}\right) \cdot F}} \]

      9. lower-*.f64 N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(C + \sqrt{{B}^{2} + {C}^{2}}\right) \cdot F}} \]

      10. +-commutative N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(\sqrt{{B}^{2} + {C}^{2}} + C\right)} \cdot F} \]

      11. lower-+.f64 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(\sqrt{{B}^{2} + {C}^{2}} + C\right)} \cdot F} \]

      12. +-commutative N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{\color{blue}{{C}^{2} + {B}^{2}}} + C\right) \cdot F} \]

      13. unpow2 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{\color{blue}{C \cdot C} + {B}^{2}} + C\right) \cdot F} \]

      14. unpow2 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{C \cdot C + \color{blue}{B \cdot B}} + C\right) \cdot F} \]

      15. lower-hypot.f64 18.3

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\color{blue}{\mathsf{hypot}\left(C, B\right)} + C\right) \cdot F} \]

   5. Applied rewrites 18.3%

      \[\leadsto \color{blue}{\left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\mathsf{hypot}\left(C, B\right) + C\right) \cdot F}} \]
   6. Step-by-step derivation

   7. Applied rewrites 16.7%

      \[\leadsto \sqrt{\mathsf{hypot}\left(C, B\right) + C} \cdot \color{blue}{\left(\sqrt{F} \cdot \frac{\sqrt{2}}{-B}\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 18.4%

      \[\leadsto \frac{\sqrt{\left(\mathsf{hypot}\left(C, B\right) + C\right) \cdot \left(F \cdot 2\right)}}{\color{blue}{-B}} \]

   10. Taylor expanded in C around 0

       \[\leadsto \frac{\sqrt{2 \cdot \left(B \cdot F\right)}}{-B} \]
   11. Step-by-step derivation

   12. Applied rewrites 14.7%

       \[\leadsto \frac{\sqrt{2 \cdot \left(B \cdot F\right)}}{-B} \]

   if 1.00000000000000007e-17 < F

   1. Initial program 16.8%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   2. Add Preprocessing

   3. Taylor expanded in B around inf

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

      5. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\sqrt{2}\right)} \cdot \sqrt{\frac{F}{B}} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\color{blue}{\sqrt{2}}\right) \cdot \sqrt{\frac{F}{B}} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\sqrt{2}\right) \cdot \color{blue}{\sqrt{\frac{F}{B}}} \]

      8. lower-/.f64 21.5

         \[\leadsto \left(-\sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{F}{B}}} \]

   5. Applied rewrites 21.5%

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{\frac{F}{B}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 21.6%

      \[\leadsto \color{blue}{-\sqrt{\frac{F}{B} \cdot 2}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 18.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;F \leq 10^{-17}:\\ \;\;\;\;\frac{\sqrt{\left(F \cdot B\right) \cdot 2}}{-B}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{F}{B} \cdot 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 18: 27.4% accurate, 12.3× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} \mathbf{if}\;C \leq 5.8 \cdot 10^{+259}:\\ \;\;\;\;-\sqrt{\left|\frac{F}{B\_m} \cdot 2\right|}\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{-B\_m} \cdot \sqrt{F \cdot C}\\ \end{array} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (if (<= C 5.8e+259)
   (- (sqrt (fabs (* (/ F B_m) 2.0))))
   (* (/ 2.0 (- B_m)) (sqrt (* F C)))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (C <= 5.8e+259) {
		tmp = -sqrt(fabs(((F / B_m) * 2.0)));
	} else {
		tmp = (2.0 / -B_m) * sqrt((F * C));
	}
	return tmp;
}

Fortran

B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (c <= 5.8d+259) then
        tmp = -sqrt(abs(((f / b_m) * 2.0d0)))
    else
        tmp = (2.0d0 / -b_m) * sqrt((f * c))
    end if
    code = tmp
end function

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (C <= 5.8e+259) {
		tmp = -Math.sqrt(Math.abs(((F / B_m) * 2.0)));
	} else {
		tmp = (2.0 / -B_m) * Math.sqrt((F * C));
	}
	return tmp;
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	tmp = 0
	if C <= 5.8e+259:
		tmp = -math.sqrt(math.fabs(((F / B_m) * 2.0)))
	else:
		tmp = (2.0 / -B_m) * math.sqrt((F * C))
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if (C <= 5.8e+259)
		tmp = Float64(-sqrt(abs(Float64(Float64(F / B_m) * 2.0))));
	else
		tmp = Float64(Float64(2.0 / Float64(-B_m)) * sqrt(Float64(F * C)));
	end
	return tmp
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	tmp = 0.0;
	if (C <= 5.8e+259)
		tmp = -sqrt(abs(((F / B_m) * 2.0)));
	else
		tmp = (2.0 / -B_m) * sqrt((F * C));
	end
	tmp_2 = tmp;
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := If[LessEqual[C, 5.8e+259], (-N[Sqrt[N[Abs[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]], $MachinePrecision]), N[(N[(2.0 / (-B$95$m)), $MachinePrecision] * N[Sqrt[N[(F * C), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if C < 5.7999999999999999e259

   1. Initial program 22.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

      \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

      5. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\sqrt{2}\right)} \cdot \sqrt{\frac{F}{B}} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\color{blue}{\sqrt{2}}\right) \cdot \sqrt{\frac{F}{B}} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\sqrt{2}\right) \cdot \color{blue}{\sqrt{\frac{F}{B}}} \]

      8. lower-/.f64 16.2

         \[\leadsto \left(-\sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{F}{B}}} \]

   5. Applied rewrites 16.2%

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{\frac{F}{B}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 16.4%

      \[\leadsto \color{blue}{-\sqrt{\frac{F}{B} \cdot 2}} \]
   8. Step-by-step derivation

   9. Applied rewrites 30.1%

      \[\leadsto -\sqrt{\left|\frac{F}{B} \cdot 2\right|} \]

   if 5.7999999999999999e259 < C

   1. Initial program 1.8%

      \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   2. Add Preprocessing

   3. Taylor expanded in A around 0

      \[\leadsto \color{blue}{-1 \cdot \left(\frac{\sqrt{2}}{B} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}\right)} \]
   4. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \frac{\sqrt{2}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(-1 \cdot \frac{\sqrt{2}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\sqrt{2}}{B}\right)\right)} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      4. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\left(-\frac{\sqrt{2}}{B}\right)} \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      5. lower-/.f64 N/A

         \[\leadsto \left(-\color{blue}{\frac{\sqrt{2}}{B}}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      6. lower-sqrt.f64 N/A

         \[\leadsto \left(-\frac{\color{blue}{\sqrt{2}}}{B}\right) \cdot \sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)} \]

      7. lower-sqrt.f64 N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \color{blue}{\sqrt{F \cdot \left(C + \sqrt{{B}^{2} + {C}^{2}}\right)}} \]

      8. *-commutative N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(C + \sqrt{{B}^{2} + {C}^{2}}\right) \cdot F}} \]

      9. lower-*.f64 N/A

         \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(C + \sqrt{{B}^{2} + {C}^{2}}\right) \cdot F}} \]

      10. +-commutative N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(\sqrt{{B}^{2} + {C}^{2}} + C\right)} \cdot F} \]

      11. lower-+.f64 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\color{blue}{\left(\sqrt{{B}^{2} + {C}^{2}} + C\right)} \cdot F} \]

      12. +-commutative N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{\color{blue}{{C}^{2} + {B}^{2}}} + C\right) \cdot F} \]

      13. unpow2 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{\color{blue}{C \cdot C} + {B}^{2}} + C\right) \cdot F} \]

      14. unpow2 N/A

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\sqrt{C \cdot C + \color{blue}{B \cdot B}} + C\right) \cdot F} \]

      15. lower-hypot.f64 12.7

          \[\leadsto \left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\color{blue}{\mathsf{hypot}\left(C, B\right)} + C\right) \cdot F} \]

   5. Applied rewrites 12.7%

      \[\leadsto \color{blue}{\left(-\frac{\sqrt{2}}{B}\right) \cdot \sqrt{\left(\mathsf{hypot}\left(C, B\right) + C\right) \cdot F}} \]

   6. Taylor expanded in C around inf

      \[\leadsto -1 \cdot \color{blue}{\left(\frac{{\left(\sqrt{2}\right)}^{2}}{B} \cdot \sqrt{C \cdot F}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 12.7%

      \[\leadsto -\frac{2}{B} \cdot \sqrt{C \cdot F} \]
3. Recombined 2 regimes into one program.

4. Final simplification 29.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;C \leq 5.8 \cdot 10^{+259}:\\ \;\;\;\;-\sqrt{\left|\frac{F}{B} \cdot 2\right|}\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{-B} \cdot \sqrt{F \cdot C}\\ \end{array} \]
5. Add Preprocessing

Alternative 19: 26.8% accurate, 15.8× 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{F}{B\_m} \cdot 2\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 B_m) 2.0)))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	return -sqrt(fabs(((F / B_m) * 2.0)));
}

Fortran

B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = -sqrt(abs(((f / b_m) * 2.0d0)))
end function

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	return -Math.sqrt(Math.abs(((F / B_m) * 2.0)));
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	return -math.sqrt(math.fabs(((F / B_m) * 2.0)))

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	return Float64(-sqrt(abs(Float64(Float64(F / B_m) * 2.0))))
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
	tmp = -sqrt(abs(((F / B_m) * 2.0)));
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[Abs[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 21.8%

   \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
2. Add Preprocessing

3. Taylor expanded in B around inf

   \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]

   2. *-commutative N/A

      \[\leadsto \mathsf{neg}\left(\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}}\right) \]

   3. distribute-lft-neg-in N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

   4. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

   5. lower-neg.f64 N/A

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right)} \cdot \sqrt{\frac{F}{B}} \]

   6. lower-sqrt.f64 N/A

      \[\leadsto \left(-\color{blue}{\sqrt{2}}\right) \cdot \sqrt{\frac{F}{B}} \]

   7. lower-sqrt.f64 N/A

      \[\leadsto \left(-\sqrt{2}\right) \cdot \color{blue}{\sqrt{\frac{F}{B}}} \]

   8. lower-/.f64 15.9

      \[\leadsto \left(-\sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{F}{B}}} \]

5. Applied rewrites 15.9%

   \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{\frac{F}{B}}} \]
6. Step-by-step derivation

7. Applied rewrites 16.0%

   \[\leadsto \color{blue}{-\sqrt{\frac{F}{B} \cdot 2}} \]
8. Step-by-step derivation

9. Applied rewrites 29.2%

   \[\leadsto -\sqrt{\left|\frac{F}{B} \cdot 2\right|} \]
10. Add Preprocessing

Alternative 20: 26.6% accurate, 16.9× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ -\sqrt{\frac{F}{B\_m} \cdot 2} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F) :precision binary64 (- (sqrt (* (/ F B_m) 2.0))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	return -sqrt(((F / B_m) * 2.0));
}

Fortran

B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = -sqrt(((f / b_m) * 2.0d0))
end function

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	return -Math.sqrt(((F / B_m) * 2.0));
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	return -math.sqrt(((F / B_m) * 2.0))

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	return Float64(-sqrt(Float64(Float64(F / B_m) * 2.0)))
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
	tmp = -sqrt(((F / B_m) * 2.0));
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(N[(F / B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 21.8%

   \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
2. Add Preprocessing

3. Taylor expanded in B around inf

   \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]

   2. *-commutative N/A

      \[\leadsto \mathsf{neg}\left(\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}}\right) \]

   3. distribute-lft-neg-in N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

   4. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

   5. lower-neg.f64 N/A

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right)} \cdot \sqrt{\frac{F}{B}} \]

   6. lower-sqrt.f64 N/A

      \[\leadsto \left(-\color{blue}{\sqrt{2}}\right) \cdot \sqrt{\frac{F}{B}} \]

   7. lower-sqrt.f64 N/A

      \[\leadsto \left(-\sqrt{2}\right) \cdot \color{blue}{\sqrt{\frac{F}{B}}} \]

   8. lower-/.f64 15.9

      \[\leadsto \left(-\sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{F}{B}}} \]

5. Applied rewrites 15.9%

   \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{\frac{F}{B}}} \]
6. Step-by-step derivation

7. Applied rewrites 16.0%

   \[\leadsto \color{blue}{-\sqrt{\frac{F}{B} \cdot 2}} \]
8. Add Preprocessing

Alternative 21: 26.6% accurate, 16.9× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ -\sqrt{\frac{2}{B\_m} \cdot F} \end{array} \]

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F) :precision binary64 (- (sqrt (* (/ 2.0 B_m) F))))

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	return -sqrt(((2.0 / B_m) * F));
}

Fortran

B_m = abs(b)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
real(8) function code(a, b_m, c, f)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = -sqrt(((2.0d0 / b_m) * f))
end function

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	return -Math.sqrt(((2.0 / B_m) * F));
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	return -math.sqrt(((2.0 / B_m) * F))

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	return Float64(-sqrt(Float64(Float64(2.0 / B_m) * F)))
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp = code(A, B_m, C, F)
	tmp = -sqrt(((2.0 / B_m) * F));
end

Wolfram

B_m = N[Abs[B], $MachinePrecision]
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
code[A_, B$95$m_, C_, F_] := (-N[Sqrt[N[(N[(2.0 / B$95$m), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 21.8%

   \[\frac{-\sqrt{\left(2 \cdot \left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) + \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
2. Add Preprocessing

3. Taylor expanded in B around inf

   \[\leadsto \color{blue}{-1 \cdot \left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{\frac{F}{B}} \cdot \sqrt{2}\right)} \]

   2. *-commutative N/A

      \[\leadsto \mathsf{neg}\left(\color{blue}{\sqrt{2} \cdot \sqrt{\frac{F}{B}}}\right) \]

   3. distribute-lft-neg-in N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

   4. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\sqrt{2}\right)\right) \cdot \sqrt{\frac{F}{B}}} \]

   5. lower-neg.f64 N/A

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right)} \cdot \sqrt{\frac{F}{B}} \]

   6. lower-sqrt.f64 N/A

      \[\leadsto \left(-\color{blue}{\sqrt{2}}\right) \cdot \sqrt{\frac{F}{B}} \]

   7. lower-sqrt.f64 N/A

      \[\leadsto \left(-\sqrt{2}\right) \cdot \color{blue}{\sqrt{\frac{F}{B}}} \]

   8. lower-/.f64 15.9

      \[\leadsto \left(-\sqrt{2}\right) \cdot \sqrt{\color{blue}{\frac{F}{B}}} \]

5. Applied rewrites 15.9%

   \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{\frac{F}{B}}} \]
6. Step-by-step derivation

7. Applied rewrites 16.0%

   \[\leadsto \color{blue}{-\sqrt{\frac{F}{B} \cdot 2}} \]
8. Step-by-step derivation

9. Applied rewrites 15.9%

   \[\leadsto -\sqrt{F \cdot \frac{2}{B}} \]

10. Final simplification 15.9%

    \[\leadsto -\sqrt{\frac{2}{B} \cdot F} \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2024255 
(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))))