ABCF->ab-angle b

Percentage Accurate: 18.5% → 36.9%

Time: 12.2s

Alternatives: 10

Speedup: 3.3×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 18.5% 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: 36.9% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

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

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

      1. lower--.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift-pow.f64 N/A

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

      6. lower-*.f64 32.5

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

   4. Applied rewrites 32.5%

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

   5. Taylor expanded in A around 0

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

      1. lower-fma.f64 N/A

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

      2. lift-pow.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lower-*.f64 32.5

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

   7. Applied rewrites 32.5%

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

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

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

   1. Initial program 6.4%

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

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

      2. lower-*.f64 6.3

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

   4. Applied rewrites 6.3%

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

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

      2. lower-*.f64 6.6

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

   7. Applied rewrites 6.6%

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

   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 \left(\left(A + C\right) - \color{blue}{A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 2.1%

       \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \color{blue}{A}\right)}}{-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 \left(\color{blue}{A} - A\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   12. Step-by-step derivation

   13. Applied rewrites 2.6%

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

   14. 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 \left(A - \color{blue}{-1 \cdot A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   15. Step-by-step derivation

       1. lift-*.f64 25.3

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

   16. Applied rewrites 25.3%

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

Alternative 2: 34.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
	double t_0 = -4.0 * (A * C);
	double t_1 = pow(B, 2.0) - ((4.0 * A) * C);
	double t_2 = 2.0 * (t_1 * F);
	double t_3 = pow((A - C), 2.0);
	double t_4 = -sqrt((t_2 * ((A + C) - sqrt((t_3 + pow(B, 2.0)))))) / t_1;
	double tmp;
	if (t_4 <= -2e+177) {
		tmp = -sqrt((t_2 * fma(-0.5, (pow(B, 2.0) / C), (2.0 * A)))) / t_1;
	} else if (t_4 <= -5e-151) {
		tmp = -1.0 * (sqrt(((F * ((A + C) - sqrt((pow(B, 2.0) + t_3)))) / (pow(B, 2.0) - (4.0 * (A * C))))) * sqrt(2.0));
	} else {
		tmp = -sqrt(((2.0 * (t_0 * F)) * (A - (-1.0 * A)))) / t_0;
	}
	return tmp;
}

Julia

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

Wolfram

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

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

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

      1. lower--.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift-pow.f64 N/A

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

      6. lower-*.f64 33.0

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

   4. Applied rewrites 33.0%

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

   5. Taylor expanded in A around 0

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

      1. lower-fma.f64 N/A

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

      2. lift-pow.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lower-*.f64 33.0

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

   7. Applied rewrites 33.0%

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

   if -2e177 < (/.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))) < -5.00000000000000003e-151

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

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 92.7%

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

   if -5.00000000000000003e-151 < (/.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 8.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(\color{blue}{\left(-4 \cdot \left(A \cdot C\right)\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. 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 \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. lower-*.f64 6.4

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

   4. Applied rewrites 6.4%

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

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

      2. lower-*.f64 6.7

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

   7. Applied rewrites 6.7%

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

   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 \left(\left(A + C\right) - \color{blue}{A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 2.1%

       \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \color{blue}{A}\right)}}{-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 \left(\color{blue}{A} - A\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   12. Step-by-step derivation

   13. Applied rewrites 2.6%

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

   14. 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 \left(A - \color{blue}{-1 \cdot A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   15. Step-by-step derivation

       1. lift-*.f64 25.0

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

   16. Applied rewrites 25.0%

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

Alternative 3: 34.1% accurate, 0.4× speedup

Math

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

FPCore

NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (* -4.0 (* A C)))
        (t_1 (- (pow B 2.0) (* (* 4.0 A) C)))
        (t_2 (* 2.0 (* t_1 F)))
        (t_3 (pow (- A C) 2.0))
        (t_4
         (/ (- (sqrt (* t_2 (- (+ A C) (sqrt (+ t_3 (pow B 2.0))))))) t_1)))
   (if (<= t_4 -2e+177)
     (/ (- (sqrt (* t_2 (* 2.0 A)))) t_1)
     (if (<= t_4 -5e-151)
       (*
        -1.0
        (*
         (sqrt
          (/
           (* F (- (+ A C) (sqrt (+ (pow B 2.0) t_3))))
           (- (pow B 2.0) (* 4.0 (* A C)))))
         (sqrt 2.0)))
       (/ (- (sqrt (* (* 2.0 (* t_0 F)) (- A (* -1.0 A))))) t_0)))))

C

assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
	double t_0 = -4.0 * (A * C);
	double t_1 = pow(B, 2.0) - ((4.0 * A) * C);
	double t_2 = 2.0 * (t_1 * F);
	double t_3 = pow((A - C), 2.0);
	double t_4 = -sqrt((t_2 * ((A + C) - sqrt((t_3 + pow(B, 2.0)))))) / t_1;
	double tmp;
	if (t_4 <= -2e+177) {
		tmp = -sqrt((t_2 * (2.0 * A))) / t_1;
	} else if (t_4 <= -5e-151) {
		tmp = -1.0 * (sqrt(((F * ((A + C) - sqrt((pow(B, 2.0) + t_3)))) / (pow(B, 2.0) - (4.0 * (A * C))))) * sqrt(2.0));
	} else {
		tmp = -sqrt(((2.0 * (t_0 * F)) * (A - (-1.0 * A)))) / t_0;
	}
	return tmp;
}

Fortran

NOTE: A, B, 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, 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
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: t_4
    real(8) :: tmp
    t_0 = (-4.0d0) * (a * c)
    t_1 = (b ** 2.0d0) - ((4.0d0 * a) * c)
    t_2 = 2.0d0 * (t_1 * f)
    t_3 = (a - c) ** 2.0d0
    t_4 = -sqrt((t_2 * ((a + c) - sqrt((t_3 + (b ** 2.0d0)))))) / t_1
    if (t_4 <= (-2d+177)) then
        tmp = -sqrt((t_2 * (2.0d0 * a))) / t_1
    else if (t_4 <= (-5d-151)) then
        tmp = (-1.0d0) * (sqrt(((f * ((a + c) - sqrt(((b ** 2.0d0) + t_3)))) / ((b ** 2.0d0) - (4.0d0 * (a * c))))) * sqrt(2.0d0))
    else
        tmp = -sqrt(((2.0d0 * (t_0 * f)) * (a - ((-1.0d0) * a)))) / t_0
    end if
    code = tmp
end function

Java

assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
	double t_0 = -4.0 * (A * C);
	double t_1 = Math.pow(B, 2.0) - ((4.0 * A) * C);
	double t_2 = 2.0 * (t_1 * F);
	double t_3 = Math.pow((A - C), 2.0);
	double t_4 = -Math.sqrt((t_2 * ((A + C) - Math.sqrt((t_3 + Math.pow(B, 2.0)))))) / t_1;
	double tmp;
	if (t_4 <= -2e+177) {
		tmp = -Math.sqrt((t_2 * (2.0 * A))) / t_1;
	} else if (t_4 <= -5e-151) {
		tmp = -1.0 * (Math.sqrt(((F * ((A + C) - Math.sqrt((Math.pow(B, 2.0) + t_3)))) / (Math.pow(B, 2.0) - (4.0 * (A * C))))) * Math.sqrt(2.0));
	} else {
		tmp = -Math.sqrt(((2.0 * (t_0 * F)) * (A - (-1.0 * A)))) / t_0;
	}
	return tmp;
}

Python

[A, B, C, F] = sort([A, B, C, F])
def code(A, B, C, F):
	t_0 = -4.0 * (A * C)
	t_1 = math.pow(B, 2.0) - ((4.0 * A) * C)
	t_2 = 2.0 * (t_1 * F)
	t_3 = math.pow((A - C), 2.0)
	t_4 = -math.sqrt((t_2 * ((A + C) - math.sqrt((t_3 + math.pow(B, 2.0)))))) / t_1
	tmp = 0
	if t_4 <= -2e+177:
		tmp = -math.sqrt((t_2 * (2.0 * A))) / t_1
	elif t_4 <= -5e-151:
		tmp = -1.0 * (math.sqrt(((F * ((A + C) - math.sqrt((math.pow(B, 2.0) + t_3)))) / (math.pow(B, 2.0) - (4.0 * (A * C))))) * math.sqrt(2.0))
	else:
		tmp = -math.sqrt(((2.0 * (t_0 * F)) * (A - (-1.0 * A)))) / t_0
	return tmp

Julia

A, B, C, F = sort([A, B, C, F])
function code(A, B, C, F)
	t_0 = Float64(-4.0 * Float64(A * C))
	t_1 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C))
	t_2 = Float64(2.0 * Float64(t_1 * F))
	t_3 = Float64(A - C) ^ 2.0
	t_4 = Float64(Float64(-sqrt(Float64(t_2 * Float64(Float64(A + C) - sqrt(Float64(t_3 + (B ^ 2.0))))))) / t_1)
	tmp = 0.0
	if (t_4 <= -2e+177)
		tmp = Float64(Float64(-sqrt(Float64(t_2 * Float64(2.0 * A)))) / t_1);
	elseif (t_4 <= -5e-151)
		tmp = Float64(-1.0 * Float64(sqrt(Float64(Float64(F * Float64(Float64(A + C) - sqrt(Float64((B ^ 2.0) + t_3)))) / Float64((B ^ 2.0) - Float64(4.0 * Float64(A * C))))) * sqrt(2.0)));
	else
		tmp = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(A - Float64(-1.0 * A))))) / t_0);
	end
	return tmp
