ABCF->ab-angle a

Percentage Accurate: 18.9% → 63.8%

Time: 15.9s

Alternatives: 17

Speedup: 18.2×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 18.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c, f)
use fmin_fmax_functions
    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: 63.8% 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 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\ t_1 := \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\_m}^{2}}\right)}}{-t\_0}\\ t_2 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-217}:\\ \;\;\;\;\left(\sqrt{F \cdot 2} \cdot \left(-\sqrt{\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\right)\right) \cdot \frac{\sqrt{\left(\mathsf{hypot}\left(B\_m, A - C\right) + A\right) + C}}{t\_2}\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\left(-\sqrt{\left(2 \cdot F\right) \cdot t\_2}\right) \cdot \frac{\sqrt{C \cdot \mathsf{fma}\left(0, \frac{A}{C}, 1\right) + C}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2}}{-B\_m} \cdot \sqrt{F}\\ \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 (- (pow B_m 2.0) (* (* 4.0 A) C)))
        (t_1
         (/
          (sqrt
           (*
            (* 2.0 (* t_0 F))
            (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
          (- t_0)))
        (t_2 (fma -4.0 (* C A) (* B_m B_m))))
   (if (<= t_1 -1e-217)
     (*
      (* (sqrt (* F 2.0)) (- (sqrt (fma (* C A) -4.0 (* B_m B_m)))))
      (/ (sqrt (+ (+ (hypot B_m (- A C)) A) C)) t_2))
     (if (<= t_1 0.0)
       (* (- (sqrt 2.0)) (sqrt (* -0.5 (/ F A))))
       (if (<= t_1 INFINITY)
         (*
          (- (sqrt (* (* 2.0 F) t_2)))
          (/ (sqrt (+ (* C (fma 0.0 (/ A C) 1.0)) C)) t_2))
         (* (/ (sqrt (* (+ (hypot C B_m) C) 2.0)) (- B_m)) (sqrt F)))))))

C

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

Julia

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

