ABCF->ab-angle a

Percentage Accurate: 19.1% → 44.6%

Time: 7.4s

Alternatives: 5

Speedup: 7.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.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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: 44.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} B_m = \left|B\right| \\ [A, B_m, C, F] = \mathsf{sort}([A, B_m, C, F])\\ \\ \begin{array}{l} t_0 := {B\_m}^{2} - \left(4 \cdot A\right) \cdot C\\ \mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-57}:\\ \;\;\;\;\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^{+100}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{F \cdot \left(A + \left(C + \sqrt{{B\_m}^{2} + {\left(A - C\right)}^{2}}\right)\right)}{{B\_m}^{2} - 4 \cdot \left(A \cdot C\right)}} \cdot \sqrt{2}\right)\\ \mathbf{else}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\ \end{array} \end{array} \]

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = pow(B_m, 2.0) - ((4.0 * A) * C);
	double tmp;
	if (pow(B_m, 2.0) <= 2e-57) {
		tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
	} else if (pow(B_m, 2.0) <= 1e+100) {
		tmp = -1.0 * (sqrt(((F * (A + (C + sqrt((pow(B_m, 2.0) + pow((A - C), 2.0)))))) / (pow(B_m, 2.0) - (4.0 * (A * C))))) * sqrt(2.0));
	} else {
		tmp = -1.0 * (sqrt((F / B_m)) * sqrt(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) :: t_0
    real(8) :: tmp
    t_0 = (b_m ** 2.0d0) - ((4.0d0 * a) * c)
    if ((b_m ** 2.0d0) <= 2d-57) then
        tmp = -sqrt(((2.0d0 * (t_0 * f)) * (2.0d0 * c))) / t_0
    else if ((b_m ** 2.0d0) <= 1d+100) then
        tmp = (-1.0d0) * (sqrt(((f * (a + (c + sqrt(((b_m ** 2.0d0) + ((a - c) ** 2.0d0)))))) / ((b_m ** 2.0d0) - (4.0d0 * (a * c))))) * sqrt(2.0d0))
    else
        tmp = (-1.0d0) * (sqrt((f / b_m)) * sqrt(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 t_0 = Math.pow(B_m, 2.0) - ((4.0 * A) * C);
	double tmp;
	if (Math.pow(B_m, 2.0) <= 2e-57) {
		tmp = -Math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
	} else if (Math.pow(B_m, 2.0) <= 1e+100) {
		tmp = -1.0 * (Math.sqrt(((F * (A + (C + Math.sqrt((Math.pow(B_m, 2.0) + Math.pow((A - C), 2.0)))))) / (Math.pow(B_m, 2.0) - (4.0 * (A * C))))) * Math.sqrt(2.0));
	} else {
		tmp = -1.0 * (Math.sqrt((F / B_m)) * Math.sqrt(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):
	t_0 = math.pow(B_m, 2.0) - ((4.0 * A) * C)
	tmp = 0
	if math.pow(B_m, 2.0) <= 2e-57:
		tmp = -math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0
	elif math.pow(B_m, 2.0) <= 1e+100:
		tmp = -1.0 * (math.sqrt(((F * (A + (C + math.sqrt((math.pow(B_m, 2.0) + math.pow((A - C), 2.0)))))) / (math.pow(B_m, 2.0) - (4.0 * (A * C))))) * math.sqrt(2.0))
	else:
		tmp = -1.0 * (math.sqrt((F / B_m)) * math.sqrt(2.0))
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 2e-57)
		tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(2.0 * C)))) / t_0);
	elseif ((B_m ^ 2.0) <= 1e+100)
		tmp = Float64(-1.0 * Float64(sqrt(Float64(Float64(F * Float64(A + Float64(C + sqrt(Float64((B_m ^ 2.0) + (Float64(A - C) ^ 2.0)))))) / Float64((B_m ^ 2.0) - Float64(4.0 * Float64(A * C))))) * sqrt(2.0)));
	else
		tmp = Float64(-1.0 * Float64(sqrt(Float64(F / B_m)) * sqrt(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)
	t_0 = (B_m ^ 2.0) - ((4.0 * A) * C);
	tmp = 0.0;
	if ((B_m ^ 2.0) <= 2e-57)
		tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
	elseif ((B_m ^ 2.0) <= 1e+100)
		tmp = -1.0 * (sqrt(((F * (A + (C + sqrt(((B_m ^ 2.0) + ((A - C) ^ 2.0)))))) / ((B_m ^ 2.0) - (4.0 * (A * C))))) * sqrt(2.0));
	else
		tmp = -1.0 * (sqrt((F / B_m)) * sqrt(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_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-57], 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+100], N[(-1.0 * N[(N[Sqrt[N[(N[(F * N[(A + N[(C + N[Sqrt[N[(N[Power[B$95$m, 2.0], $MachinePrecision] + N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999991e-57

   1. Initial program 21.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. 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} \]
   3. Step-by-step derivation

      1. lower-*.f64 44.8

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

   4. Applied rewrites 44.8%

      \[\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 1.99999999999999991e-57 < (pow.f64 B #s(literal 2 binary64)) < 1.00000000000000002e100

   1. Initial program 35.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. Taylor expanded in F around 0

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 36.4%

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

   if 1.00000000000000002e100 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 11.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. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 47.0

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

   4. Applied rewrites 47.0%

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

Alternative 2: 43.6% 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\\ \mathbf{if}\;{B\_m}^{2} \leq 2 \cdot 10^{-57}:\\ \;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\ \end{array} \end{array} \]

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = pow(B_m, 2.0) - ((4.0 * A) * C);
	double tmp;
	if (pow(B_m, 2.0) <= 2e-57) {
		tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
	} else {
		tmp = -1.0 * (sqrt((F / B_m)) * sqrt(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) :: t_0
    real(8) :: tmp
    t_0 = (b_m ** 2.0d0) - ((4.0d0 * a) * c)
    if ((b_m ** 2.0d0) <= 2d-57) then
        tmp = -sqrt(((2.0d0 * (t_0 * f)) * (2.0d0 * c))) / t_0
    else
        tmp = (-1.0d0) * (sqrt((f / b_m)) * sqrt(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 t_0 = Math.pow(B_m, 2.0) - ((4.0 * A) * C);
	double tmp;
	if (Math.pow(B_m, 2.0) <= 2e-57) {
		tmp = -Math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
	} else {
		tmp = -1.0 * (Math.sqrt((F / B_m)) * Math.sqrt(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):
	t_0 = math.pow(B_m, 2.0) - ((4.0 * A) * C)
	tmp = 0
	if math.pow(B_m, 2.0) <= 2e-57:
		tmp = -math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0
	else:
		tmp = -1.0 * (math.sqrt((F / B_m)) * math.sqrt(2.0))
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64((B_m ^ 2.0) - Float64(Float64(4.0 * A) * C))
	tmp = 0.0
	if ((B_m ^ 2.0) <= 2e-57)
		tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(2.0 * C)))) / t_0);
	else
		tmp = Float64(-1.0 * Float64(sqrt(Float64(F / B_m)) * sqrt(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)
	t_0 = (B_m ^ 2.0) - ((4.0 * A) * C);
	tmp = 0.0;
	if ((B_m ^ 2.0) <= 2e-57)
		tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
	else
		tmp = -1.0 * (sqrt((F / B_m)) * sqrt(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_] := Block[{t$95$0 = N[(N[Power[B$95$m, 2.0], $MachinePrecision] - N[(N[(4.0 * A), $MachinePrecision] * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Power[B$95$m, 2.0], $MachinePrecision], 2e-57], 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], N[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 1.99999999999999991e-57

   1. Initial program 21.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. 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} \]
   3. Step-by-step derivation

      1. lower-*.f64 44.8

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

   4. Applied rewrites 44.8%

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

   1. Initial program 17.0%

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

   2. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 42.6

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

   4. Applied rewrites 42.6%

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

Alternative 3: 42.8% 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 := -4 \cdot \left(A \cdot C\right)\\ \mathbf{if}\;B\_m \leq 4.8 \cdot 10^{-26}:\\ \;\;\;\;\frac{-\sqrt{\left(2 \cdot \left(t\_0 \cdot F\right)\right) \cdot \left(2 \cdot C\right)}}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\ \end{array} \end{array} \]

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double t_0 = -4.0 * (A * C);
	double tmp;
	if (B_m <= 4.8e-26) {
		tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
	} else {
		tmp = -1.0 * (sqrt((F / B_m)) * sqrt(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) :: t_0
    real(8) :: tmp
    t_0 = (-4.0d0) * (a * c)
    if (b_m <= 4.8d-26) then
        tmp = -sqrt(((2.0d0 * (t_0 * f)) * (2.0d0 * c))) / t_0
    else
        tmp = (-1.0d0) * (sqrt((f / b_m)) * sqrt(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 t_0 = -4.0 * (A * C);
	double tmp;
	if (B_m <= 4.8e-26) {
		tmp = -Math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
	} else {
		tmp = -1.0 * (Math.sqrt((F / B_m)) * Math.sqrt(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):
	t_0 = -4.0 * (A * C)
	tmp = 0
	if B_m <= 4.8e-26:
		tmp = -math.sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0
	else:
		tmp = -1.0 * (math.sqrt((F / B_m)) * math.sqrt(2.0))
	return tmp

Julia

B_m = abs(B)
A, B_m, C, F = sort([A, B_m, C, F])
function code(A, B_m, C, F)
	t_0 = Float64(-4.0 * Float64(A * C))
	tmp = 0.0
	if (B_m <= 4.8e-26)
		tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(2.0 * C)))) / t_0);
	else
		tmp = Float64(-1.0 * Float64(sqrt(Float64(F / B_m)) * sqrt(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)
	t_0 = -4.0 * (A * C);
	tmp = 0.0;
	if (B_m <= 4.8e-26)
		tmp = -sqrt(((2.0 * (t_0 * F)) * (2.0 * C))) / t_0;
	else
		tmp = -1.0 * (sqrt((F / B_m)) * sqrt(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_] := Block[{t$95$0 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[B$95$m, 4.8e-26], 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], N[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if B < 4.8000000000000002e-26

   1. Initial program 21.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. Taylor expanded in B around inf

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

   4. Applied rewrites 6.9%

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

   5. Taylor expanded in A around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 3.3

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

   7. Applied rewrites 3.3%

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

   8. Taylor expanded in A around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 3.1

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

   10. Applied rewrites 3.1%

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

   11. Taylor expanded in A around -inf

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

       1. lower-*.f64 42.7

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

   13. Applied rewrites 42.7%

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

   if 4.8000000000000002e-26 < B

   1. Initial program 16.8%

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

   2. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 42.8

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

   4. Applied rewrites 42.8%

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

Alternative 4: 34.4% 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} \mathbf{if}\;F \leq 10^{+26}:\\ \;\;\;\;F \cdot \left(-1 \cdot \left(\sqrt{\frac{1}{B\_m \cdot F}} \cdot \sqrt{2}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{F}{B\_m}} \cdot \sqrt{2}\right)\\ \end{array} \end{array} \]

FPCore

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

C

B_m = fabs(B);
assert(A < B_m && B_m < C && C < F);
double code(double A, double B_m, double C, double F) {
	double tmp;
	if (F <= 1e+26) {
		tmp = F * (-1.0 * (sqrt((1.0 / (B_m * F))) * sqrt(2.0)));
	} else {
		tmp = -1.0 * (sqrt((F / B_m)) * sqrt(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 <= 1d+26) then
        tmp = f * ((-1.0d0) * (sqrt((1.0d0 / (b_m * f))) * sqrt(2.0d0)))
    else
        tmp = (-1.0d0) * (sqrt((f / b_m)) * sqrt(2.0d0))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if F < 1.00000000000000005e26

   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. Taylor expanded in B around inf

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

      1. lower-fma.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lift-+.f64 17.4

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

   4. Applied rewrites 17.4%

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

   5. Taylor expanded in F around inf

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

      1. lower-*.f64 N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lift-sqrt.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-*.f64 N/A

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

   7. Applied rewrites 28.8%

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

   8. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. lift-sqrt.f64 N/A

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

      6. lift-*.f64 30.8

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

   10. Applied rewrites 30.8%

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

   if 1.00000000000000005e26 < F

   1. Initial program 13.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. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 39.8

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

   4. Applied rewrites 39.8%

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

Alternative 5: 27.5% accurate, 7.9× speedup

Math

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

FPCore

B_m = (fabs.f64 B)
NOTE: A, B_m, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B_m C F)
 :precision binary64
 (* -1.0 (* (sqrt (/ F B_m)) (sqrt 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 -1.0 * (sqrt((F / B_m)) * sqrt(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 = (-1.0d0) * (sqrt((f / b_m)) * sqrt(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 -1.0 * (Math.sqrt((F / B_m)) * Math.sqrt(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 -1.0 * (math.sqrt((F / B_m)) * math.sqrt(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(-1.0 * Float64(sqrt(Float64(F / B_m)) * sqrt(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 = -1.0 * (sqrt((F / B_m)) * sqrt(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[(-1.0 * N[(N[Sqrt[N[(F / B$95$m), $MachinePrecision]], $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

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. Taylor expanded in B around inf

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

   1. lower-*.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. lower-sqrt.f64 27.5

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

4. Applied rewrites 27.5%

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

Reproduce

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