ABCF->ab-angle a

Percentage Accurate: 19.0% → 61.9%

Time: 15.2s

Alternatives: 17

Speedup: 16.9×

Specification

Math

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

FPCore

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

C

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

Fortran

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.0% 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: 61.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

   4. Applied rewrites 60.2%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. sqrt-prod N/A

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

      5. pow1/2 N/A

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

      6. lower-*.f64 N/A

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

   6. Applied rewrites 73.7%

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

   if -1.0000000000000001e-184 < (/.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 20.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

   4. Applied rewrites 39.8%

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

   5. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 32.4

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

   7. Applied rewrites 32.4%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 21.6

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

   5. Applied rewrites 21.6%

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

   7. Applied rewrites 21.7%

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

   9. Applied rewrites 27.7%

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

4. Final simplification 44.5%

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

Alternative 2: 59.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999999e-232

   1. Initial program 22.6%

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

   3. Taylor expanded in A around -inf

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

      1. lower-*.f64 22.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(2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   5. Applied rewrites 22.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(2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   if 9.9999999999999999e-232 < (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999995e59

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

   4. Applied rewrites 50.9%

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

   if 9.9999999999999995e59 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 9.0%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 30.8

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

   5. Applied rewrites 30.8%

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

   7. Applied rewrites 30.9%

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

   9. Applied rewrites 37.4%

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

4. Final simplification 36.3%

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

Alternative 3: 58.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999999e-232

   1. Initial program 22.6%

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

   3. Taylor expanded in A around -inf

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

      1. lower-*.f64 22.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(2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   5. Applied rewrites 22.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(2 \cdot C\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

   if 9.9999999999999999e-232 < (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999995e59

   1. Initial program 29.5%

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

   4. Applied rewrites 50.8%

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

   if 9.9999999999999995e59 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 9.0%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 30.8

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

   5. Applied rewrites 30.8%

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

   7. Applied rewrites 30.9%

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

   9. Applied rewrites 37.4%

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

4. Final simplification 36.3%

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

Alternative 4: 56.7% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 9.9999999999999995e59

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

   4. Applied rewrites 40.3%

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

   5. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 22.0

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

   7. Applied rewrites 22.0%

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

   if 9.9999999999999995e59 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 9.0%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 30.8

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

   5. Applied rewrites 30.8%

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

   7. Applied rewrites 30.9%

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

   9. Applied rewrites 37.4%

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

4. Final simplification 29.4%

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

Alternative 5: 55.0% accurate, 3.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if B < 8.5000000000000006e29

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

   4. Applied rewrites 32.1%

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

   6. Applied rewrites 31.7%

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

   7. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 15.8

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

   9. Applied rewrites 15.8%

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

   if 8.5000000000000006e29 < B < 2.14999999999999992e238

   1. Initial program 18.8%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 58.3

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

   5. Applied rewrites 58.3%

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

   7. Applied rewrites 58.5%

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

   9. Applied rewrites 60.9%

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

   11. Applied rewrites 61.0%

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

   if 2.14999999999999992e238 < B

   1. Initial program 0.0%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 57.5

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

   5. Applied rewrites 57.5%

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

   7. Applied rewrites 88.5%

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

   8. Taylor expanded in C around 0

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

   10. Applied rewrites 80.9%

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

4. Final simplification 28.5%

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

Alternative 6: 56.7% 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 8.5 \cdot 10^{+29}:\\ \;\;\;\;\sqrt{\mathsf{fma}\left(4, C, \frac{\left(-B\_m\right) \cdot B\_m}{A}\right)} \cdot \frac{\sqrt{t\_0 \cdot F}}{-t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{\left(\mathsf{hypot}\left(C, B\_m\right) + C\right) \cdot 2} \cdot \sqrt{F}}{-B\_m}\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 8.5000000000000006e29

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

   4. Applied rewrites 32.1%

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

   6. Applied rewrites 31.7%

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

   7. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 15.8

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

   9. Applied rewrites 15.8%

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

   if 8.5000000000000006e29 < B

   1. Initial program 12.1%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 58.0

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

   5. Applied rewrites 58.0%

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

   7. Applied rewrites 58.3%

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

   9. Applied rewrites 70.8%

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

4. Final simplification 29.1%

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

Alternative 7: 56.6% accurate, 3.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 1.8e35

   1. Initial program 19.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

   4. Applied rewrites 32.3%

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

   6. Applied rewrites 31.9%

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

   7. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 15.7

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

   9. Applied rewrites 15.7%

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

   if 1.8e35 < B

   1. Initial program 10.9%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 58.2

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

   5. Applied rewrites 58.2%

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

   7. Applied rewrites 71.2%

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

   9. Applied rewrites 71.4%

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

4. Final simplification 28.7%

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

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 5.89999999999999985e35

   1. Initial program 19.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

   4. Applied rewrites 32.3%

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

   6. Applied rewrites 31.9%

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

   7. Taylor expanded in A around -inf

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 15.7

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

   9. Applied rewrites 15.7%

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

   if 5.89999999999999985e35 < B

   1. Initial program 10.9%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 58.2

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

   5. Applied rewrites 58.2%

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

   7. Applied rewrites 71.2%

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

   8. Taylor expanded in C around 0

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

   10. Applied rewrites 65.8%

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

4. Final simplification 27.4%

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

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 5e-31

   1. Initial program 16.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

   4. Applied rewrites 29.7%

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

   6. Applied rewrites 29.2%

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

   7. Taylor expanded in A around -inf

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

      1. lower-*.f64 14.9

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

   9. Applied rewrites 14.9%

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

   if 5e-31 < B

   1. Initial program 19.9%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 55.2

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

   5. Applied rewrites 55.2%

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

   7. Applied rewrites 65.8%

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

   8. Taylor expanded in C around 0

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

   10. Applied rewrites 61.2%

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

4. Final simplification 28.1%

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

Alternative 10: 37.7% accurate, 6.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 9.1999999999999993e35

   1. Initial program 19.9%

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

   3. Taylor expanded in 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. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. +-commutative N/A

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

      13. unpow2 N/A

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

      14. unpow2 N/A

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

      15. lower-hypot.f64 6.3

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

   5. Applied rewrites 6.3%

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

   6. Taylor expanded in A around -inf

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

   8. Applied rewrites 6.8%

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

   if 9.1999999999999993e35 < B

   1. Initial program 10.9%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 58.2

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

   5. Applied rewrites 58.2%

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

   7. Applied rewrites 71.2%

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

   8. Taylor expanded in C around 0

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

   10. Applied rewrites 65.8%

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

4. Final simplification 20.6%

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

Alternative 11: 35.3% 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(\frac{\sqrt{2}}{-B\_m} \cdot \sqrt{B\_m + C}\right) \cdot \sqrt{F} \end{array} \]

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 17.8%

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

3. Taylor expanded in A around 0

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

   1. mul-1-neg N/A

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

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

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

   3. lower-*.f64 N/A

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

   4. lower-neg.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 N/A

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

   10. +-commutative N/A

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

   11. lower-+.f64 N/A

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

   12. unpow2 N/A

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

   13. unpow2 N/A

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

   14. lower-hypot.f64 18.7

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

5. Applied rewrites 18.7%

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

7. Applied rewrites 22.5%

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

8. Taylor expanded in C around 0

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

10. Applied rewrites 19.3%

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

Alternative 12: 35.2% accurate, 10.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if C < 2.8999999999999999e200

   1. Initial program 19.1%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 17.3

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

   5. Applied rewrites 17.3%

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

   7. Applied rewrites 17.3%

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

   9. Applied rewrites 20.7%

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

   if 2.8999999999999999e200 < C

   1. Initial program 1.3%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 22.0

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

   5. Applied rewrites 22.0%

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

   7. Applied rewrites 22.1%

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

   8. Taylor expanded in B around 0

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

   10. Applied rewrites 17.5%

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

4. Final simplification 20.4%

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

Alternative 13: 34.3% accurate, 11.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if F < 6.8e13

   1. Initial program 19.4%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 22.1

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

   5. Applied rewrites 22.1%

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

   7. Applied rewrites 22.2%

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

   8. Taylor expanded in C around 0

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

   10. Applied rewrites 18.9%

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

   if 6.8e13 < F

   1. Initial program 15.4%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 19.2

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

   5. Applied rewrites 19.2%

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

   7. Applied rewrites 19.3%

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

Alternative 14: 34.0% accurate, 12.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if F < 1.99999999999999989e-20

   1. Initial program 20.3%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 20.4

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

   5. Applied rewrites 20.4%

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

   7. Applied rewrites 20.4%

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

   8. Taylor expanded in B around inf

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

   10. Applied rewrites 17.7%

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

   if 1.99999999999999989e-20 < F

   1. Initial program 15.2%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 20.8

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

   5. Applied rewrites 20.8%

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

   7. Applied rewrites 20.9%

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

Alternative 15: 27.7% accurate, 12.3× speedup

Math

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

C

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

Fortran

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

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if C < 2.4000000000000001e200

   1. Initial program 19.1%

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

   3. Taylor expanded in B around inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

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

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

      4. lower-*.f64 N/A

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

      5. lower-neg.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 17.3

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

   5. Applied rewrites 17.3%

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

   7. Applied rewrites 17.3%

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

   if 2.4000000000000001e200 < C

   1. Initial program 1.3%

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

   3. Taylor expanded in A around 0

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

      1. mul-1-neg N/A

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

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

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. unpow2 N/A

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

      13. unpow2 N/A

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

      14. lower-hypot.f64 22.0

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

   5. Applied rewrites 22.0%

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

   6. Taylor expanded in B around 0

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

   8. Applied rewrites 17.5%

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

4. Final simplification 17.4%

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

Alternative 16: 26.7% accurate, 16.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 17.8%

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

3. Taylor expanded in B around inf

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. lower-/.f64 16.4

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

5. Applied rewrites 16.4%

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

7. Applied rewrites 16.5%

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

Alternative 17: 26.6% accurate, 16.9× speedup

Math

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 17.8%

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

3. Taylor expanded in B around inf

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

   1. mul-1-neg N/A

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

   2. *-commutative N/A

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

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

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

   4. lower-*.f64 N/A

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

   5. lower-neg.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 N/A

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

   8. lower-/.f64 16.4

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

5. Applied rewrites 16.4%

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

7. Applied rewrites 16.5%

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

9. Applied rewrites 16.4%

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

Reproduce

herbie shell --seed 2024358 
(FPCore (A B C F)
  :name "ABCF->ab-angle a"
  :precision binary64
  (/ (- (sqrt (* (* 2.0 (* (- (pow B 2.0) (* (* 4.0 A) C)) F)) (+ (+ A C) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))) (- (pow B 2.0) (* (* 4.0 A) C))))