Wolfram

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

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

   4. Applied rewrites 67.4%

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

      1. lift-neg.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. pow1/2 N/A

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

      4. lift-*.f64 N/A

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

      5. unpow-prod-down N/A

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

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

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

      7. lower-*.f64 N/A

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

      8. pow1/2 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 N/A

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

      14. pow1/2 N/A

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

      15. lift-fma.f64 N/A

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

      16. +-commutative N/A

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

      17. fp-cancel-sign-sub-inv N/A

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

      18. lift-*.f64 N/A

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

      19. pow2 N/A

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

      20. lift-pow.f64 N/A

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

      21. metadata-eval N/A

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

      22. lift-*.f64 N/A

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

      23. *-commutative N/A

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

      24. associate-*l* N/A

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

      25. lift-*.f64 N/A

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

      26. lift-*.f64 N/A

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

   6. Applied rewrites 84.8%

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

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

   1. Initial program 3.5%

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

   3. Taylor expanded in 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 14.3%

      \[\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, C \cdot A, B \cdot B\right)}}} \]

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 23.6%

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

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

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

   4. Applied rewrites 81.7%

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

   5. Taylor expanded in C around inf

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. metadata-eval N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 56.6

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

   7. Applied rewrites 56.6%

      \[\leadsto \left(-\sqrt{\left(2 \cdot F\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B \cdot B\right)}\right) \cdot \frac{\sqrt{\color{blue}{C \cdot \mathsf{fma}\left(0, \frac{A}{C}, 1\right)} + C}}{\mathsf{fma}\left(-4, C \cdot A, 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. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 20.0

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

   5. Applied rewrites 20.0%

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

   7. Applied rewrites 29.0%

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

   9. Applied rewrites 29.1%

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

4. Final simplification 50.0%

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

Alternative 2: 60.3% accurate, 0.2× speedup

Math

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 5 regimes

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

   1. Initial program 3.1%

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

   3. Taylor expanded in F around 0

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

      \[\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, C \cdot A, B \cdot B\right)}}} \]
   6. Step-by-step derivation

   7. Applied rewrites 59.5%

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

   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.00000000000000008e-217

   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(B, A - C\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(-B, B, \left(4 \cdot A\right) \cdot C\right)}} \]

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

   1. Initial program 3.5%

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

   3. Taylor expanded in 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 14.3%

      \[\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, C \cdot A, B \cdot B\right)}}} \]

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 23.6%

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

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

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

   4. Applied rewrites 81.7%

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

   5. Taylor expanded in C around inf

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. metadata-eval N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 56.6

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

   7. Applied rewrites 56.6%

      \[\leadsto \left(-\sqrt{\left(2 \cdot F\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B \cdot B\right)}\right) \cdot \frac{\sqrt{\color{blue}{C \cdot \mathsf{fma}\left(0, \frac{A}{C}, 1\right)} + C}}{\mathsf{fma}\left(-4, C \cdot A, 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. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 20.0

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

   5. Applied rewrites 20.0%

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

   7. Applied rewrites 29.0%

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

   9. Applied rewrites 29.1%

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

4. Final simplification 48.1%

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

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

C

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

Julia

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

Wolfram

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

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

   4. Applied rewrites 67.4%

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

      1. lift-sqrt.f64 N/A

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

      2. pow1/2 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*l* N/A

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

      6. unpow-prod-down N/A

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

      7. lift-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. fp-cancel-sign-sub-inv N/A

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

      10. lift-*.f64 N/A

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

      11. pow2 N/A

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

      12. lift-pow.f64 N/A

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

      13. metadata-eval N/A

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

      14. lift-*.f64 N/A

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

      15. *-commutative N/A

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

      16. associate-*l* N/A

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

      17. lift-*.f64 N/A

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

      18. lift-*.f64 N/A

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

      19. lift--.f64 N/A

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

      20. *-commutative N/A

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

      21. lift-*.f64 N/A

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

   6. Applied rewrites 84.7%

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

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

   1. Initial program 3.5%

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

   3. Taylor expanded in 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 14.3%

      \[\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, C \cdot A, B \cdot B\right)}}} \]

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 23.6%

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

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

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

   4. Applied rewrites 81.7%

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

   5. Taylor expanded in C around inf

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. metadata-eval N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 56.6

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

   7. Applied rewrites 56.6%

      \[\leadsto \left(-\sqrt{\left(2 \cdot F\right) \cdot \mathsf{fma}\left(-4, C \cdot A, B \cdot B\right)}\right) \cdot \frac{\sqrt{\color{blue}{C \cdot \mathsf{fma}\left(0, \frac{A}{C}, 1\right)} + C}}{\mathsf{fma}\left(-4, C \cdot A, 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. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 20.0

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

   5. Applied rewrites 20.0%

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

   7. Applied rewrites 29.0%

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

   9. Applied rewrites 29.1%

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

4. Final simplification 50.0%

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

Alternative 4: 49.6% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 3.8000000000000002e-54

   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

   4. Applied rewrites 32.5%

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

   5. Taylor expanded in A around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 16.8

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

   7. Applied rewrites 16.8%

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

   if 3.8000000000000002e-54 < B

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

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 43.5

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

   5. Applied rewrites 43.5%

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

   7. Applied rewrites 58.1%

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

   9. Applied rewrites 58.3%

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

   10. Taylor expanded in C around 0

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

   12. Applied rewrites 57.0%

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

4. Final simplification 29.4%

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

Alternative 5: 48.7% 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} \mathbf{if}\;B\_m \leq 1.45 \cdot 10^{-55}:\\ \;\;\;\;\left(-\sqrt{-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)}\right) \cdot \left(\left(-0.25 \cdot \frac{\sqrt{2}}{A}\right) \cdot \sqrt{{C}^{-1}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\ \end{array} \end{array} \]

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 1.45e-55) {
		tmp = -sqrt((-8.0 * (A * (C * F)))) * ((-0.25 * (sqrt(2.0) / A)) * sqrt(pow(C, -1.0)));
	} else {
		tmp = (sqrt(((C + B_m) * 2.0)) / B_m) * -sqrt(F);
	}
	return tmp;
}

Fortran

B_m =     private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (b_m <= 1.45d-55) then
        tmp = -sqrt(((-8.0d0) * (a * (c * f)))) * (((-0.25d0) * (sqrt(2.0d0) / a)) * sqrt((c ** (-1.0d0))))
    else
        tmp = (sqrt(((c + b_m) * 2.0d0)) / b_m) * -sqrt(f)
    end if
    code = tmp
end function

Java

