ABCF->ab-angle b

Percentage Accurate: 19.3% → 61.2%

Time: 8.8s

Alternatives: 11

Speedup: 9.7×

Specification

Math

\[\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} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 19.3% accurate, 1.0× speedup

Math

\[\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} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 61.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} t_0 := \left|B\right| \cdot \left|B\right|\\ t_1 := \left(F + F\right) \cdot \mathsf{fma}\left(\mathsf{max}\left(A, C\right) \cdot -4, \mathsf{min}\left(A, C\right), t\_0\right)\\ t_2 := \mathsf{max}\left(A, C\right) - \mathsf{min}\left(A, C\right)\\ t_3 := {\left(\left|B\right|\right)}^{2}\\ t_4 := t\_3 - \left(4 \cdot \mathsf{min}\left(A, C\right)\right) \cdot \mathsf{max}\left(A, C\right)\\ t_5 := \frac{-\sqrt{\left(2 \cdot \left(t\_4 \cdot F\right)\right) \cdot \left(\left(\mathsf{min}\left(A, C\right) + \mathsf{max}\left(A, C\right)\right) - \sqrt{{\left(\mathsf{min}\left(A, C\right) - \mathsf{max}\left(A, C\right)\right)}^{2} + t\_3}\right)}}{t\_4}\\ \mathbf{if}\;t\_5 \leq -\infty:\\ \;\;\;\;\frac{-0.25}{\frac{\mathsf{max}\left(A, C\right)}{\sqrt{-16 \cdot F} \cdot \sqrt{\mathsf{max}\left(A, C\right)}}}\\ \mathbf{elif}\;t\_5 \leq -1 \cdot 10^{-184}:\\ \;\;\;\;\frac{-\sqrt{\mathsf{fma}\left(t\_1, \mathsf{max}\left(A, C\right), t\_1 \cdot \left(\mathsf{min}\left(A, C\right) - \sqrt{\mathsf{fma}\left(t\_2, t\_2, t\_0\right)}\right)\right)}}{t\_4}\\ \mathbf{elif}\;t\_5 \leq 0:\\ \;\;\;\;-0.25 \cdot \sqrt{-16 \cdot \frac{F}{\mathsf{max}\left(A, C\right)}}\\ \mathbf{elif}\;t\_5 \leq \infty:\\ \;\;\;\;-0.25 \cdot \frac{\sqrt{-16 \cdot \mathsf{max}\left(A, C\right)} \cdot \sqrt{F}}{\mathsf{max}\left(A, C\right)}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{-2 \cdot F} \cdot \sqrt{\frac{1}{\left|B\right|}}\\ \end{array} \]

FPCore

(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (* (fabs B) (fabs B)))
        (t_1 (* (+ F F) (fma (* (fmax A C) -4.0) (fmin A C) t_0)))
        (t_2 (- (fmax A C) (fmin A C)))
        (t_3 (pow (fabs B) 2.0))
        (t_4 (- t_3 (* (* 4.0 (fmin A C)) (fmax A C))))
        (t_5
         (/
          (-
           (sqrt
            (*
             (* 2.0 (* t_4 F))
             (-
              (+ (fmin A C) (fmax A C))
              (sqrt (+ (pow (- (fmin A C) (fmax A C)) 2.0) t_3))))))
          t_4)))
   (if (<= t_5 (- INFINITY))
     (/ -0.25 (/ (fmax A C) (* (sqrt (* -16.0 F)) (sqrt (fmax A C)))))
     (if (<= t_5 -1e-184)
       (/
        (-
         (sqrt
          (fma
           t_1
           (fmax A C)
           (* t_1 (- (fmin A C) (sqrt (fma t_2 t_2 t_0)))))))
        t_4)
       (if (<= t_5 0.0)
         (* -0.25 (sqrt (* -16.0 (/ F (fmax A C)))))
         (if (<= t_5 INFINITY)
           (* -0.25 (/ (* (sqrt (* -16.0 (fmax A C))) (sqrt F)) (fmax A C)))
           (- (* (sqrt (* -2.0 F)) (sqrt (/ 1.0 (fabs B)))))))))))

C

double code(double A, double B, double C, double F) {
	double t_0 = fabs(B) * fabs(B);
	double t_1 = (F + F) * fma((fmax(A, C) * -4.0), fmin(A, C), t_0);
	double t_2 = fmax(A, C) - fmin(A, C);
	double t_3 = pow(fabs(B), 2.0);
	double t_4 = t_3 - ((4.0 * fmin(A, C)) * fmax(A, C));
	double t_5 = -sqrt(((2.0 * (t_4 * F)) * ((fmin(A, C) + fmax(A, C)) - sqrt((pow((fmin(A, C) - fmax(A, C)), 2.0) + t_3))))) / t_4;
	double tmp;
	if (t_5 <= -((double) INFINITY)) {
		tmp = -0.25 / (fmax(A, C) / (sqrt((-16.0 * F)) * sqrt(fmax(A, C))));
	} else if (t_5 <= -1e-184) {
		tmp = -sqrt(fma(t_1, fmax(A, C), (t_1 * (fmin(A, C) - sqrt(fma(t_2, t_2, t_0)))))) / t_4;
	} else if (t_5 <= 0.0) {
		tmp = -0.25 * sqrt((-16.0 * (F / fmax(A, C))));
	} else if (t_5 <= ((double) INFINITY)) {
		tmp = -0.25 * ((sqrt((-16.0 * fmax(A, C))) * sqrt(F)) / fmax(A, C));
	} else {
		tmp = -(sqrt((-2.0 * F)) * sqrt((1.0 / fabs(B))));
	}
	return tmp;
}

Julia

