ABCF->ab-angle b

Percentage Accurate: 19.4% → 53.0%

Time: 14.4s

Alternatives: 14

Speedup: 7.8×

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

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\ t_1 := A - \mathsf{hypot}\left(B\_m, A - C\right)\\ t_2 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\ t_3 := 2 \cdot \left(t\_2 \cdot F\right)\\ t_4 := -t\_2\\ t_5 := \frac{\sqrt{t\_3 \cdot \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)}}{t\_4}\\ t_6 := -\sqrt{2}\\ \mathbf{if}\;t\_5 \leq -\infty:\\ \;\;\;\;t\_6 \cdot \sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}}\\ \mathbf{elif}\;t\_5 \leq -2 \cdot 10^{-207}:\\ \;\;\;\;\frac{\sqrt{t\_3 \cdot \frac{C \cdot C - t\_1 \cdot t\_1}{C - t\_1}}}{t\_4}\\ \mathbf{elif}\;t\_5 \leq \infty:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_0\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_6}{B\_m} \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot 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 (- A (hypot B_m (- A C))))
        (t_2 (- (pow B_m 2.0) (* (* 4.0 A) C)))
        (t_3 (* 2.0 (* t_2 F)))
        (t_4 (- t_2))
        (t_5
         (/
          (sqrt (* t_3 (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
          t_4))
        (t_6 (- (sqrt 2.0))))
   (if (<= t_5 (- INFINITY))
     (*
      t_6
      (sqrt
       (*
        F
        (/ (- (+ C A) (hypot (- A C) B_m)) (fma -4.0 (* C A) (* B_m B_m))))))
     (if (<= t_5 -2e-207)
       (/ (sqrt (* t_3 (/ (- (* C C) (* t_1 t_1)) (- C t_1)))) t_4)
       (if (<= t_5 INFINITY)
         (/
          (sqrt (* (fma (* -0.5 B_m) (/ B_m C) (+ A A)) (* (* F 2.0) t_0)))
          (- t_0))
         (* (/ t_6 B_m) (sqrt (* (- A (hypot B_m A)) 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 = A - hypot(B_m, (A - C));
	double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
	double t_3 = 2.0 * (t_2 * F);
	double t_4 = -t_2;
	double t_5 = sqrt((t_3 * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / t_4;
	double t_6 = -sqrt(2.0);
	double tmp;
	if (t_5 <= -((double) INFINITY)) {
		tmp = t_6 * sqrt((F * (((C + A) - hypot((A - C), B_m)) / fma(-4.0, (C * A), (B_m * B_m)))));
	} else if (t_5 <= -2e-207) {
		tmp = sqrt((t_3 * (((C * C) - (t_1 * t_1)) / (C - t_1)))) / t_4;
	} else if (t_5 <= ((double) INFINITY)) {
		tmp = sqrt((fma((-0.5 * B_m), (B_m / C), (A + A)) * ((F * 2.0) * t_0))) / -t_0;
	} else {
		tmp = (t_6 / B_m) * sqrt(((A - hypot(B_m, A)) * 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(-4.0 * C), A, Float64(B_m * B_m))
	t_1 = Float64(A - hypot(B_m, Float64(A - C)))
	t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))
	t_3 = Float64(2.0 * Float64(t_2 * F))
	t_4 = Float64(-t_2)
	t_5 = Float64(sqrt(Float64(t_3 * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / t_4)
	t_6 = Float64(-sqrt(2.0))
	tmp = 0.0
	if (t_5 <= Float64(-Inf))
		tmp = Float64(t_6 * sqrt(Float64(F * Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / fma(-4.0, Float64(C * A), Float64(B_m * B_m))))));
	elseif (t_5 <= -2e-207)
		tmp = Float64(sqrt(Float64(t_3 * Float64(Float64(Float64(C * C) - Float64(t_1 * t_1)) / Float64(C - t_1)))) / t_4);
	elseif (t_5 <= Inf)
		tmp = Float64(sqrt(Float64(fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)) * Float64(Float64(F * 2.0) * t_0))) / Float64(-t_0));
	else
		tmp = Float64(Float64(t_6 / B_m) * sqrt(Float64(Float64(A - hypot(B_m, A)) * 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[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(A - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[(t$95$2 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = (-t$95$2)}, Block[{t$95$5 = N[(N[Sqrt[N[(t$95$3 * 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$4), $MachinePrecision]}, Block[{t$95$6 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[t$95$5, (-Infinity)], N[(t$95$6 * N[Sqrt[N[(F * N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, -2e-207], N[(N[Sqrt[N[(t$95$3 * N[(N[(N[(C * C), $MachinePrecision] - N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision] / N[(C - t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(N[Sqrt[N[(N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(t$95$6 / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]]]

Derivation

1. Split input into 4 regimes

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

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

   5. Applied rewrites 60.8%

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\right)}{\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.99999999999999985e-207

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

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-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}{\left(C + A\right)} - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      4. associate--l+ N/A

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

      5. flip-+ 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}{\frac{C \cdot C - \left(A - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right) \cdot \left(A - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}{C - \left(A - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

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

   4. Applied rewrites 75.5%

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

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

   1. Initial program 16.1%

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

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 28.4

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

   5. Applied rewrites 28.4%

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

   7. Applied rewrites 28.4%

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

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

      1. mul-1-neg N/A

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

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

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\sqrt{2}}{B}\right)\right) \cdot \sqrt{F \cdot \left(A - \sqrt{{A}^{2} + {B}^{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(A - \sqrt{{A}^{2} + {B}^{2}}\right)}} \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 20.5

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

   5. Applied rewrites 20.5%

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

4. Final simplification 36.6%

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

Alternative 2: 53.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\ t_1 := \mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)\\ 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}\\ t_5 := -\sqrt{2}\\ \mathbf{if}\;t\_4 \leq -\infty:\\ \;\;\;\;t\_5 \cdot \sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{t\_1}}\\ \mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-207}:\\ \;\;\;\;\frac{\sqrt{\left(\left(C + A\right) - \mathsf{hypot}\left(B\_m, A - C\right)\right) \cdot \left(\left(2 \cdot F\right) \cdot t\_1\right)}}{\mathsf{fma}\left(-B\_m, B\_m, t\_2\right)}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_0\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_5}{B\_m} \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot 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 (fma -4.0 (* C A) (* B_m B_m)))
        (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)))
        (t_5 (- (sqrt 2.0))))
   (if (<= t_4 (- INFINITY))
     (* t_5 (sqrt (* F (/ (- (+ C A) (hypot (- A C) B_m)) t_1))))
     (if (<= t_4 -2e-207)
       (/
        (sqrt (* (- (+ C A) (hypot B_m (- A C))) (* (* 2.0 F) t_1)))
        (fma (- B_m) B_m t_2))
       (if (<= t_4 INFINITY)
         (/
          (sqrt (* (fma (* -0.5 B_m) (/ B_m C) (+ A A)) (* (* F 2.0) t_0)))
          (- t_0))
         (* (/ t_5 B_m) (sqrt (* (- A (hypot B_m A)) 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 = fma(-4.0, (C * A), (B_m * B_m));
	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 t_5 = -sqrt(2.0);
	double tmp;
	if (t_4 <= -((double) INFINITY)) {
		tmp = t_5 * sqrt((F * (((C + A) - hypot((A - C), B_m)) / t_1)));
	} else if (t_4 <= -2e-207) {
		tmp = sqrt((((C + A) - hypot(B_m, (A - C))) * ((2.0 * F) * t_1))) / fma(-B_m, B_m, t_2);
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = sqrt((fma((-0.5 * B_m), (B_m / C), (A + A)) * ((F * 2.0) * t_0))) / -t_0;
	} else {
		tmp = (t_5 / B_m) * sqrt(((A - hypot(B_m, A)) * 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(-4.0 * C), A, Float64(B_m * B_m))
	t_1 = fma(-4.0, Float64(C * A), Float64(B_m * B_m))
	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))
	t_5 = Float64(-sqrt(2.0))
	tmp = 0.0
	if (t_4 <= Float64(-Inf))
		tmp = Float64(t_5 * sqrt(Float64(F * Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / t_1))));
	elseif (t_4 <= -2e-207)
		tmp = Float64(sqrt(Float64(Float64(Float64(C + A) - hypot(B_m, Float64(A - C))) * Float64(Float64(2.0 * F) * t_1))) / fma(Float64(-B_m), B_m, t_2));
	elseif (t_4 <= Inf)
		tmp = Float64(sqrt(Float64(fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)) * Float64(Float64(F * 2.0) * t_0))) / Float64(-t_0));
	else
		tmp = Float64(Float64(t_5 / B_m) * sqrt(Float64(Float64(A - hypot(B_m, A)) * 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[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(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]}, Block[{t$95$5 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[t$95$4, (-Infinity)], N[(t$95$5 * N[Sqrt[N[(F * N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -2e-207], N[(N[Sqrt[N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[B$95$m ^ 2 + N[(A - C), $MachinePrecision] ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(2.0 * F), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[((-B$95$m) * B$95$m + t$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[(t$95$5 / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

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

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

   5. Applied rewrites 60.8%

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\right)}{\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.99999999999999985e-207

   1. Initial program 94.2%

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

   4. Applied rewrites 94.2%

      \[\leadsto \color{blue}{\frac{\sqrt{\left(\left(C + A\right) - \mathsf{hypot}\left(B, A - C\right)\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.99999999999999985e-207 < (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < +inf.0

   1. Initial program 16.1%

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

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 28.4

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

   5. Applied rewrites 28.4%

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

   7. Applied rewrites 28.4%

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

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

      1. mul-1-neg N/A

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

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

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\sqrt{2}}{B}\right)\right) \cdot \sqrt{F \cdot \left(A - \sqrt{{A}^{2} + {B}^{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(A - \sqrt{{A}^{2} + {B}^{2}}\right)}} \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 20.5

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

   5. Applied rewrites 20.5%

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

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

Alternative 3: 52.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 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\ t_1 := \left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)\\ t_2 := -t\_0\\ t_3 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\ 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}\\ t_5 := -\sqrt{2}\\ \mathbf{if}\;t\_4 \leq -\infty:\\ \;\;\;\;t\_5 \cdot \sqrt{F \cdot \frac{t\_1}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}}\\ \mathbf{elif}\;t\_4 \leq -2 \cdot 10^{-207}:\\ \;\;\;\;\frac{\sqrt{\left(\left(F \cdot 2\right) \cdot t\_1\right) \cdot t\_0}}{t\_2}\\ \mathbf{elif}\;t\_4 \leq \infty:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_0\right)}}{t\_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_5}{B\_m} \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot 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 (- (+ C A) (hypot (- A C) B_m)))
        (t_2 (- t_0))
        (t_3 (- (pow B_m 2.0) (* (* 4.0 A) C)))
        (t_4
         (/
          (sqrt
           (*
            (* 2.0 (* t_3 F))
            (- (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
          (- t_3)))
        (t_5 (- (sqrt 2.0))))
   (if (<= t_4 (- INFINITY))
     (* t_5 (sqrt (* F (/ t_1 (fma -4.0 (* C A) (* B_m B_m))))))
     (if (<= t_4 -2e-207)
       (/ (sqrt (* (* (* F 2.0) t_1) t_0)) t_2)
       (if (<= t_4 INFINITY)
         (/
          (sqrt (* (fma (* -0.5 B_m) (/ B_m C) (+ A A)) (* (* F 2.0) t_0)))
          t_2)
         (* (/ t_5 B_m) (sqrt (* (- A (hypot B_m A)) 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 = (C + A) - hypot((A - C), B_m);
	double t_2 = -t_0;
	double t_3 = pow(B_m, 2.0) - ((4.0 * A) * C);
	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 t_5 = -sqrt(2.0);
	double tmp;
	if (t_4 <= -((double) INFINITY)) {
		tmp = t_5 * sqrt((F * (t_1 / fma(-4.0, (C * A), (B_m * B_m)))));
	} else if (t_4 <= -2e-207) {
		tmp = sqrt((((F * 2.0) * t_1) * t_0)) / t_2;
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = sqrt((fma((-0.5 * B_m), (B_m / C), (A + A)) * ((F * 2.0) * t_0))) / t_2;
	} else {
		tmp = (t_5 / B_m) * sqrt(((A - hypot(B_m, A)) * 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(-4.0 * C), A, Float64(B_m * B_m))
	t_1 = Float64(Float64(C + A) - hypot(Float64(A - C), B_m))
	t_2 = Float64(-t_0)
	t_3 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))
	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))
	t_5 = Float64(-sqrt(2.0))
	tmp = 0.0
	if (t_4 <= Float64(-Inf))
		tmp = Float64(t_5 * sqrt(Float64(F * Float64(t_1 / fma(-4.0, Float64(C * A), Float64(B_m * B_m))))));
	elseif (t_4 <= -2e-207)
		tmp = Float64(sqrt(Float64(Float64(Float64(F * 2.0) * t_1) * t_0)) / t_2);
	elseif (t_4 <= Inf)
		tmp = Float64(sqrt(Float64(fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)) * Float64(Float64(F * 2.0) * t_0))) / t_2);
	else
		tmp = Float64(Float64(t_5 / B_m) * sqrt(Float64(Float64(A - hypot(B_m, A)) * 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[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = (-t$95$0)}, Block[{t$95$3 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $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]}, Block[{t$95$5 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[t$95$4, (-Infinity)], N[(t$95$5 * N[Sqrt[N[(F * N[(t$95$1 / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -2e-207], N[(N[Sqrt[N[(N[(N[(F * 2.0), $MachinePrecision] * t$95$1), $MachinePrecision] * t$95$0), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(N[Sqrt[N[(N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / t$95$2), $MachinePrecision], N[(N[(t$95$5 / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]]]]]]

Derivation

1. Split input into 4 regimes

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

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

   5. Applied rewrites 60.8%

      \[\leadsto \color{blue}{\left(-\sqrt{2}\right) \cdot \sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\right)}{\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.99999999999999985e-207

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

      1. lift-sqrt.f64 N/A

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

      2. pow1/2 N/A

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

      3. sqr-pow N/A

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

      4. pow2 N/A

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

      5. lower-pow.f64 N/A

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

   4. Applied rewrites 94.0%

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

   6. Applied rewrites 91.3%

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

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

   1. Initial program 16.1%

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

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 28.4

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

   5. Applied rewrites 28.4%

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

   7. Applied rewrites 28.4%

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

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

      1. mul-1-neg N/A

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

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

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\sqrt{2}}{B}\right)\right) \cdot \sqrt{F \cdot \left(A - \sqrt{{A}^{2} + {B}^{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(A - \sqrt{{A}^{2} + {B}^{2}}\right)}} \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 20.5

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

   5. Applied rewrites 20.5%

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

4. Final simplification 38.7%

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

Alternative 4: 32.3% accurate, 0.5× speedup

Math

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

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 = (F * 2.0) * t_0;
	double t_2 = pow(B_m, 2.0) - ((4.0 * A) * C);
	double t_3 = sqrt(((2.0 * (t_2 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_2;
	double t_4 = -t_0;
	double tmp;
	if ((t_3 <= -1e+214) || !(t_3 <= -2e-207)) {
		tmp = sqrt((fma((-0.5 * B_m), (B_m / C), (A + A)) * t_1)) / t_4;
	} else {
		tmp = sqrt(((B_m * (((A + C) / B_m) - 1.0)) * t_1)) / t_4;
	}
	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(-4.0 * C), A, Float64(B_m * B_m))
	t_1 = Float64(Float64(F * 2.0) * t_0)
	t_2 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))
	t_3 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_2 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_2))
	t_4 = Float64(-t_0)
	tmp = 0.0
	if ((t_3 <= -1e+214) || !(t_3 <= -2e-207))
		tmp = Float64(sqrt(Float64(fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)) * t_1)) / t_4);
	else
		tmp = Float64(sqrt(Float64(Float64(B_m * Float64(Float64(Float64(A + C) / B_m) - 1.0)) * t_1)) / t_4);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 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))) < -9.9999999999999995e213 or -1.99999999999999985e-207 < (/.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 6.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 C 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(\left(A + \frac{-1}{2} \cdot \frac{{B}^{2}}{C}\right) - -1 \cdot A\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 15.6

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

   5. Applied rewrites 15.6%

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

   7. Applied rewrites 15.6%

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

   if -9.9999999999999995e213 < (/.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.99999999999999985e-207

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 21.0

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

   5. Applied rewrites 21.0%

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

   7. Applied rewrites 21.0%

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

   8. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. div-add-rev N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 38.2

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

   10. Applied rewrites 38.2%

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

4. Final simplification 18.3%

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

Alternative 5: 30.2% accurate, 0.5× speedup

Math

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

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 = (F * 2.0) * t_0;
	double t_2 = -t_0;
	double t_3 = (4.0 * A) * C;
	double t_4 = pow(B_m, 2.0) - t_3;
	double t_5 = sqrt(((2.0 * (t_4 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / -t_4;
	double tmp;
	if (t_5 <= -1e+136) {
		tmp = sqrt(((A + A) * t_1)) / t_2;
	} else if (t_5 <= -2e-207) {
		tmp = sqrt(((B_m * (((A + C) / B_m) - 1.0)) * t_1)) / t_2;
	} else {
		tmp = sqrt((fma((-0.5 * B_m), (B_m / C), (A + A)) * t_1)) / t_3;
	}
	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(-4.0 * C), A, Float64(B_m * B_m))
	t_1 = Float64(Float64(F * 2.0) * t_0)
	t_2 = Float64(-t_0)
	t_3 = Float64(Float64(4.0 * A) * C)
	t_4 = Float64((B_m ^ 2.0) - t_3)
	t_5 = Float64(sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / Float64(-t_4))
	tmp = 0.0
	if (t_5 <= -1e+136)
		tmp = Float64(sqrt(Float64(Float64(A + A) * t_1)) / t_2);
	elseif (t_5 <= -2e-207)
		tmp = Float64(sqrt(Float64(Float64(B_m * Float64(Float64(Float64(A + C) / B_m) - 1.0)) * t_1)) / t_2);
	else
		tmp = Float64(sqrt(Float64(fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)) * t_1)) / t_3);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 19.8%

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

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 22.5

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

   5. Applied rewrites 22.5%

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

   7. Applied rewrites 22.5%

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

   8. Taylor expanded in C around inf

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

      1. mul-1-neg N/A

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

      2. lower--.f64 N/A

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

      3. lower-neg.f64 24.4

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

   10. Applied rewrites 24.4%

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

   if -1.00000000000000006e136 < (/.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.99999999999999985e-207

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 22.5

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

   5. Applied rewrites 22.5%

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

   7. Applied rewrites 22.5%

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

   8. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. div-add-rev N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 41.9

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

   10. Applied rewrites 41.9%

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

   if -1.99999999999999985e-207 < (/.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 6.4%

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

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 13.6

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

   5. Applied rewrites 13.6%

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

   7. Applied rewrites 13.6%

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

   8. Taylor expanded in A around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 12.6

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

   10. Applied rewrites 12.6%

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

4. Final simplification 17.8%

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

Alternative 6: 48.6% accurate, 2.7× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\ t_1 := -\sqrt{2}\\ \mathbf{if}\;B\_m \leq 0.0295:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_0\right)}}{-t\_0}\\ \mathbf{elif}\;B\_m \leq 4 \cdot 10^{+148}:\\ \;\;\;\;t\_1 \cdot \sqrt{F \cdot \frac{\left(C + A\right) - \mathsf{hypot}\left(A - C, B\_m\right)}{\mathsf{fma}\left(-4, C \cdot A, B\_m \cdot B\_m\right)}}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_1}{B\_m} \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot 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 (- (sqrt 2.0))))
   (if (<= B_m 0.0295)
     (/
      (sqrt (* (fma (* -0.5 B_m) (/ B_m C) (+ A A)) (* (* F 2.0) t_0)))
      (- t_0))
     (if (<= B_m 4e+148)
       (*
        t_1
        (sqrt
         (*
          F
          (/ (- (+ C A) (hypot (- A C) B_m)) (fma -4.0 (* C A) (* B_m B_m))))))
       (* (/ t_1 B_m) (sqrt (* (- A (hypot B_m A)) 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 = -sqrt(2.0);
	double tmp;
	if (B_m <= 0.0295) {
		tmp = sqrt((fma((-0.5 * B_m), (B_m / C), (A + A)) * ((F * 2.0) * t_0))) / -t_0;
	} else if (B_m <= 4e+148) {
		tmp = t_1 * sqrt((F * (((C + A) - hypot((A - C), B_m)) / fma(-4.0, (C * A), (B_m * B_m)))));
	} else {
		tmp = (t_1 / B_m) * sqrt(((A - hypot(B_m, A)) * 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(-4.0 * C), A, Float64(B_m * B_m))
	t_1 = Float64(-sqrt(2.0))
	tmp = 0.0
	if (B_m <= 0.0295)
		tmp = Float64(sqrt(Float64(fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)) * Float64(Float64(F * 2.0) * t_0))) / Float64(-t_0));
	elseif (B_m <= 4e+148)
		tmp = Float64(t_1 * sqrt(Float64(F * Float64(Float64(Float64(C + A) - hypot(Float64(A - C), B_m)) / fma(-4.0, Float64(C * A), Float64(B_m * B_m))))));
	else
		tmp = Float64(Float64(t_1 / B_m) * sqrt(Float64(Float64(A - hypot(B_m, A)) * 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[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-N[Sqrt[2.0], $MachinePrecision])}, If[LessEqual[B$95$m, 0.0295], N[(N[Sqrt[N[(N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], If[LessEqual[B$95$m, 4e+148], N[(t$95$1 * N[Sqrt[N[(F * N[(N[(N[(C + A), $MachinePrecision] - N[Sqrt[N[(A - C), $MachinePrecision] ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / N[(-4.0 * N[(C * A), $MachinePrecision] + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if B < 0.029499999999999998

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 21.1

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

   5. Applied rewrites 21.1%

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

   7. Applied rewrites 21.1%

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

   if 0.029499999999999998 < B < 4.0000000000000002e148

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

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

   5. Applied rewrites 60.4%

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

   if 4.0000000000000002e148 < B

   1. Initial program 2.5%

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

   3. Taylor expanded in C around 0

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

      1. mul-1-neg N/A

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

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

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\sqrt{2}}{B}\right)\right) \cdot \sqrt{F \cdot \left(A - \sqrt{{A}^{2} + {B}^{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(A - \sqrt{{A}^{2} + {B}^{2}}\right)}} \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 53.6

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

   5. Applied rewrites 53.6%

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

4. Final simplification 30.1%

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

Alternative 7: 46.2% 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 \cdot C, A, B\_m \cdot B\_m\right)\\ \mathbf{if}\;B\_m \leq 2.15 \cdot 10^{+37}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-0.5 \cdot B\_m, \frac{B\_m}{C}, A + A\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_0\right)}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{-\sqrt{2}}{B\_m} \cdot \sqrt{\left(A - \mathsf{hypot}\left(B\_m, A\right)\right) \cdot 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 2.15e+37)
     (/
      (sqrt (* (fma (* -0.5 B_m) (/ B_m C) (+ A A)) (* (* F 2.0) t_0)))
      (- t_0))
     (* (/ (- (sqrt 2.0)) B_m) (sqrt (* (- A (hypot B_m A)) 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 <= 2.15e+37) {
		tmp = sqrt((fma((-0.5 * B_m), (B_m / C), (A + A)) * ((F * 2.0) * t_0))) / -t_0;
	} else {
		tmp = (-sqrt(2.0) / B_m) * sqrt(((A - hypot(B_m, A)) * 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(-4.0 * C), A, Float64(B_m * B_m))
	tmp = 0.0
	if (B_m <= 2.15e+37)
		tmp = Float64(sqrt(Float64(fma(Float64(-0.5 * B_m), Float64(B_m / C), Float64(A + A)) * Float64(Float64(F * 2.0) * t_0))) / Float64(-t_0));
	else
		tmp = Float64(Float64(Float64(-sqrt(2.0)) / B_m) * sqrt(Float64(Float64(A - hypot(B_m, A)) * 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[(-4.0 * C), $MachinePrecision] * A + N[(B$95$m * B$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 2.15e+37], N[(N[Sqrt[N[(N[(N[(-0.5 * B$95$m), $MachinePrecision] * N[(B$95$m / C), $MachinePrecision] + N[(A + A), $MachinePrecision]), $MachinePrecision] * N[(N[(F * 2.0), $MachinePrecision] * t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / (-t$95$0)), $MachinePrecision], N[(N[((-N[Sqrt[2.0], $MachinePrecision]) / B$95$m), $MachinePrecision] * N[Sqrt[N[(N[(A - N[Sqrt[B$95$m ^ 2 + A ^ 2], $MachinePrecision]), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if B < 2.1499999999999998e37

   1. Initial program 20.1%

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

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 20.7

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

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

   7. Applied rewrites 20.7%

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

   if 2.1499999999999998e37 < B

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

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

      1. mul-1-neg N/A

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

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

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{\sqrt{2}}{B}\right)\right) \cdot \sqrt{F \cdot \left(A - \sqrt{{A}^{2} + {B}^{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(A - \sqrt{{A}^{2} + {B}^{2}}\right)}} \]

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower--.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 50.6

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

   5. Applied rewrites 50.6%

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

4. Final simplification 27.8%

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

Alternative 8: 22.5% accurate, 5.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} t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\ t_1 := -t\_0\\ \mathbf{if}\;A \leq -1.7 \cdot 10^{-62} \lor \neg \left(A \leq 2.9 \cdot 10^{-186}\right):\\ \;\;\;\;\frac{\sqrt{\left(-8 \cdot A\right) \cdot \left(\left(C \cdot F\right) \cdot \left(A + A\right)\right)}}{t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(-B\_m\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_0\right)}}{t\_1}\\ \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 (- t_0)))
   (if (or (<= A -1.7e-62) (not (<= A 2.9e-186)))
     (/ (sqrt (* (* -8.0 A) (* (* C F) (+ A A)))) t_1)
     (/ (sqrt (* (- B_m) (* (* F 2.0) t_0))) t_1))))

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 = -t_0;
	double tmp;
	if ((A <= -1.7e-62) || !(A <= 2.9e-186)) {
		tmp = sqrt(((-8.0 * A) * ((C * F) * (A + A)))) / t_1;
	} else {
		tmp = sqrt((-B_m * ((F * 2.0) * t_0))) / t_1;
	}
	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(-4.0 * C), A, Float64(B_m * B_m))
	t_1 = Float64(-t_0)
	tmp = 0.0
	if ((A <= -1.7e-62) || !(A <= 2.9e-186))
		tmp = Float64(sqrt(Float64(Float64(-8.0 * A) * Float64(Float64(C * F) * Float64(A + A)))) / t_1);
	else
		tmp = Float64(sqrt(Float64(Float64(-B_m) * Float64(Float64(F * 2.0) * t_0))) / t_1);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if A < -1.69999999999999994e-62 or 2.90000000000000019e-186 < A

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 16.7

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

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

   7. Applied rewrites 16.7%

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

   8. Taylor expanded in C around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-neg.f64 14.6

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

   10. Applied rewrites 14.6%

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

   if -1.69999999999999994e-62 < A < 2.90000000000000019e-186

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

      1. mul-1-neg N/A

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

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

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

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

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

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

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

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

      9. lower-neg.f64 15.3

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

   5. Applied rewrites 15.3%

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

   7. Applied rewrites 15.3%

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

   8. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 10.6

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

   10. Applied rewrites 10.6%

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

4. Final simplification 13.4%

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

Alternative 9: 26.3% accurate, 6.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} t_0 := \mathsf{fma}\left(-4 \cdot C, A, B\_m \cdot B\_m\right)\\ \frac{\sqrt{\left(A + A\right) \cdot \left(\left(F \cdot 2\right) \cdot t\_0\right)}}{-t\_0} \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))))
   (/ (sqrt (* (+ A A) (* (* F 2.0) t_0))) (- t_0))))

C

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

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(-4.0 * C), A, Float64(B_m * B_m))
	return Float64(sqrt(Float64(Float64(A + A) * Float64(Float64(F * 2.0) * t_0))) / Float64(-t_0))
end

Wolfram

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

Derivation

1. Initial program 17.5%

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

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

   1. mul-1-neg N/A

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

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

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

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

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

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

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

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

   9. lower-neg.f64 16.3

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

5. Applied rewrites 16.3%

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

7. Applied rewrites 16.3%

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

8. Taylor expanded in C around inf

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

   1. mul-1-neg N/A

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

   2. lower--.f64 N/A

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

   3. lower-neg.f64 15.5

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

10. Applied rewrites 15.5%

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

11. Final simplification 15.5%

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

Alternative 10: 20.4% accurate, 7.8× speedup

Math

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

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (/
  (sqrt (* (* -8.0 A) (* (* C F) (+ A A))))
  (- (fma (* -4.0 C) A (* B_m 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(((-8.0 * A) * ((C * F) * (A + A)))) / -fma((-4.0 * C), A, (B_m * 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(-8.0 * A) * Float64(Float64(C * F) * Float64(A + A)))) / Float64(-fma(Float64(-4.0 * C), A, Float64(B_m * B_m))))
end

Wolfram

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

Derivation

1. Initial program 17.5%

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

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

   1. mul-1-neg N/A

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

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

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

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

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

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

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

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

   9. lower-neg.f64 16.3

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

5. Applied rewrites 16.3%

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

7. Applied rewrites 16.3%

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

8. Taylor expanded in C around inf

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

   1. associate-*r* N/A

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

   2. lower-*.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. associate-*r* N/A

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

   5. lower-*.f64 N/A

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

   6. lower-*.f64 N/A

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

   7. mul-1-neg N/A

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

   8. lower--.f64 N/A

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

   9. lower-neg.f64 12.1

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

10. Applied rewrites 12.1%

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

11. Final simplification 12.1%

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

Alternative 11: 16.2% accurate, 8.2× speedup

Math

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

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (/ (sqrt (* (* -16.0 (* A A)) (* C F))) (- (fma (* -4.0 C) A (* B_m 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(((-16.0 * (A * A)) * (C * F))) / -fma((-4.0 * C), A, (B_m * 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(-16.0 * Float64(A * A)) * Float64(C * F))) / Float64(-fma(Float64(-4.0 * C), A, Float64(B_m * B_m))))
end

Wolfram

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

Derivation

1. Initial program 17.5%

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

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

   1. mul-1-neg N/A

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

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

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

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

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

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

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

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

   9. lower-neg.f64 16.3

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

5. Applied rewrites 16.3%

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

7. Applied rewrites 16.3%

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

8. Taylor expanded in A around -inf

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

   1. associate-*r* N/A

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

   2. lower-*.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. unpow2 N/A

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

   5. lower-*.f64 N/A

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

   6. lower-*.f64 9.6

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

10. Applied rewrites 9.6%

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

Alternative 12: 4.0% accurate, 8.6× speedup

Math

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

C

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

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 = ((-0.25d0) * sqrt((f / a))) * (sqrt(2.0d0) * sqrt(8.0d0))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 17.5%

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

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

   1. mul-1-neg N/A

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

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

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

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

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

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

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

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

   9. lower-neg.f64 16.3

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

5. Applied rewrites 16.3%

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

7. Applied rewrites 16.3%

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

9. Applied rewrites 2.7%

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

10. Taylor expanded in C around -inf

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

    1. associate-*r* N/A

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

    2. lower-*.f64 N/A

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

    3. lower-*.f64 N/A

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

    4. lower-sqrt.f64 N/A

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

    5. lower-/.f64 N/A

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

    6. lower-*.f64 N/A

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

    7. lower-sqrt.f64 N/A

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

    8. lower-sqrt.f64 2.5

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

12. Applied rewrites 2.5%

    \[\leadsto \color{blue}{\left(-0.25 \cdot \sqrt{\frac{F}{A}}\right) \cdot \left(\sqrt{2} \cdot \sqrt{8}\right)} \]
13. Add Preprocessing

Alternative 13: 1.7% accurate, 12.9× speedup

Math

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

Julia

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

Derivation

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. *-commutative N/A

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

   7. unpow2 N/A

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

   8. rem-square-sqrt N/A

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

   9. lower-*.f64 N/A

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

   10. lower-sqrt.f64 N/A

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

   11. lower-sqrt.f64 N/A

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

   12. lower-/.f64 1.9

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

5. Applied rewrites 1.9%

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

7. Applied rewrites 1.9%

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

9. Applied rewrites 1.9%

   \[\leadsto \sqrt{\frac{\mathsf{fma}\left(F, B, B \cdot F\right)}{B \cdot B}} \]
10. Add Preprocessing

Alternative 14: 1.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{F \cdot \frac{2}{B\_m}} \end{array} \]

FPCore

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

C

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

Fortran

B_m =     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 * (2.0d0 / b_m)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. *-commutative N/A

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

   7. unpow2 N/A

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

   8. rem-square-sqrt N/A

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

   9. lower-*.f64 N/A

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

   10. lower-sqrt.f64 N/A

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

   11. lower-sqrt.f64 N/A

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

   12. lower-/.f64 1.9

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

5. Applied rewrites 1.9%

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

7. Applied rewrites 1.9%

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

9. Applied rewrites 1.9%

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

Reproduce

herbie shell --seed 2024360 
(FPCore (A B C F)
  :name "ABCF->ab-angle b"
  :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))))