B_m = Math.abs(B);
assert A < B_m && B_m < C && C < F;
public static double code(double A, double B_m, double C, double F) {
	double tmp;
	if (B_m <= 1.45e-55) {
		tmp = -Math.sqrt((-8.0 * (A * (C * F)))) * ((-0.25 * (Math.sqrt(2.0) / A)) * Math.sqrt(Math.pow(C, -1.0)));
	} else {
		tmp = (Math.sqrt(((C + B_m) * 2.0)) / B_m) * -Math.sqrt(F);
	}
	return tmp;
}

Python

B_m = math.fabs(B)
[A, B_m, C, F] = sort([A, B_m, C, F])
def code(A, B_m, C, F):
	tmp = 0
	if B_m <= 1.45e-55:
		tmp = -math.sqrt((-8.0 * (A * (C * F)))) * ((-0.25 * (math.sqrt(2.0) / A)) * math.sqrt(math.pow(C, -1.0)))
	else:
		tmp = (math.sqrt(((C + B_m) * 2.0)) / B_m) * -math.sqrt(F)
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	tmp = 0.0
	if (B_m <= 1.45e-55)
		tmp = Float64(Float64(-sqrt(Float64(-8.0 * Float64(A * Float64(C * F))))) * Float64(Float64(-0.25 * Float64(sqrt(2.0) / A)) * sqrt((C ^ -1.0))));
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(C + B_m) * 2.0)) / B_m) * Float64(-sqrt(F)));
	end
	return tmp
end

MATLAB

B_m = abs(B);
A, B_m, C, F = num2cell(sort([A, B_m, C, F])){:}
function tmp_2 = code(A, B_m, C, F)
	tmp = 0.0;
	if (B_m <= 1.45e-55)
		tmp = -sqrt((-8.0 * (A * (C * F)))) * ((-0.25 * (sqrt(2.0) / A)) * sqrt((C ^ -1.0)));
	else
		tmp = (sqrt(((C + B_m) * 2.0)) / B_m) * -sqrt(F);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 1.45e-55

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

   4. Applied rewrites 32.2%

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

   5. Taylor expanded in A around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-/.f64 16.9

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

   7. Applied rewrites 16.9%

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

   8. Taylor expanded in A around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 17.1

         \[\leadsto \left(-\sqrt{-8 \cdot \left(A \cdot \color{blue}{\left(C \cdot F\right)}\right)}\right) \cdot \left(\left(-0.25 \cdot \frac{\sqrt{2}}{A}\right) \cdot \sqrt{\frac{1}{C}}\right) \]

   10. Applied rewrites 17.1%

       \[\leadsto \left(-\sqrt{\color{blue}{-8 \cdot \left(A \cdot \left(C \cdot F\right)\right)}}\right) \cdot \left(\left(-0.25 \cdot \frac{\sqrt{2}}{A}\right) \cdot \sqrt{\frac{1}{C}}\right) \]

   if 1.45e-55 < B

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

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

      1. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 43.0

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

   5. Applied rewrites 43.0%

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

   7. Applied rewrites 57.4%

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

   9. Applied rewrites 57.7%

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

   10. Taylor expanded in C around 0

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

   12. Applied rewrites 56.4%

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

4. Final simplification 29.5%

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

Alternative 6: 54.3% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if B < 3.8000000000000002e-54

   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

   4. Applied rewrites 32.5%

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

   5. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 19.1

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

   7. Applied rewrites 19.1%

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

   if 3.8000000000000002e-54 < B < 4.99999999999999992e212

   1. Initial program 24.7%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 35.4

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

   5. Applied rewrites 35.4%

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

   7. Applied rewrites 46.0%

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

   9. Applied rewrites 46.2%

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

   11. Applied rewrites 46.1%

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

   if 4.99999999999999992e212 < B

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

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 61.3

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

   5. Applied rewrites 61.3%

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

   7. Applied rewrites 84.7%

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

   9. Applied rewrites 85.0%

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

   10. Taylor expanded in C around 0

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

   12. Applied rewrites 81.8%

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

4. Final simplification 31.0%

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

Alternative 7: 55.6% accurate, 3.2× speedup

Math

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 3.8000000000000002e-54

   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

   4. Applied rewrites 32.5%

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

   5. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 19.1

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

   7. Applied rewrites 19.1%

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

   if 3.8000000000000002e-54 < B

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

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 43.5

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

   5. Applied rewrites 43.5%

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

   7. Applied rewrites 58.1%

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

   9. Applied rewrites 58.3%

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