function code(A, B, C, F)
	t_0 = Float64(abs(B) * abs(B))
	t_1 = Float64(Float64(F + F) * fma(Float64(fmax(A, C) * -4.0), fmin(A, C), t_0))
	t_2 = Float64(fmax(A, C) - fmin(A, C))
	t_3 = abs(B) ^ 2.0
	t_4 = Float64(t_3 - Float64(Float64(4.0 * fmin(A, C)) * fmax(A, C)))
	t_5 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_4 * F)) * Float64(Float64(fmin(A, C) + fmax(A, C)) - sqrt(Float64((Float64(fmin(A, C) - fmax(A, C)) ^ 2.0) + t_3)))))) / t_4)
	tmp = 0.0
	if (t_5 <= Float64(-Inf))
		tmp = Float64(-0.25 / Float64(fmax(A, C) / Float64(sqrt(Float64(-16.0 * F)) * sqrt(fmax(A, C)))));
	elseif (t_5 <= -1e-184)
		tmp = Float64(Float64(-sqrt(fma(t_1, fmax(A, C), Float64(t_1 * Float64(fmin(A, C) - sqrt(fma(t_2, t_2, t_0))))))) / t_4);
	elseif (t_5 <= 0.0)
		tmp = Float64(-0.25 * sqrt(Float64(-16.0 * Float64(F / fmax(A, C)))));
	elseif (t_5 <= Inf)
		tmp = Float64(-0.25 * Float64(Float64(sqrt(Float64(-16.0 * fmax(A, C))) * sqrt(F)) / fmax(A, C)));
	else
		tmp = Float64(-Float64(sqrt(Float64(-2.0 * F)) * sqrt(Float64(1.0 / abs(B)))));
	end
	return tmp
end

Wolfram