end

MATLAB

A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp_2 = code(A, B, C, F)
	t_0 = -4.0 * (A * C);
	t_1 = (B ^ 2.0) - ((4.0 * A) * C);
	t_2 = 2.0 * (t_1 * F);
	t_3 = (A - C) ^ 2.0;
	t_4 = -sqrt((t_2 * ((A + C) - sqrt((t_3 + (B ^ 2.0)))))) / t_1;
	tmp = 0.0;
	if (t_4 <= -2e+177)
		tmp = -sqrt((t_2 * (2.0 * A))) / t_1;
	elseif (t_4 <= -5e-151)
		tmp = -1.0 * (sqrt(((F * ((A + C) - sqrt(((B ^ 2.0) + t_3)))) / ((B ^ 2.0) - (4.0 * (A * C))))) * sqrt(2.0));
	else
		tmp = -sqrt(((2.0 * (t_0 * F)) * (A - (-1.0 * A)))) / t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

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

      1. lower-*.f64 31.7

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

   4. Applied rewrites 31.7%

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

   if -2e177 < (/.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))) < -5.00000000000000003e-151

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

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

   4. Applied rewrites 92.7%

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

   if -5.00000000000000003e-151 < (/.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 8.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(\color{blue}{\left(-4 \cdot \left(A \cdot C\right)\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. 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 \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. lower-*.f64 6.4

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

   4. Applied rewrites 6.4%

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

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

      2. lower-*.f64 6.7

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

   7. Applied rewrites 6.7%

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

   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 \left(\left(A + C\right) - \color{blue}{A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 2.1%

       \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \color{blue}{A}\right)}}{-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 \left(\color{blue}{A} - A\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   12. Step-by-step derivation

   13. Applied rewrites 2.6%

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

   14. 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 \left(A - \color{blue}{-1 \cdot A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   15. Step-by-step derivation

       1. lift-*.f64 25.0

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

   16. Applied rewrites 25.0%

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

Alternative 4: 29.2% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: A, B, 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, 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
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_0 = (b ** 2.0d0) - ((4.0d0 * a) * c)
    t_1 = 2.0d0 * (t_0 * f)
    t_2 = -sqrt((t_1 * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_0
    t_3 = (-4.0d0) * (a * c)
    if (t_2 <= (-2d+59)) then
        tmp = -sqrt((t_1 * (2.0d0 * a))) / t_0
    else if (t_2 <= (-1d-216)) then
        tmp = (-1.0d0) * ((sqrt(2.0d0) / b) * sqrt((f * (a - sqrt(((a ** 2.0d0) + (b ** 2.0d0)))))))
    else
        tmp = -sqrt(((2.0d0 * (t_3 * f)) * (a - ((-1.0d0) * a)))) / t_3
    end if
    code = tmp
end function

Java

assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
	double t_0 = Math.pow(B, 2.0) - ((4.0 * A) * C);
	double t_1 = 2.0 * (t_0 * F);
	double t_2 = -Math.sqrt((t_1 * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_0;
	double t_3 = -4.0 * (A * C);
	double tmp;
	if (t_2 <= -2e+59) {
		tmp = -Math.sqrt((t_1 * (2.0 * A))) / t_0;
	} else if (t_2 <= -1e-216) {
		tmp = -1.0 * ((Math.sqrt(2.0) / B) * Math.sqrt((F * (A - Math.sqrt((Math.pow(A, 2.0) + Math.pow(B, 2.0)))))));
	} else {
		tmp = -Math.sqrt(((2.0 * (t_3 * F)) * (A - (-1.0 * A)))) / t_3;
	}
	return tmp;
}

Python

[A, B, C, F] = sort([A, B, C, F])
def code(A, B, C, F):
	t_0 = math.pow(B, 2.0) - ((4.0 * A) * C)
	t_1 = 2.0 * (t_0 * F)
	t_2 = -math.sqrt((t_1 * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_0
	t_3 = -4.0 * (A * C)
	tmp = 0
	if t_2 <= -2e+59:
		tmp = -math.sqrt((t_1 * (2.0 * A))) / t_0
	elif t_2 <= -1e-216:
		tmp = -1.0 * ((math.sqrt(2.0) / B) * math.sqrt((F * (A - math.sqrt((math.pow(A, 2.0) + math.pow(B, 2.0)))))))
	else:
		tmp = -math.sqrt(((2.0 * (t_3 * F)) * (A - (-1.0 * A)))) / t_3
	return tmp

Julia

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

MATLAB

A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp_2 = code(A, B, C, F)
	t_0 = (B ^ 2.0) - ((4.0 * A) * C);
	t_1 = 2.0 * (t_0 * F);
	t_2 = -sqrt((t_1 * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_0;
	t_3 = -4.0 * (A * C);
	tmp = 0.0;
	if (t_2 <= -2e+59)
		tmp = -sqrt((t_1 * (2.0 * A))) / t_0;
	elseif (t_2 <= -1e-216)
		tmp = -1.0 * ((sqrt(2.0) / B) * sqrt((F * (A - sqrt(((A ^ 2.0) + (B ^ 2.0)))))));
	else
		tmp = -sqrt(((2.0 * (t_3 * F)) * (A - (-1.0 * A)))) / t_3;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
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]}, Block[{t$95$1 = N[(2.0 * N[(t$95$0 * F), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[((-N[Sqrt[N[(t$95$1 * 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]}, Block[{t$95$3 = N[(-4.0 * N[(A * C), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -2e+59], N[((-N[Sqrt[N[(t$95$1 * N[(2.0 * A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$0), $MachinePrecision], If[LessEqual[t$95$2, -1e-216], N[(-1.0 * N[(N[(N[Sqrt[2.0], $MachinePrecision] / B), $MachinePrecision] * N[Sqrt[N[(F * N[(A - N[Sqrt[N[(N[Power[A, 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(A - N[(-1.0 * A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$3), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 20.0%

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

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

      1. lower-*.f64 35.5

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

   4. Applied rewrites 35.5%

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

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

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift-pow.f64 40.0

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

   4. Applied rewrites 40.0%

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

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

   1. Initial program 6.4%

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

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

      2. lower-*.f64 6.3

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

   4. Applied rewrites 6.3%

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

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

      2. lower-*.f64 6.6

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

   7. Applied rewrites 6.6%

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

   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 \left(\left(A + C\right) - \color{blue}{A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 2.1%

       \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \color{blue}{A}\right)}}{-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 \left(\color{blue}{A} - A\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   12. Step-by-step derivation

   13. Applied rewrites 2.6%

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

   14. 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 \left(A - \color{blue}{-1 \cdot A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   15. Step-by-step derivation

       1. lift-*.f64 25.3

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

   16. Applied rewrites 25.3%

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

Alternative 5: 28.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: A, B, 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, 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
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_0 = (-4.0d0) * (a * c)
    t_1 = (b ** 2.0d0) - ((4.0d0 * a) * c)
    t_2 = -sqrt(((2.0d0 * (t_1 * f)) * ((a + c) - sqrt((((a - c) ** 2.0d0) + (b ** 2.0d0)))))) / t_1
    t_3 = -sqrt(((2.0d0 * (t_0 * f)) * (a - ((-1.0d0) * a)))) / t_0
    if (t_2 <= (-1d+80)) then
        tmp = t_3
    else if (t_2 <= (-1d-216)) then
        tmp = (-1.0d0) * ((sqrt(2.0d0) / b) * sqrt((f * (a - sqrt(((a ** 2.0d0) + (b ** 2.0d0)))))))
    else
        tmp = t_3
    end if
    code = tmp
end function

Java

assert A < B && B < C && C < F;
public static double code(double A, double B, double C, double F) {
	double t_0 = -4.0 * (A * C);
	double t_1 = Math.pow(B, 2.0) - ((4.0 * A) * C);
	double t_2 = -Math.sqrt(((2.0 * (t_1 * F)) * ((A + C) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / t_1;
	double t_3 = -Math.sqrt(((2.0 * (t_0 * F)) * (A - (-1.0 * A)))) / t_0;
	double tmp;
	if (t_2 <= -1e+80) {
		tmp = t_3;
	} else if (t_2 <= -1e-216) {
		tmp = -1.0 * ((Math.sqrt(2.0) / B) * Math.sqrt((F * (A - Math.sqrt((Math.pow(A, 2.0) + Math.pow(B, 2.0)))))));
	} else {
		tmp = t_3;
	}
	return tmp;
}

Python

[A, B, C, F] = sort([A, B, C, F])
def code(A, B, C, F):
	t_0 = -4.0 * (A * C)
	t_1 = math.pow(B, 2.0) - ((4.0 * A) * C)
	t_2 = -math.sqrt(((2.0 * (t_1 * F)) * ((A + C) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / t_1
	t_3 = -math.sqrt(((2.0 * (t_0 * F)) * (A - (-1.0 * A)))) / t_0
	tmp = 0
	if t_2 <= -1e+80:
		tmp = t_3
	elif t_2 <= -1e-216:
		tmp = -1.0 * ((math.sqrt(2.0) / B) * math.sqrt((F * (A - math.sqrt((math.pow(A, 2.0) + math.pow(B, 2.0)))))))
	else:
		tmp = t_3
	return tmp

Julia

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

MATLAB

A, B, C, F = num2cell(sort([A, B, C, F])){:}
function tmp_2 = code(A, B, C, F)
	t_0 = -4.0 * (A * C);
	t_1 = (B ^ 2.0) - ((4.0 * A) * C);
	t_2 = -sqrt(((2.0 * (t_1 * F)) * ((A + C) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / t_1;
	t_3 = -sqrt(((2.0 * (t_0 * F)) * (A - (-1.0 * A)))) / t_0;
	tmp = 0.0;
	if (t_2 <= -1e+80)
		tmp = t_3;
	elseif (t_2 <= -1e-216)
		tmp = -1.0 * ((sqrt(2.0) / B) * sqrt((F * (A - sqrt(((A ^ 2.0) + (B ^ 2.0)))))));
	else
		tmp = t_3;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

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

      2. lower-*.f64 6.8

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

   4. Applied rewrites 6.8%

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

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

      2. lower-*.f64 6.9

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

   7. Applied rewrites 6.9%

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

   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 \left(\left(A + C\right) - \color{blue}{A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 1.9%

       \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \color{blue}{A}\right)}}{-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 \left(\color{blue}{A} - A\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   12. Step-by-step derivation

   13. Applied rewrites 2.6%

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

   14. 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 \left(A - \color{blue}{-1 \cdot A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   15. Step-by-step derivation

       1. lift-*.f64 26.8

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

   16. Applied rewrites 26.8%

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

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

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-sqrt.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower--.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-+.f64 N/A

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

      10. lower-pow.f64 N/A

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

      11. lift-pow.f64 38.8

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

   4. Applied rewrites 38.8%

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

Alternative 6: 26.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

assert(A < B && B < C && C < F);
double code(double A, double B, double C, double F) {
	double t_0 = -4.0 * (A * C);
	double t_1 = pow(B, 2.0) - ((4.0 * A) * C);
	double t_2 = -sqrt(((2.0 * (t_1 * F)) * ((A + C) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / t_1;
	double t_3 = -sqrt(((2.0 * (t_0 * F)) * (A - (-1.0 * A)))) / t_0;
	double tmp;
	if (t_2 <= -1e+80) {
		tmp = t_3;
	} else if (t_2 <= -5e-151) {
		tmp = -sqrt((-2.0 * (pow(B, 3.0) * F))) / fma(-4.0, (A * C), pow(B, 2.0));
	} else {
		tmp = t_3;
	}
	return tmp;
}

Julia

A, B, C, F = sort([A, B, C, F])
function code(A, B, C, F)
	t_0 = Float64(-4.0 * Float64(A * C))
	t_1 = Float64((B ^ 2.0) - Float64(Float64(4.0 * A) * C))
	t_2 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_1 * F)) * Float64(Float64(A + C) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0))))))) / t_1)
	t_3 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_0 * F)) * Float64(A - Float64(-1.0 * A))))) / t_0)
	tmp = 0.0
	if (t_2 <= -1e+80)
		tmp = t_3;
	elseif (t_2 <= -5e-151)
		tmp = Float64(Float64(-sqrt(Float64(-2.0 * Float64((B ^ 3.0) * F)))) / fma(-4.0, Float64(A * C), (B ^ 2.0)));
	else
		tmp = t_3;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (neg.f64 (sqrt.f64 (*.f64 (*.f64 #s(literal 2 binary64) (*.f64 (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C)) F)) (-.f64 (+.f64 A C) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64)))))))) (-.f64 (pow.f64 B #s(literal 2 binary64)) (*.f64 (*.f64 #s(literal 4 binary64) A) C))) < -1e80 or -5.00000000000000003e-151 < (/.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 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. 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 \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   3. 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 \left(\left(A + C\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]

      2. lower-*.f64 6.8

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

   4. Applied rewrites 6.8%

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

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

      2. lower-*.f64 7.0

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

   7. Applied rewrites 7.0%

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

   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 \left(\left(A + C\right) - \color{blue}{A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   9. Step-by-step derivation

   10. Applied rewrites 1.9%

       \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \color{blue}{A}\right)}}{-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 \left(\color{blue}{A} - A\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   12. Step-by-step derivation

   13. Applied rewrites 2.6%

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

   14. 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 \left(A - \color{blue}{-1 \cdot A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
   15. Step-by-step derivation

       1. lift-*.f64 26.5

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

   16. Applied rewrites 26.5%

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

   if -1e80 < (/.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))) < -5.00000000000000003e-151

   1. Initial program 97.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{\color{blue}{-2 \cdot \left({B}^{3} \cdot F\right)}}}{{B}^{2} - \left(4 \cdot A\right) \cdot C} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-pow.f64 25.5

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

   4. Applied rewrites 25.5%

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

   5. Taylor expanded in A around 0

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

      1. lower-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-pow.f64 25.5

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

   7. Applied rewrites 25.5%

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

Alternative 7: 26.3% accurate, 3.3× speedup

Math

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

FPCore

NOTE: A, B, C, and F should be sorted in increasing order before calling this function.
(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (* -4.0 (* A C))))
   (/ (- (sqrt (* (* 2.0 (* t_0 F)) (- A (* -1.0 A))))) t_0)))

C

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

Fortran

NOTE: A, B, 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, 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 = (-4.0d0) * (a * c)
    code = -sqrt(((2.0d0 * (t_0 * f)) * (a - ((-1.0d0) * a)))) / t_0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   2. lower-*.f64 8.3

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

4. Applied rewrites 8.3%

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

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

   2. lower-*.f64 8.3

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

7. Applied rewrites 8.3%

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

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 \left(\left(A + C\right) - \color{blue}{A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
9. Step-by-step derivation

10. Applied rewrites 2.0%

    \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \color{blue}{A}\right)}}{-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 \left(\color{blue}{A} - A\right)}}{-4 \cdot \left(A \cdot C\right)} \]
12. Step-by-step derivation

13. Applied rewrites 2.6%

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

14. 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 \left(A - \color{blue}{-1 \cdot A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
15. Step-by-step derivation

    1. lift-*.f64 26.3

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

16. Applied rewrites 26.3%

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

Alternative 8: 5.3% accurate, 3.6× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: A, B, 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, 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 = (-4.0d0) * (a * c)
    code = -sqrt(((2.0d0 * (t_0 * f)) * (a - b))) / t_0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   2. lower-*.f64 8.3

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

4. Applied rewrites 8.3%

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

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

   2. lower-*.f64 8.3

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

7. Applied rewrites 8.3%

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

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 \left(\left(A + C\right) - \color{blue}{A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
9. Step-by-step derivation

10. Applied rewrites 2.0%

    \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \color{blue}{A}\right)}}{-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 \left(\color{blue}{A} - A\right)}}{-4 \cdot \left(A \cdot C\right)} \]
12. Step-by-step derivation

13. Applied rewrites 2.6%

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

14. Taylor expanded in B around inf

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

16. Applied rewrites 5.3%

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

Alternative 9: 2.6% accurate, 3.6× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: A, B, 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, 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 = (-4.0d0) * (a * c)
    code = -sqrt(((2.0d0 * (t_0 * f)) * (a - a))) / t_0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

   2. lower-*.f64 8.3

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

4. Applied rewrites 8.3%

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

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

   2. lower-*.f64 8.3

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

7. Applied rewrites 8.3%

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

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 \left(\left(A + C\right) - \color{blue}{A}\right)}}{-4 \cdot \left(A \cdot C\right)} \]
9. Step-by-step derivation

10. Applied rewrites 2.0%

    \[\leadsto \frac{-\sqrt{\left(2 \cdot \left(\left(-4 \cdot \left(A \cdot C\right)\right) \cdot F\right)\right) \cdot \left(\left(A + C\right) - \color{blue}{A}\right)}}{-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 \left(\color{blue}{A} - A\right)}}{-4 \cdot \left(A \cdot C\right)} \]
12. Step-by-step derivation

13. Applied rewrites 2.6%

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

Alternative 10: 0.0% accurate, 5.9× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: A, B, 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, 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
    code = (-1.0d0) * (sqrt((f / c)) * (sqrt((-0.5d0)) * sqrt(2.0d0)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

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

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

   1. lower-*.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. lower-*.f64 N/A

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

   6. lower-sqrt.f64 N/A

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

   7. lower-sqrt.f64 0.0

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

4. Applied rewrites 0.0%

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

Reproduce

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