Alternative 8: 50.9% accurate, 3.3× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \frac{B\_m \cdot B\_m}{A}\\ t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\ t_2 := -\sqrt{F}\\ \mathbf{if}\;B\_m \leq 3.8 \cdot 10^{-54}:\\ \;\;\;\;\left(-\sqrt{\left(2 \cdot F\right) \cdot t\_1}\right) \cdot \frac{\sqrt{\mathsf{fma}\left(-0.5, t\_0, C\right) + C}}{t\_1}\\ \mathbf{elif}\;B\_m \leq 4.9 \cdot 10^{+97}:\\ \;\;\;\;\frac{\sqrt{\left(\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot F\right) \cdot 2}}{-B\_m}\\ \mathbf{elif}\;B\_m \leq 1.45 \cdot 10^{+110}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5, t\_0, C \cdot 2\right) \cdot \left(t\_1 \cdot 2\right)} \cdot t\_2}{\mathsf{fma}\left(C \cdot A, -4, B\_m \cdot B\_m\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m} \cdot t\_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 (/ (* B_m B_m) A))
        (t_1 (fma -4.0 (* C A) (* B_m B_m)))
        (t_2 (- (sqrt F))))
   (if (<= B_m 3.8e-54)
     (* (- (sqrt (* (* 2.0 F) t_1))) (/ (sqrt (+ (fma -0.5 t_0 C) C)) t_1))
     (if (<= B_m 4.9e+97)
       (/ (sqrt (* (* (+ (hypot C B_m) C) F) 2.0)) (- B_m))
       (if (<= B_m 1.45e+110)
         (/
          (* (sqrt (* (fma -0.5 t_0 (* C 2.0)) (* t_1 2.0))) t_2)
          (fma (* C A) -4.0 (* B_m B_m)))
         (* (/ (sqrt (* (+ C B_m) 2.0)) B_m) t_2))))))

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 = (B_m * B_m) / A;
	double t_1 = fma(-4.0, (C * A), (B_m * B_m));
	double t_2 = -sqrt(F);
	double tmp;
	if (B_m <= 3.8e-54) {
		tmp = -sqrt(((2.0 * F) * t_1)) * (sqrt((fma(-0.5, t_0, C) + C)) / t_1);
	} else if (B_m <= 4.9e+97) {
		tmp = sqrt((((hypot(C, B_m) + C) * F) * 2.0)) / -B_m;
	} else if (B_m <= 1.45e+110) {
		tmp = (sqrt((fma(-0.5, t_0, (C * 2.0)) * (t_1 * 2.0))) * t_2) / fma((C * A), -4.0, (B_m * B_m));
	} else {
		tmp = (sqrt(((C + B_m) * 2.0)) / B_m) * t_2;
	}
	return tmp;
}

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64(Float64(B_m * B_m) / A)
	t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m))
	t_2 = Float64(-sqrt(F))
	tmp = 0.0
	if (B_m <= 3.8e-54)
		tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * F) * t_1))) * Float64(sqrt(Float64(fma(-0.5, t_0, C) + C)) / t_1));
	elseif (B_m <= 4.9e+97)
		tmp = Float64(sqrt(Float64(Float64(Float64(hypot(C, B_m) + C) * F) * 2.0)) / Float64(-B_m));
	elseif (B_m <= 1.45e+110)
		tmp = Float64(Float64(sqrt(Float64(fma(-0.5, t_0, Float64(C * 2.0)) * Float64(t_1 * 2.0))) * t_2) / fma(Float64(C * A), -4.0, Float64(B_m * B_m)));
	else
		tmp = Float64(Float64(sqrt(Float64(Float64(C + B_m) * 2.0)) / B_m) * t_2);
	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[(B$95$m * B$95$m), $MachinePrecision] / A), $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[F], $MachinePrecision])}, If[LessEqual[B$95$m, 3.8e-54], N[((-N[Sqrt[N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]], $MachinePrecision]) * N[(N[Sqrt[N[(N[(-0.5 * t$95$0 + C), $MachinePrecision] + C), $MachinePrecision]], $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[B$95$m, 4.9e+97], N[(N[Sqrt[N[(N[(N[(N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision] + C), $MachinePrecision] * F), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / (-B$95$m)), $MachinePrecision], If[LessEqual[B$95$m, 1.45e+110], N[(N[(N[Sqrt[N[(N[(-0.5 * t$95$0 + N[(C * 2.0), $MachinePrecision]), $MachinePrecision] * N[(t$95$1 * 2.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * t$95$2), $MachinePrecision] / N[(N[(C * A), $MachinePrecision] * -4.0 + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(N[(C + B$95$m), $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / B$95$m), $MachinePrecision] * t$95$2), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if B < 3.8000000000000002e-54

   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

   4. Applied rewrites 32.5%

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

   5. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 19.1

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

   7. Applied rewrites 19.1%

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

   if 3.8000000000000002e-54 < B < 4.89999999999999964e97

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

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

      1. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 31.5

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

   5. Applied rewrites 31.5%

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

   7. Applied rewrites 31.5%

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

   if 4.89999999999999964e97 < B < 1.45e110

   1. Initial program 1.3%

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

   3. Taylor expanded in A around -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(\frac{-1}{2} \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   4. Step-by-step derivation

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

      2. lower-fma.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 \color{blue}{\mathsf{fma}\left(\frac{{B}^{2}}{A}, \frac{-1}{2}, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      3. lower-/.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 \mathsf{fma}\left(\color{blue}{\frac{{B}^{2}}{A}}, \frac{-1}{2}, 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      4. unpow2 N/A

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

      5. lower-*.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 \mathsf{fma}\left(\frac{\color{blue}{B \cdot B}}{A}, \frac{-1}{2}, 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      6. lower-*.f64 2.0

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

   5. Applied rewrites 2.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}{\mathsf{fma}\left(\frac{B \cdot B}{A}, -0.5, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   6. 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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   7. Applied rewrites 25.4%

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

      1. lift-/.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. distribute-frac-neg N/A

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

      4. lift--.f64 N/A

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

      5. lift-pow.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

   9. Applied rewrites 2.0%

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

       1. lift-sqrt.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. sqrt-prod N/A

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

       4. pow1/2 N/A

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

       5. lift-sqrt.f64 N/A

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

       6. lower-*.f64 N/A

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

   11. Applied rewrites 50.0%

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

   if 1.45e110 < B

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

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 57.5

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

   5. Applied rewrites 57.5%

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

   7. Applied rewrites 85.8%

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

   9. Applied rewrites 86.1%

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

   10. Taylor expanded in C around 0

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

   12. Applied rewrites 84.1%

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

4. Final simplification 31.7%

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

Alternative 9: 52.3% accurate, 4.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 2.99999999999999978e30

   1. Initial program 25.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 -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(\frac{-1}{2} \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   4. Step-by-step derivation

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

      2. lower-fma.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 \color{blue}{\mathsf{fma}\left(\frac{{B}^{2}}{A}, \frac{-1}{2}, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      3. lower-/.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 \mathsf{fma}\left(\color{blue}{\frac{{B}^{2}}{A}}, \frac{-1}{2}, 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      4. unpow2 N/A

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

      5. lower-*.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 \mathsf{fma}\left(\frac{\color{blue}{B \cdot B}}{A}, \frac{-1}{2}, 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      6. lower-*.f64 19.3

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

   5. Applied rewrites 19.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}{\mathsf{fma}\left(\frac{B \cdot B}{A}, -0.5, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   6. 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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   7. Applied rewrites 11.5%

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

      1. lift-/.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. distribute-frac-neg N/A

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

      4. lift--.f64 N/A

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

      5. lift-pow.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

   9. Applied rewrites 16.8%

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

       1. lift-*.f64 N/A

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

       2. lift-*.f64 N/A

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

       3. lift-*.f64 N/A

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

       4. associate-*l* N/A

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

       5. associate-*l* N/A

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

       6. lower-*.f64 N/A

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

   11. Applied rewrites 18.5%

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

   if 2.99999999999999978e30 < B

   1. Initial program 11.3%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 44.7

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

   5. Applied rewrites 44.7%

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

   7. Applied rewrites 62.4%

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

   9. Applied rewrites 62.6%

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

   10. Taylor expanded in C around 0

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

   12. Applied rewrites 61.2%

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

4. Final simplification 29.5%

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

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 3.70000000000000016e30

   1. Initial program 25.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 -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(\frac{-1}{2} \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   4. Step-by-step derivation

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

      2. lower-fma.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 \color{blue}{\mathsf{fma}\left(\frac{{B}^{2}}{A}, \frac{-1}{2}, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      3. lower-/.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 \mathsf{fma}\left(\color{blue}{\frac{{B}^{2}}{A}}, \frac{-1}{2}, 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      4. unpow2 N/A

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

      5. lower-*.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 \mathsf{fma}\left(\frac{\color{blue}{B \cdot B}}{A}, \frac{-1}{2}, 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      6. lower-*.f64 19.3

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

   5. Applied rewrites 19.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}{\mathsf{fma}\left(\frac{B \cdot B}{A}, -0.5, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C}} \]

      2. lift-neg.f64 N/A

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

      3. distribute-frac-neg N/A

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

      4. distribute-neg-frac2 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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\right)}}{\mathsf{neg}\left(\left({B}^{2} - \left(4 \cdot A\right) \cdot C\right)\right)}} \]

      5. lower-/.f64 N/A

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

   7. Applied rewrites 19.3%

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

   if 3.70000000000000016e30 < B

   1. Initial program 11.3%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 44.7

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

   5. Applied rewrites 44.7%

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

   7. Applied rewrites 62.4%

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

   9. Applied rewrites 62.6%

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

   10. Taylor expanded in C around 0

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

   12. Applied rewrites 61.2%

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

4. Final simplification 30.1%

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

Alternative 11: 49.1% accurate, 6.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 1.5200000000000001e-55

   1. Initial program 23.6%

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

   3. Taylor expanded in A around -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(\frac{-1}{2} \cdot \frac{{B}^{2}}{A} + 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   4. Step-by-step derivation

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

      2. lower-fma.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 \color{blue}{\mathsf{fma}\left(\frac{{B}^{2}}{A}, \frac{-1}{2}, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      3. lower-/.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 \mathsf{fma}\left(\color{blue}{\frac{{B}^{2}}{A}}, \frac{-1}{2}, 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      4. unpow2 N/A

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

      5. lower-*.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 \mathsf{fma}\left(\frac{\color{blue}{B \cdot B}}{A}, \frac{-1}{2}, 2 \cdot C\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      6. lower-*.f64 19.7

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

   5. Applied rewrites 19.7%

      \[\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}{\mathsf{fma}\left(\frac{B \cdot B}{A}, -0.5, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   6. 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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\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 \mathsf{fma}\left(\frac{B \cdot B}{A}, \frac{-1}{2}, 2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   7. Applied rewrites 12.3%

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

      1. lift-/.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. distribute-frac-neg N/A

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

      4. lift--.f64 N/A

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

      5. lift-pow.f64 N/A

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

      6. pow2 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

   9. Applied rewrites 17.5%

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

   10. Taylor expanded in A around -inf

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

       1. lower-*.f64 16.9

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

   12. Applied rewrites 16.9%

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

   if 1.5200000000000001e-55 < B

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

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

      1. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 43.0

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

   5. Applied rewrites 43.0%

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

   7. Applied rewrites 57.4%

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

   9. Applied rewrites 57.7%

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

   10. Taylor expanded in C around 0

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

   12. Applied rewrites 56.4%

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

4. Final simplification 29.4%

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

Alternative 12: 47.9% accurate, 9.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}\;B\_m \leq 3.8 \cdot 10^{-56}:\\ \;\;\;\;\left(-\sqrt{2}\right) \cdot \sqrt{-0.5 \cdot \frac{F}{A}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(C + B\_m\right) \cdot 2}}{B\_m} \cdot \left(-\sqrt{F}\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

B_m =     private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (b_m <= 3.8d-56) then
        tmp = -sqrt(2.0d0) * sqrt(((-0.5d0) * (f / a)))
    else
        tmp = (sqrt(((c + b_m) * 2.0d0)) / b_m) * -sqrt(f)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 3.8000000000000002e-56

   1. Initial program 23.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 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 26.4%

      \[\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, C \cdot A, B \cdot B\right)}}} \]

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 17.1%

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

   if 3.8000000000000002e-56 < B

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

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

      1. mul-1-neg N/A

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 43.0

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

   5. Applied rewrites 43.0%

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

   7. Applied rewrites 57.4%

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

   9. Applied rewrites 57.7%

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

   10. Taylor expanded in C around 0

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

   12. Applied rewrites 56.4%

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

4. Final simplification 29.5%

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

Alternative 13: 47.2% accurate, 9.8× speedup

Math

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

FPCore

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

C

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

Fortran

B_m =     private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (b_m <= 3.9d-54) then
        tmp = -sqrt(2.0d0) * sqrt(((-0.5d0) * (f / a)))
    else
        tmp = sqrt((2.0d0 / b_m)) * -sqrt(f)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 3.9e-54

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

      \[\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, C \cdot A, B \cdot B\right)}}} \]

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 17.0%

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

   if 3.9e-54 < B

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

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

   5. Applied rewrites 39.3%

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

   7. Applied rewrites 39.5%

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

   9. Applied rewrites 57.5%

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

4. Final simplification 29.6%

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

Alternative 14: 36.8% accurate, 10.2× speedup

Math

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

FPCore

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

Fortran

B_m =     private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    real(8) :: tmp
    if (c <= 4.1d+189) then
        tmp = sqrt((2.0d0 / b_m)) * -sqrt(f)
    else
        tmp = sqrt(f) * (((-2.0d0) / b_m) * sqrt(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 <= 4.1e+189) {
		tmp = Math.sqrt((2.0 / B_m)) * -Math.sqrt(F);
	} else {
		tmp = Math.sqrt(F) * ((-2.0 / B_m) * Math.sqrt(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 <= 4.1e+189:
		tmp = math.sqrt((2.0 / B_m)) * -math.sqrt(F)
	else:
		tmp = math.sqrt(F) * ((-2.0 / B_m) * math.sqrt(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 <= 4.1e+189)
		tmp = Float64(sqrt(Float64(2.0 / B_m)) * Float64(-sqrt(F)));
	else
		tmp = Float64(sqrt(F) * Float64(Float64(-2.0 / B_m) * sqrt(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 <= 4.1e+189)
		tmp = sqrt((2.0 / B_m)) * -sqrt(F);
	else
		tmp = sqrt(F) * ((-2.0 / B_m) * sqrt(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, 4.1e+189], N[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision], N[(N[Sqrt[F], $MachinePrecision] * N[(N[(-2.0 / B$95$m), $MachinePrecision] * N[Sqrt[C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if C < 4.1000000000000002e189

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

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

   5. Applied rewrites 15.5%

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

   7. Applied rewrites 15.6%

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

   9. Applied rewrites 22.0%

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

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

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

      2. distribute-lft-neg-in 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)}} \]

      3. lower-*.f64 N/A

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

      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. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 0.9

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

   5. Applied rewrites 0.9%

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

   7. Applied rewrites 4.7%

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

   8. Taylor expanded in B around 0

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

   10. Applied rewrites 4.6%

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

   12. Applied rewrites 4.6%

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

4. Final simplification 20.2%

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

Alternative 15: 35.0% accurate, 12.6× speedup

Math

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

FPCore

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

C

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

Fortran

B_m =     private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
    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)) * -sqrt(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)) * -Math.sqrt(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)) * -math.sqrt(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(2.0 / B_m)) * Float64(-sqrt(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)) * -sqrt(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[(N[Sqrt[N[(2.0 / B$95$m), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[F], $MachinePrecision])), $MachinePrecision]

Derivation

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

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

5. Applied rewrites 14.1%

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

7. Applied rewrites 14.1%

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

9. Applied rewrites 19.8%

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

10. Final simplification 19.8%

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

Alternative 16: 26.5% accurate, 16.9× speedup

Math

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

FPCore

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

C

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

Fortran

B_m =     private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = -sqrt((2.0d0 * (f / b_m)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

5. Applied rewrites 14.1%

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

7. Applied rewrites 14.1%

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

9. Applied rewrites 14.1%

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

Alternative 17: 26.5% accurate, 18.2× speedup

Math

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

FPCore

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

C

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

Fortran

B_m =     private
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_m, c, f)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    real(8), intent (in) :: c
    real(8), intent (in) :: f
    code = -sqrt(((f + f) / b_m))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

5. Applied rewrites 14.1%

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

7. Applied rewrites 14.1%

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

9. Applied rewrites 14.1%

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

Reproduce

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