code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Abs[B], $MachinePrecision] * N[Abs[B], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(F + F), $MachinePrecision] * N[(N[(N[Max[A, C], $MachinePrecision] * -4.0), $MachinePrecision] * N[Min[A, C], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Max[A, C], $MachinePrecision] - N[Min[A, C], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Power[N[Abs[B], $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 - N[(N[(4.0 * N[Min[A, C], $MachinePrecision]), $MachinePrecision] * N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$4 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(N[Min[A, C], $MachinePrecision] + N[Max[A, C], $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(N[Min[A, C], $MachinePrecision] - N[Max[A, C], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + t$95$3), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$4), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], N[(-0.25 / N[(N[Max[A, C], $MachinePrecision] / N[(N[Sqrt[N[(-16.0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Max[A, C], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, -1e-184], N[((-N[Sqrt[N[(t$95$1 * N[Max[A, C], $MachinePrecision] + N[(t$95$1 * N[(N[Min[A, C], $MachinePrecision] - N[Sqrt[N[(t$95$2 * t$95$2 + t$95$0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$4), $MachinePrecision], If[LessEqual[t$95$5, 0.0], N[(-0.25 * N[Sqrt[N[(-16.0 * N[(F / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], N[(-0.25 * N[(N[(N[Sqrt[N[(-16.0 * N[Max[A, C], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(-2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / N[Abs[B], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]]]]]]]

Derivation

1. Split input into 5 regimes

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

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

      \[\leadsto \color{blue}{-0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. div-flip N/A

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

      5. lower-unsound-/.f64 N/A

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

      6. lower-unsound-/.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 19.0%

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 19.0%

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 19.0%

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

   6. Applied rewrites 19.0%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/r* N/A

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

      5. div-flip-rev N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 19.0%

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 19.0%

          \[\leadsto \frac{-0.25}{\frac{C}{\sqrt{-16 \cdot \left(F \cdot C\right)}}} \]

   8. Applied rewrites 19.0%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

         \[\leadsto \frac{\frac{-1}{4}}{\frac{C}{\sqrt{-16 \cdot F} \cdot \color{blue}{\sqrt{C}}}} \]

      6. lower-unsound-*.f64 N/A

         \[\leadsto \frac{\frac{-1}{4}}{\frac{C}{\sqrt{-16 \cdot F} \cdot \color{blue}{\sqrt{C}}}} \]

      7. lower-unsound-sqrt.f64 N/A

         \[\leadsto \frac{\frac{-1}{4}}{\frac{C}{\sqrt{-16 \cdot F} \cdot \sqrt{\color{blue}{C}}}} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{\frac{-1}{4}}{\frac{C}{\sqrt{-16 \cdot F} \cdot \sqrt{C}}} \]

      9. lower-unsound-sqrt.f64 17.8%

         \[\leadsto \frac{-0.25}{\frac{C}{\sqrt{-16 \cdot F} \cdot \sqrt{C}}} \]

   10. Applied rewrites 17.8%

       \[\leadsto \frac{-0.25}{\frac{C}{\sqrt{-16 \cdot F} \cdot \color{blue}{\sqrt{C}}}} \]

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

   1. Initial program 19.3%

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

   3. Applied rewrites 19.7%

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

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

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

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

   5. Taylor expanded in C around inf

      \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]
   6. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      3. lower-/.f64 14.5%

         \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

   7. Applied rewrites 14.5%

      \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

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

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

      \[\leadsto \color{blue}{-0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C}} \]
   5. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

         \[\leadsto \frac{-1}{4} \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

      6. lower-unsound-*.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

      7. lower-unsound-sqrt.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

      9. lower-unsound-sqrt.f64 6.5%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

   6. Applied rewrites 6.5%

      \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

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

   1. Initial program 19.3%

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

   2. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 13.9%

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

   4. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 13.9%

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 13.9%

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

   6. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 13.9%

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

   8. Applied rewrites 13.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. mult-flip N/A

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

      6. sqrt-prod N/A

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

      7. lower-unsound-*.f64 N/A

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

      8. lower-unsound-sqrt.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-unsound-sqrt.f64 N/A

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

      12. lower-/.f64 17.2%

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

   10. Applied rewrites 17.2%

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

Alternative 2: 61.0% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (- (fmax A C) (fmin A C)))
        (t_1 (* (fabs B) (fabs B)))
        (t_2 (pow (fabs B) 2.0))
        (t_3 (- t_2 (* (* 4.0 (fmin A C)) (fmax A C))))
        (t_4
         (/
          (-
           (sqrt
            (*
             (* 2.0 (* t_3 F))
             (-
              (+ (fmin A C) (fmax A C))
              (sqrt (+ (pow (- (fmin A C) (fmax A C)) 2.0) t_2))))))
          t_3)))
   (if (<= t_4 (- INFINITY))
     (/ -0.25 (/ (fmax A C) (* (sqrt (* -16.0 F)) (sqrt (fmax A C)))))
     (if (<= t_4 -1e-184)
       (/
        (sqrt
         (*
          (* (- (+ (fmax A C) (fmin A C)) (sqrt (fma t_0 t_0 t_1))) (+ F F))
          (fma (* (fmax A C) -4.0) (fmin A C) t_1)))
        (- (* (* (fmax A C) (fmin A C)) 4.0) t_1))
       (if (<= t_4 0.0)
         (* -0.25 (sqrt (* -16.0 (/ F (fmax A C)))))
         (if (<= t_4 INFINITY)
           (* -0.25 (/ (* (sqrt (* -16.0 (fmax A C))) (sqrt F)) (fmax A C)))
           (- (* (sqrt (* -2.0 F)) (sqrt (/ 1.0 (fabs B)))))))))))

C

double code(double A, double B, double C, double F) {
	double t_0 = fmax(A, C) - fmin(A, C);
	double t_1 = fabs(B) * fabs(B);
	double t_2 = pow(fabs(B), 2.0);
	double t_3 = t_2 - ((4.0 * fmin(A, C)) * fmax(A, C));
	double t_4 = -sqrt(((2.0 * (t_3 * F)) * ((fmin(A, C) + fmax(A, C)) - sqrt((pow((fmin(A, C) - fmax(A, C)), 2.0) + t_2))))) / t_3;
	double tmp;
	if (t_4 <= -((double) INFINITY)) {
		tmp = -0.25 / (fmax(A, C) / (sqrt((-16.0 * F)) * sqrt(fmax(A, C))));
	} else if (t_4 <= -1e-184) {
		tmp = sqrt(((((fmax(A, C) + fmin(A, C)) - sqrt(fma(t_0, t_0, t_1))) * (F + F)) * fma((fmax(A, C) * -4.0), fmin(A, C), t_1))) / (((fmax(A, C) * fmin(A, C)) * 4.0) - t_1);
	} else if (t_4 <= 0.0) {
		tmp = -0.25 * sqrt((-16.0 * (F / fmax(A, C))));
	} else if (t_4 <= ((double) INFINITY)) {
		tmp = -0.25 * ((sqrt((-16.0 * fmax(A, C))) * sqrt(F)) / fmax(A, C));
	} else {
		tmp = -(sqrt((-2.0 * F)) * sqrt((1.0 / fabs(B))));
	}
	return tmp;
}

Julia

function code(A, B, C, F)
	t_0 = Float64(fmax(A, C) - fmin(A, C))
	t_1 = Float64(abs(B) * abs(B))
	t_2 = abs(B) ^ 2.0
	t_3 = Float64(t_2 - Float64(Float64(4.0 * fmin(A, C)) * fmax(A, C)))
	t_4 = Float64(Float64(-sqrt(Float64(Float64(2.0 * Float64(t_3 * F)) * Float64(Float64(fmin(A, C) + fmax(A, C)) - sqrt(Float64((Float64(fmin(A, C) - fmax(A, C)) ^ 2.0) + t_2)))))) / t_3)
	tmp = 0.0
	if (t_4 <= Float64(-Inf))
		tmp = Float64(-0.25 / Float64(fmax(A, C) / Float64(sqrt(Float64(-16.0 * F)) * sqrt(fmax(A, C)))));
	elseif (t_4 <= -1e-184)
		tmp = Float64(sqrt(Float64(Float64(Float64(Float64(fmax(A, C) + fmin(A, C)) - sqrt(fma(t_0, t_0, t_1))) * Float64(F + F)) * fma(Float64(fmax(A, C) * -4.0), fmin(A, C), t_1))) / Float64(Float64(Float64(fmax(A, C) * fmin(A, C)) * 4.0) - t_1));
	elseif (t_4 <= 0.0)
		tmp = Float64(-0.25 * sqrt(Float64(-16.0 * Float64(F / fmax(A, C)))));
	elseif (t_4 <= Inf)
		tmp = Float64(-0.25 * Float64(Float64(sqrt(Float64(-16.0 * fmax(A, C))) * sqrt(F)) / fmax(A, C)));
	else
		tmp = Float64(-Float64(sqrt(Float64(-2.0 * F)) * sqrt(Float64(1.0 / abs(B)))));
	end
	return tmp
end

Wolfram

code[A_, B_, C_, F_] := Block[{t$95$0 = N[(N[Max[A, C], $MachinePrecision] - N[Min[A, C], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Abs[B], $MachinePrecision] * N[Abs[B], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Power[N[Abs[B], $MachinePrecision], 2.0], $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[(N[(4.0 * N[Min[A, C], $MachinePrecision]), $MachinePrecision] * N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[((-N[Sqrt[N[(N[(2.0 * N[(t$95$3 * F), $MachinePrecision]), $MachinePrecision] * N[(N[(N[Min[A, C], $MachinePrecision] + N[Max[A, C], $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(N[Min[A, C], $MachinePrecision] - N[Max[A, C], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + t$95$2), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]) / t$95$3), $MachinePrecision]}, If[LessEqual[t$95$4, (-Infinity)], N[(-0.25 / N[(N[Max[A, C], $MachinePrecision] / N[(N[Sqrt[N[(-16.0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Max[A, C], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, -1e-184], N[(N[Sqrt[N[(N[(N[(N[(N[Max[A, C], $MachinePrecision] + N[Min[A, C], $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(t$95$0 * t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(F + F), $MachinePrecision]), $MachinePrecision] * N[(N[(N[Max[A, C], $MachinePrecision] * -4.0), $MachinePrecision] * N[Min[A, C], $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(N[(N[(N[Max[A, C], $MachinePrecision] * N[Min[A, C], $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, 0.0], N[(-0.25 * N[Sqrt[N[(-16.0 * N[(F / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$4, Infinity], N[(-0.25 * N[(N[(N[Sqrt[N[(-16.0 * N[Max[A, C], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[F], $MachinePrecision]), $MachinePrecision] / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(-2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / N[Abs[B], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]]]]]]]]]

Derivation

1. Split input into 5 regimes

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

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

      \[\leadsto \color{blue}{-0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. div-flip N/A

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

      5. lower-unsound-/.f64 N/A

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

      6. lower-unsound-/.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 19.0%

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 19.0%

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 19.0%

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

   6. Applied rewrites 19.0%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/r* N/A

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

      5. div-flip-rev N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 19.0%

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 19.0%

          \[\leadsto \frac{-0.25}{\frac{C}{\sqrt{-16 \cdot \left(F \cdot C\right)}}} \]

   8. Applied rewrites 19.0%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

         \[\leadsto \frac{\frac{-1}{4}}{\frac{C}{\sqrt{-16 \cdot F} \cdot \color{blue}{\sqrt{C}}}} \]

      6. lower-unsound-*.f64 N/A

         \[\leadsto \frac{\frac{-1}{4}}{\frac{C}{\sqrt{-16 \cdot F} \cdot \color{blue}{\sqrt{C}}}} \]

      7. lower-unsound-sqrt.f64 N/A

         \[\leadsto \frac{\frac{-1}{4}}{\frac{C}{\sqrt{-16 \cdot F} \cdot \sqrt{\color{blue}{C}}}} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{\frac{-1}{4}}{\frac{C}{\sqrt{-16 \cdot F} \cdot \sqrt{C}}} \]

      9. lower-unsound-sqrt.f64 17.8%

         \[\leadsto \frac{-0.25}{\frac{C}{\sqrt{-16 \cdot F} \cdot \sqrt{C}}} \]

   10. Applied rewrites 17.8%

       \[\leadsto \frac{-0.25}{\frac{C}{\sqrt{-16 \cdot F} \cdot \color{blue}{\sqrt{C}}}} \]

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

   1. Initial program 19.3%

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

   3. Applied rewrites 19.4%

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

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

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

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

   5. Taylor expanded in C around inf

      \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]
   6. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      3. lower-/.f64 14.5%

         \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

   7. Applied rewrites 14.5%

      \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

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

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

      \[\leadsto \color{blue}{-0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C}} \]
   5. Step-by-step derivation

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*r* N/A

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

      5. sqrt-prod N/A

         \[\leadsto \frac{-1}{4} \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

      6. lower-unsound-*.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

      7. lower-unsound-sqrt.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

      9. lower-unsound-sqrt.f64 6.5%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

   6. Applied rewrites 6.5%

      \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot C} \cdot \sqrt{F}}{C} \]

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

   1. Initial program 19.3%

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

   2. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 13.9%

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

   4. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 13.9%

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 13.9%

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

   6. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 13.9%

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

   8. Applied rewrites 13.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. mult-flip N/A

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

      6. sqrt-prod N/A

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

      7. lower-unsound-*.f64 N/A

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

      8. lower-unsound-sqrt.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-unsound-sqrt.f64 N/A

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

      12. lower-/.f64 17.2%

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

   10. Applied rewrites 17.2%

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

Alternative 3: 56.0% accurate, 4.3× speedup

Math

\[\begin{array}{l} \mathbf{if}\;\left|B\right| \leq 10^{+69}:\\ \;\;\;\;-0.25 \cdot \frac{\sqrt{-16 \cdot \left(\mathsf{max}\left(A, C\right) \cdot F\right)}}{\mathsf{max}\left(A, C\right)}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{-2 \cdot F} \cdot \sqrt{\frac{1}{\left|B\right|}}\\ \end{array} \]

FPCore

(FPCore (A B C F)
 :precision binary64
 (if (<= (fabs B) 1e+69)
   (* -0.25 (/ (sqrt (* -16.0 (* (fmax A C) F))) (fmax A C)))
   (- (* (sqrt (* -2.0 F)) (sqrt (/ 1.0 (fabs B)))))))

C

double code(double A, double B, double C, double F) {
	double tmp;
	if (fabs(B) <= 1e+69) {
		tmp = -0.25 * (sqrt((-16.0 * (fmax(A, C) * F))) / fmax(A, C));
	} else {
		tmp = -(sqrt((-2.0 * F)) * sqrt((1.0 / fabs(B))));
	}
	return tmp;
}

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) :: tmp
    if (abs(b) <= 1d+69) then
        tmp = (-0.25d0) * (sqrt(((-16.0d0) * (fmax(a, c) * f))) / fmax(a, c))
    else
        tmp = -(sqrt(((-2.0d0) * f)) * sqrt((1.0d0 / abs(b))))
    end if
    code = tmp
end function

Java

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

Python

def code(A, B, C, F):
	tmp = 0
	if math.fabs(B) <= 1e+69:
		tmp = -0.25 * (math.sqrt((-16.0 * (fmax(A, C) * F))) / fmax(A, C))
	else:
		tmp = -(math.sqrt((-2.0 * F)) * math.sqrt((1.0 / math.fabs(B))))
	return tmp

Julia

function code(A, B, C, F)
	tmp = 0.0
	if (abs(B) <= 1e+69)
		tmp = Float64(-0.25 * Float64(sqrt(Float64(-16.0 * Float64(fmax(A, C) * F))) / fmax(A, C)));
	else
		tmp = Float64(-Float64(sqrt(Float64(-2.0 * F)) * sqrt(Float64(1.0 / abs(B)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C, F)
	tmp = 0.0;
	if (abs(B) <= 1e+69)
		tmp = -0.25 * (sqrt((-16.0 * (max(A, C) * F))) / max(A, C));
	else
		tmp = -(sqrt((-2.0 * F)) * sqrt((1.0 / abs(B))));
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_, F_] := If[LessEqual[N[Abs[B], $MachinePrecision], 1e+69], N[(-0.25 * N[(N[Sqrt[N[(-16.0 * N[(N[Max[A, C], $MachinePrecision] * F), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-N[(N[Sqrt[N[(-2.0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / N[Abs[B], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if B < 1.0000000000000001e69

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

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

   if 1.0000000000000001e69 < B

   1. Initial program 19.3%

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

   2. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 13.9%

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

   4. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 13.9%

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 13.9%

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

   6. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 13.9%

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

   8. Applied rewrites 13.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. mult-flip N/A

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

      6. sqrt-prod N/A

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

      7. lower-unsound-*.f64 N/A

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

      8. lower-unsound-sqrt.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-unsound-sqrt.f64 N/A

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

      12. lower-/.f64 17.2%

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

   10. Applied rewrites 17.2%

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

Alternative 4: 46.9% accurate, 3.9× speedup

Math

\[\begin{array}{l} t_0 := \sqrt{-16 \cdot \frac{F}{\mathsf{max}\left(A, C\right)}}\\ \mathbf{if}\;\mathsf{max}\left(A, C\right) \leq -1.7 \cdot 10^{-106}:\\ \;\;\;\;0.25 \cdot t\_0\\ \mathbf{elif}\;\mathsf{max}\left(A, C\right) \leq 1.4 \cdot 10^{-65}:\\ \;\;\;\;-\frac{\sqrt{\left|F\right| \cdot 2}}{\sqrt{\left|B\right|}}\\ \mathbf{else}:\\ \;\;\;\;-0.25 \cdot t\_0\\ \end{array} \]

FPCore

(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (sqrt (* -16.0 (/ F (fmax A C))))))
   (if (<= (fmax A C) -1.7e-106)
     (* 0.25 t_0)
     (if (<= (fmax A C) 1.4e-65)
       (- (/ (sqrt (* (fabs F) 2.0)) (sqrt (fabs B))))
       (* -0.25 t_0)))))

C

double code(double A, double B, double C, double F) {
	double t_0 = sqrt((-16.0 * (F / fmax(A, C))));
	double tmp;
	if (fmax(A, C) <= -1.7e-106) {
		tmp = 0.25 * t_0;
	} else if (fmax(A, C) <= 1.4e-65) {
		tmp = -(sqrt((fabs(F) * 2.0)) / sqrt(fabs(B)));
	} else {
		tmp = -0.25 * t_0;
	}
	return tmp;
}

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
    real(8) :: tmp
    t_0 = sqrt(((-16.0d0) * (f / fmax(a, c))))
    if (fmax(a, c) <= (-1.7d-106)) then
        tmp = 0.25d0 * t_0
    else if (fmax(a, c) <= 1.4d-65) then
        tmp = -(sqrt((abs(f) * 2.0d0)) / sqrt(abs(b)))
    else
        tmp = (-0.25d0) * t_0
    end if
    code = tmp
end function

Java

public static double code(double A, double B, double C, double F) {
	double t_0 = Math.sqrt((-16.0 * (F / fmax(A, C))));
	double tmp;
	if (fmax(A, C) <= -1.7e-106) {
		tmp = 0.25 * t_0;
	} else if (fmax(A, C) <= 1.4e-65) {
		tmp = -(Math.sqrt((Math.abs(F) * 2.0)) / Math.sqrt(Math.abs(B)));
	} else {
		tmp = -0.25 * t_0;
	}
	return tmp;
}

Python

def code(A, B, C, F):
	t_0 = math.sqrt((-16.0 * (F / fmax(A, C))))
	tmp = 0
	if fmax(A, C) <= -1.7e-106:
		tmp = 0.25 * t_0
	elif fmax(A, C) <= 1.4e-65:
		tmp = -(math.sqrt((math.fabs(F) * 2.0)) / math.sqrt(math.fabs(B)))
	else:
		tmp = -0.25 * t_0
	return tmp

Julia

function code(A, B, C, F)
	t_0 = sqrt(Float64(-16.0 * Float64(F / fmax(A, C))))
	tmp = 0.0
	if (fmax(A, C) <= -1.7e-106)
		tmp = Float64(0.25 * t_0);
	elseif (fmax(A, C) <= 1.4e-65)
		tmp = Float64(-Float64(sqrt(Float64(abs(F) * 2.0)) / sqrt(abs(B))));
	else
		tmp = Float64(-0.25 * t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C, F)
	t_0 = sqrt((-16.0 * (F / max(A, C))));
	tmp = 0.0;
	if (max(A, C) <= -1.7e-106)
		tmp = 0.25 * t_0;
	elseif (max(A, C) <= 1.4e-65)
		tmp = -(sqrt((abs(F) * 2.0)) / sqrt(abs(B)));
	else
		tmp = -0.25 * t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(-16.0 * N[(F / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Max[A, C], $MachinePrecision], -1.7e-106], N[(0.25 * t$95$0), $MachinePrecision], If[LessEqual[N[Max[A, C], $MachinePrecision], 1.4e-65], (-N[(N[Sqrt[N[(N[Abs[F], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[Abs[B], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), N[(-0.25 * t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if C < -1.6999999999999999e-106

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

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

   5. Taylor expanded in C around -inf

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\sqrt{-16 \cdot \frac{F}{C}}} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      4. lower-/.f64 11.5%

         \[\leadsto 0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

   7. Applied rewrites 11.5%

      \[\leadsto 0.25 \cdot \color{blue}{\sqrt{-16 \cdot \frac{F}{C}}} \]

   if -1.6999999999999999e-106 < C < 1.4e-65

   1. Initial program 19.3%

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

   2. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 13.9%

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

   4. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 13.9%

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 13.9%

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

   6. Applied rewrites 13.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. sqrt-fabs-rev N/A

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

      6. lift-sqrt.f64 N/A

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

      7. rem-sqrt-square-rev N/A

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

      8. lift-sqrt.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. lift-sqrt.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lift-*.f64 N/A

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

      16. sqrt-unprod N/A

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

      17. rem-sqrt-square N/A

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

      18. lift-*.f64 N/A

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

      19. lift-/.f64 N/A

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

      20. associate-*l/ N/A

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

      21. fabs-div N/A

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

      22. *-commutative N/A

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

   8. Applied rewrites 35.5%

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

   if 1.4e-65 < C

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

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

   5. Taylor expanded in C around inf

      \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]
   6. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      3. lower-/.f64 14.5%

         \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

   7. Applied rewrites 14.5%

      \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 46.9% accurate, 3.9× speedup

Math

\[\begin{array}{l} t_0 := \sqrt{-16 \cdot \frac{F}{\mathsf{max}\left(A, C\right)}}\\ \mathbf{if}\;\mathsf{max}\left(A, C\right) \leq -1.7 \cdot 10^{-106}:\\ \;\;\;\;0.25 \cdot t\_0\\ \mathbf{elif}\;\mathsf{max}\left(A, C\right) \leq 1.4 \cdot 10^{-65}:\\ \;\;\;\;-\frac{\sqrt{-2 \cdot F}}{\sqrt{\left|B\right|}}\\ \mathbf{else}:\\ \;\;\;\;-0.25 \cdot t\_0\\ \end{array} \]

FPCore

(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (sqrt (* -16.0 (/ F (fmax A C))))))
   (if (<= (fmax A C) -1.7e-106)
     (* 0.25 t_0)
     (if (<= (fmax A C) 1.4e-65)
       (- (/ (sqrt (* -2.0 F)) (sqrt (fabs B))))
       (* -0.25 t_0)))))

C

double code(double A, double B, double C, double F) {
	double t_0 = sqrt((-16.0 * (F / fmax(A, C))));
	double tmp;
	if (fmax(A, C) <= -1.7e-106) {
		tmp = 0.25 * t_0;
	} else if (fmax(A, C) <= 1.4e-65) {
		tmp = -(sqrt((-2.0 * F)) / sqrt(fabs(B)));
	} else {
		tmp = -0.25 * t_0;
	}
	return tmp;
}

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
    real(8) :: tmp
    t_0 = sqrt(((-16.0d0) * (f / fmax(a, c))))
    if (fmax(a, c) <= (-1.7d-106)) then
        tmp = 0.25d0 * t_0
    else if (fmax(a, c) <= 1.4d-65) then
        tmp = -(sqrt(((-2.0d0) * f)) / sqrt(abs(b)))
    else
        tmp = (-0.25d0) * t_0
    end if
    code = tmp
end function

Java

public static double code(double A, double B, double C, double F) {
	double t_0 = Math.sqrt((-16.0 * (F / fmax(A, C))));
	double tmp;
	if (fmax(A, C) <= -1.7e-106) {
		tmp = 0.25 * t_0;
	} else if (fmax(A, C) <= 1.4e-65) {
		tmp = -(Math.sqrt((-2.0 * F)) / Math.sqrt(Math.abs(B)));
	} else {
		tmp = -0.25 * t_0;
	}
	return tmp;
}

Python

def code(A, B, C, F):
	t_0 = math.sqrt((-16.0 * (F / fmax(A, C))))
	tmp = 0
	if fmax(A, C) <= -1.7e-106:
		tmp = 0.25 * t_0
	elif fmax(A, C) <= 1.4e-65:
		tmp = -(math.sqrt((-2.0 * F)) / math.sqrt(math.fabs(B)))
	else:
		tmp = -0.25 * t_0
	return tmp

Julia

function code(A, B, C, F)
	t_0 = sqrt(Float64(-16.0 * Float64(F / fmax(A, C))))
	tmp = 0.0
	if (fmax(A, C) <= -1.7e-106)
		tmp = Float64(0.25 * t_0);
	elseif (fmax(A, C) <= 1.4e-65)
		tmp = Float64(-Float64(sqrt(Float64(-2.0 * F)) / sqrt(abs(B))));
	else
		tmp = Float64(-0.25 * t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C, F)
	t_0 = sqrt((-16.0 * (F / max(A, C))));
	tmp = 0.0;
	if (max(A, C) <= -1.7e-106)
		tmp = 0.25 * t_0;
	elseif (max(A, C) <= 1.4e-65)
		tmp = -(sqrt((-2.0 * F)) / sqrt(abs(B)));
	else
		tmp = -0.25 * t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_, F_] := Block[{t$95$0 = N[Sqrt[N[(-16.0 * N[(F / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[Max[A, C], $MachinePrecision], -1.7e-106], N[(0.25 * t$95$0), $MachinePrecision], If[LessEqual[N[Max[A, C], $MachinePrecision], 1.4e-65], (-N[(N[Sqrt[N[(-2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[Abs[B], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), N[(-0.25 * t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if C < -1.6999999999999999e-106

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

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

   5. Taylor expanded in C around -inf

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\sqrt{-16 \cdot \frac{F}{C}}} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      4. lower-/.f64 11.5%

         \[\leadsto 0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

   7. Applied rewrites 11.5%

      \[\leadsto 0.25 \cdot \color{blue}{\sqrt{-16 \cdot \frac{F}{C}}} \]

   if -1.6999999999999999e-106 < C < 1.4e-65

   1. Initial program 19.3%

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

   2. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 13.9%

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

   4. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 13.9%

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 13.9%

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

   6. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 13.9%

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

   8. Applied rewrites 13.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. sqrt-div N/A

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

      6. lower-unsound-/.f64 N/A

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

      7. lower-unsound-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-unsound-sqrt.f64 17.2%

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

   10. Applied rewrites 17.2%

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

   if 1.4e-65 < C

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

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

   5. Taylor expanded in C around inf

      \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]
   6. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      3. lower-/.f64 14.5%

         \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

   7. Applied rewrites 14.5%

      \[\leadsto -0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 44.8% accurate, 5.8× speedup

Math

\[\begin{array}{l} \mathbf{if}\;F \leq -1.04 \cdot 10^{-305}:\\ \;\;\;\;-\frac{\sqrt{-2 \cdot F}}{\sqrt{\left|B\right|}}\\ \mathbf{else}:\\ \;\;\;\;0.25 \cdot \sqrt{-16 \cdot \frac{F}{\mathsf{max}\left(A, C\right)}}\\ \end{array} \]

FPCore

(FPCore (A B C F)
 :precision binary64
 (if (<= F -1.04e-305)
   (- (/ (sqrt (* -2.0 F)) (sqrt (fabs B))))
   (* 0.25 (sqrt (* -16.0 (/ F (fmax A C)))))))

C

double code(double A, double B, double C, double F) {
	double tmp;
	if (F <= -1.04e-305) {
		tmp = -(sqrt((-2.0 * F)) / sqrt(fabs(B)));
	} else {
		tmp = 0.25 * sqrt((-16.0 * (F / fmax(A, C))));
	}
	return tmp;
}

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) :: tmp
    if (f <= (-1.04d-305)) then
        tmp = -(sqrt(((-2.0d0) * f)) / sqrt(abs(b)))
    else
        tmp = 0.25d0 * sqrt(((-16.0d0) * (f / fmax(a, c))))
    end if
    code = tmp
end function

Java

public static double code(double A, double B, double C, double F) {
	double tmp;
	if (F <= -1.04e-305) {
		tmp = -(Math.sqrt((-2.0 * F)) / Math.sqrt(Math.abs(B)));
	} else {
		tmp = 0.25 * Math.sqrt((-16.0 * (F / fmax(A, C))));
	}
	return tmp;
}

Python

def code(A, B, C, F):
	tmp = 0
	if F <= -1.04e-305:
		tmp = -(math.sqrt((-2.0 * F)) / math.sqrt(math.fabs(B)))
	else:
		tmp = 0.25 * math.sqrt((-16.0 * (F / fmax(A, C))))
	return tmp

Julia

function code(A, B, C, F)
	tmp = 0.0
	if (F <= -1.04e-305)
		tmp = Float64(-Float64(sqrt(Float64(-2.0 * F)) / sqrt(abs(B))));
	else
		tmp = Float64(0.25 * sqrt(Float64(-16.0 * Float64(F / fmax(A, C)))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C, F)
	tmp = 0.0;
	if (F <= -1.04e-305)
		tmp = -(sqrt((-2.0 * F)) / sqrt(abs(B)));
	else
		tmp = 0.25 * sqrt((-16.0 * (F / max(A, C))));
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_, F_] := If[LessEqual[F, -1.04e-305], (-N[(N[Sqrt[N[(-2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[Abs[B], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), N[(0.25 * N[Sqrt[N[(-16.0 * N[(F / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if F < -1.04e-305

   1. Initial program 19.3%

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

   2. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 13.9%

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

   4. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 13.9%

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 13.9%

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

   6. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 13.9%

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

   8. Applied rewrites 13.9%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. sqrt-div N/A

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

      6. lower-unsound-/.f64 N/A

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

      7. lower-unsound-sqrt.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-unsound-sqrt.f64 17.2%

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

   10. Applied rewrites 17.2%

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

   if -1.04e-305 < F

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

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

   5. Taylor expanded in C around -inf

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\sqrt{-16 \cdot \frac{F}{C}}} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      4. lower-/.f64 11.5%

         \[\leadsto 0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

   7. Applied rewrites 11.5%

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

Alternative 7: 39.2% accurate, 3.1× speedup

Math

\[\begin{array}{l} \mathbf{if}\;{B}^{2} \leq 2 \cdot 10^{-123}:\\ \;\;\;\;0.25 \cdot \sqrt{-16 \cdot \frac{F}{\mathsf{max}\left(A, C\right)}}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\left|\frac{F}{B}\right| \cdot 2}\\ \end{array} \]

FPCore

(FPCore (A B C F)
 :precision binary64
 (if (<= (pow B 2.0) 2e-123)
   (* 0.25 (sqrt (* -16.0 (/ F (fmax A C)))))
   (- (sqrt (* (fabs (/ F B)) 2.0)))))

C

double code(double A, double B, double C, double F) {
	double tmp;
	if (pow(B, 2.0) <= 2e-123) {
		tmp = 0.25 * sqrt((-16.0 * (F / fmax(A, C))));
	} else {
		tmp = -sqrt((fabs((F / B)) * 2.0));
	}
	return tmp;
}

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) :: tmp
    if ((b ** 2.0d0) <= 2d-123) then
        tmp = 0.25d0 * sqrt(((-16.0d0) * (f / fmax(a, c))))
    else
        tmp = -sqrt((abs((f / b)) * 2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double A, double B, double C, double F) {
	double tmp;
	if (Math.pow(B, 2.0) <= 2e-123) {
		tmp = 0.25 * Math.sqrt((-16.0 * (F / fmax(A, C))));
	} else {
		tmp = -Math.sqrt((Math.abs((F / B)) * 2.0));
	}
	return tmp;
}

Python

def code(A, B, C, F):
	tmp = 0
	if math.pow(B, 2.0) <= 2e-123:
		tmp = 0.25 * math.sqrt((-16.0 * (F / fmax(A, C))))
	else:
		tmp = -math.sqrt((math.fabs((F / B)) * 2.0))
	return tmp

Julia

function code(A, B, C, F)
	tmp = 0.0
	if ((B ^ 2.0) <= 2e-123)
		tmp = Float64(0.25 * sqrt(Float64(-16.0 * Float64(F / fmax(A, C)))));
	else
		tmp = Float64(-sqrt(Float64(abs(Float64(F / B)) * 2.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C, F)
	tmp = 0.0;
	if ((B ^ 2.0) <= 2e-123)
		tmp = 0.25 * sqrt((-16.0 * (F / max(A, C))));
	else
		tmp = -sqrt((abs((F / B)) * 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_, F_] := If[LessEqual[N[Power[B, 2.0], $MachinePrecision], 2e-123], N[(0.25 * N[Sqrt[N[(-16.0 * N[(F / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[Abs[N[(F / B), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 B #s(literal 2 binary64)) < 2.0000000000000001e-123

   1. Initial program 19.3%

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

   2. Taylor expanded in A around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 19.0%

         \[\leadsto -0.25 \cdot \frac{\sqrt{-16 \cdot \left(C \cdot F\right)}}{C} \]

   4. Applied rewrites 19.0%

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

   5. Taylor expanded in C around -inf

      \[\leadsto \frac{1}{4} \cdot \color{blue}{\sqrt{-16 \cdot \frac{F}{C}}} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      3. lower-*.f64 N/A

         \[\leadsto \frac{1}{4} \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

      4. lower-/.f64 11.5%

         \[\leadsto 0.25 \cdot \sqrt{-16 \cdot \frac{F}{C}} \]

   7. Applied rewrites 11.5%

      \[\leadsto 0.25 \cdot \color{blue}{\sqrt{-16 \cdot \frac{F}{C}}} \]

   if 2.0000000000000001e-123 < (pow.f64 B #s(literal 2 binary64))

   1. Initial program 19.3%

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

   2. Taylor expanded in B around inf

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

      1. lower-*.f64 N/A

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

      2. lower-sqrt.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 13.9%

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

   4. Applied rewrites 13.9%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 13.9%

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 13.9%

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

   6. Applied rewrites 13.9%

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

      1. rem-square-sqrt N/A

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

      2. sqrt-unprod N/A

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

      3. rem-sqrt-square N/A

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

      4. lift-*.f64 N/A

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

      5. fabs-mul N/A

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

      6. metadata-eval N/A

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

      7. lower-*.f64 N/A

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

      8. lower-fabs.f64 27.5%

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

   8. Applied rewrites 27.5%

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

Alternative 8: 27.5% accurate, 9.7× speedup

Math

\[-\sqrt{\left|\frac{F}{B}\right| \cdot 2} \]

FPCore

(FPCore (A B C F) :precision binary64 (- (sqrt (* (fabs (/ F B)) 2.0))))

C

double code(double A, double B, double C, double F) {
	return -sqrt((fabs((F / B)) * 2.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
    code = -sqrt((abs((f / b)) * 2.0d0))
end function

Java

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

Python

def code(A, B, C, F):
	return -math.sqrt((math.fabs((F / B)) * 2.0))

Julia

function code(A, B, C, F)
	return Float64(-sqrt(Float64(abs(Float64(F / B)) * 2.0)))
end

MATLAB

function tmp = code(A, B, C, F)
	tmp = -sqrt((abs((F / B)) * 2.0));
end

Wolfram

code[A_, B_, C_, F_] := (-N[Sqrt[N[(N[Abs[N[(F / B), $MachinePrecision]], $MachinePrecision] * 2.0), $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 19.3%

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

2. Taylor expanded in B around inf

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

   1. lower-*.f64 N/A

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

   2. lower-sqrt.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 13.9%

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

4. Applied rewrites 13.9%

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

   1. lift-*.f64 N/A

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

   2. mul-1-neg N/A

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

   3. lower-neg.f64 13.9%

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 13.9%

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

6. Applied rewrites 13.9%

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

   1. rem-square-sqrt N/A

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

   2. sqrt-unprod N/A

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

   3. rem-sqrt-square N/A

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

   4. lift-*.f64 N/A

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

   5. fabs-mul N/A

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

   6. metadata-eval N/A

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

   7. lower-*.f64 N/A

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

   8. lower-fabs.f64 27.5%

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

8. Applied rewrites 27.5%

   \[\leadsto -\sqrt{\left|\frac{F}{B}\right| \cdot 2} \]
9. Add Preprocessing

Alternative 9: 27.5% accurate, 9.7× speedup

Math

\[-\sqrt{\left|\frac{-2}{B} \cdot F\right|} \]

FPCore

(FPCore (A B C F) :precision binary64 (- (sqrt (fabs (* (/ -2.0 B) F)))))

C

double code(double A, double B, double C, double F) {
	return -sqrt(fabs(((-2.0 / B) * F)));
}

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
    code = -sqrt(abs((((-2.0d0) / b) * f)))
end function

Java

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

Python

def code(A, B, C, F):
	return -math.sqrt(math.fabs(((-2.0 / B) * F)))

Julia

function code(A, B, C, F)
	return Float64(-sqrt(abs(Float64(Float64(-2.0 / B) * F))))
end

MATLAB

function tmp = code(A, B, C, F)
	tmp = -sqrt(abs(((-2.0 / B) * F)));
end

Wolfram

code[A_, B_, C_, F_] := (-N[Sqrt[N[Abs[N[(N[(-2.0 / B), $MachinePrecision] * F), $MachinePrecision]], $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 19.3%

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

2. Taylor expanded in B around inf

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

   1. lower-*.f64 N/A

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

   2. lower-sqrt.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 13.9%

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

4. Applied rewrites 13.9%

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

   1. lift-*.f64 N/A

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

   2. mul-1-neg N/A

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

   3. lower-neg.f64 13.9%

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 13.9%

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

6. Applied rewrites 13.9%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. associate-*l/ N/A

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

   4. associate-/l* N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 13.9%

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

8. Applied rewrites 13.9%

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

   1. rem-square-sqrt N/A

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

   2. lift-sqrt.f64 N/A

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

   3. lift-sqrt.f64 N/A

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

   4. sqr-abs-rev N/A

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

   5. mul-fabs N/A

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

   6. lift-sqrt.f64 N/A

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

   7. lift-sqrt.f64 N/A

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

   8. rem-square-sqrt N/A

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

   9. lower-fabs.f64 27.5%

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

   10. lift-*.f64 N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 27.5%

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

10. Applied rewrites 27.5%

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

Alternative 10: 27.4% accurate, 9.7× speedup

Math

\[-\sqrt{\frac{F}{\left|B\right|} \cdot -2} \]

FPCore

(FPCore (A B C F) :precision binary64 (- (sqrt (* (/ F (fabs B)) -2.0))))

C

double code(double A, double B, double C, double F) {
	return -sqrt(((F / fabs(B)) * -2.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
    code = -sqrt(((f / abs(b)) * (-2.0d0)))
end function

Java

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

Python

def code(A, B, C, F):
	return -math.sqrt(((F / math.fabs(B)) * -2.0))

Julia

function code(A, B, C, F)
	return Float64(-sqrt(Float64(Float64(F / abs(B)) * -2.0)))
end

MATLAB

function tmp = code(A, B, C, F)
	tmp = -sqrt(((F / abs(B)) * -2.0));
end

Wolfram

code[A_, B_, C_, F_] := (-N[Sqrt[N[(N[(F / N[Abs[B], $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 19.3%

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

2. Taylor expanded in B around inf

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

   1. lower-*.f64 N/A

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

   2. lower-sqrt.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 13.9%

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

4. Applied rewrites 13.9%

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

   1. lift-*.f64 N/A

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

   2. mul-1-neg N/A

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

   3. lower-neg.f64 13.9%

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 13.9%

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

6. Applied rewrites 13.9%

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

Alternative 11: 27.4% accurate, 9.7× speedup

Math

\[-\sqrt{F \cdot \frac{-2}{\left|B\right|}} \]

FPCore

(FPCore (A B C F) :precision binary64 (- (sqrt (* F (/ -2.0 (fabs B))))))

C

double code(double A, double B, double C, double F) {
	return -sqrt((F * (-2.0 / fabs(B))));
}

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
    code = -sqrt((f * ((-2.0d0) / abs(b))))
end function

Java

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

Python

def code(A, B, C, F):
	return -math.sqrt((F * (-2.0 / math.fabs(B))))

Julia

function code(A, B, C, F)
	return Float64(-sqrt(Float64(F * Float64(-2.0 / abs(B)))))
end

MATLAB

function tmp = code(A, B, C, F)
	tmp = -sqrt((F * (-2.0 / abs(B))));
end

Wolfram

code[A_, B_, C_, F_] := (-N[Sqrt[N[(F * N[(-2.0 / N[Abs[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 19.3%

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

2. Taylor expanded in B around inf

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

   1. lower-*.f64 N/A

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

   2. lower-sqrt.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 13.9%

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

4. Applied rewrites 13.9%

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

   1. lift-*.f64 N/A

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

   2. mul-1-neg N/A

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

   3. lower-neg.f64 13.9%

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 13.9%

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

6. Applied rewrites 13.9%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. associate-*l/ N/A

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

   4. associate-/l* N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 13.9%

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

8. Applied rewrites 13.9%

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

Reproduce

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