ABCF->ab-angle b

Percentage Accurate: 18.7% → 55.3%

Time: 8.7s

Alternatives: 10

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: 18.7% 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: 55.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} t_0 := \left|B\right| \cdot \left|B\right|\\ t_1 := \mathsf{max}\left(A, C\right) - \mathsf{min}\left(A, C\right)\\ \mathbf{if}\;\left|B\right| \leq 2.75 \cdot 10^{-129}:\\ \;\;\;\;-0.25 \cdot \frac{\sqrt{-16 \cdot \left(\mathsf{max}\left(A, C\right) \cdot F\right)}}{\mathsf{max}\left(A, C\right)}\\ \mathbf{elif}\;\left|B\right| \leq 1.1 \cdot 10^{-47}:\\ \;\;\;\;-0.25 \cdot \frac{\sqrt{-16 \cdot F} \cdot \sqrt{\mathsf{max}\left(A, C\right)}}{\mathsf{max}\left(A, C\right)}\\ \mathbf{elif}\;\left|B\right| \leq 1.6 \cdot 10^{+78}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot \mathsf{min}\left(A, C\right), \mathsf{max}\left(A, C\right), t\_0\right)} \cdot \sqrt{\left(F + F\right) \cdot \left(\mathsf{max}\left(A, C\right) - \left(\sqrt{\mathsf{fma}\left(t\_1, t\_1, t\_0\right)} - \mathsf{min}\left(A, C\right)\right)\right)}}{\left(\mathsf{max}\left(A, C\right) \cdot \mathsf{min}\left(A, C\right)\right) \cdot 4 - t\_0}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{\left|B\right|}} \cdot \left(-\sqrt{-2 \cdot F}\right)\\ \end{array} \]

FPCore

(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (* (fabs B) (fabs B))) (t_1 (- (fmax A C) (fmin A C))))
   (if (<= (fabs B) 2.75e-129)
     (* -0.25 (/ (sqrt (* -16.0 (* (fmax A C) F))) (fmax A C)))
     (if (<= (fabs B) 1.1e-47)
       (* -0.25 (/ (* (sqrt (* -16.0 F)) (sqrt (fmax A C))) (fmax A C)))
       (if (<= (fabs B) 1.6e+78)
         (/
          (*
           (sqrt (fma (* -4.0 (fmin A C)) (fmax A C) t_0))
           (sqrt
            (*
             (+ F F)
             (- (fmax A C) (- (sqrt (fma t_1 t_1 t_0)) (fmin A C))))))
          (- (* (* (fmax A C) (fmin A C)) 4.0) t_0))
         (* (sqrt (/ 1.0 (fabs B))) (- (sqrt (* -2.0 F)))))))))

C

double code(double A, double B, double C, double F) {
	double t_0 = fabs(B) * fabs(B);
	double t_1 = fmax(A, C) - fmin(A, C);
	double tmp;
	if (fabs(B) <= 2.75e-129) {
		tmp = -0.25 * (sqrt((-16.0 * (fmax(A, C) * F))) / fmax(A, C));
	} else if (fabs(B) <= 1.1e-47) {
		tmp = -0.25 * ((sqrt((-16.0 * F)) * sqrt(fmax(A, C))) / fmax(A, C));
	} else if (fabs(B) <= 1.6e+78) {
		tmp = (sqrt(fma((-4.0 * fmin(A, C)), fmax(A, C), t_0)) * sqrt(((F + F) * (fmax(A, C) - (sqrt(fma(t_1, t_1, t_0)) - fmin(A, C)))))) / (((fmax(A, C) * fmin(A, C)) * 4.0) - t_0);
	} else {
		tmp = sqrt((1.0 / fabs(B))) * -sqrt((-2.0 * F));
	}
	return tmp;
}

Julia

function code(A, B, C, F)
	t_0 = Float64(abs(B) * abs(B))
	t_1 = Float64(fmax(A, C) - fmin(A, C))
	tmp = 0.0
	if (abs(B) <= 2.75e-129)
		tmp = Float64(-0.25 * Float64(sqrt(Float64(-16.0 * Float64(fmax(A, C) * F))) / fmax(A, C)));
	elseif (abs(B) <= 1.1e-47)
		tmp = Float64(-0.25 * Float64(Float64(sqrt(Float64(-16.0 * F)) * sqrt(fmax(A, C))) / fmax(A, C)));
	elseif (abs(B) <= 1.6e+78)
		tmp = Float64(Float64(sqrt(fma(Float64(-4.0 * fmin(A, C)), fmax(A, C), t_0)) * sqrt(Float64(Float64(F + F) * Float64(fmax(A, C) - Float64(sqrt(fma(t_1, t_1, t_0)) - fmin(A, C)))))) / Float64(Float64(Float64(fmax(A, C) * fmin(A, C)) * 4.0) - t_0));
	else
		tmp = Float64(sqrt(Float64(1.0 / abs(B))) * Float64(-sqrt(Float64(-2.0 * F))));
	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[Max[A, C], $MachinePrecision] - N[Min[A, C], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Abs[B], $MachinePrecision], 2.75e-129], 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], If[LessEqual[N[Abs[B], $MachinePrecision], 1.1e-47], N[(-0.25 * N[(N[(N[Sqrt[N[(-16.0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Max[A, C], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Abs[B], $MachinePrecision], 1.6e+78], N[(N[(N[Sqrt[N[(N[(-4.0 * N[Min[A, C], $MachinePrecision]), $MachinePrecision] * N[Max[A, C], $MachinePrecision] + t$95$0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(N[(F + F), $MachinePrecision] * N[(N[Max[A, C], $MachinePrecision] - N[(N[Sqrt[N[(t$95$1 * t$95$1 + t$95$0), $MachinePrecision]], $MachinePrecision] - N[Min[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(N[Max[A, C], $MachinePrecision] * N[Min[A, C], $MachinePrecision]), $MachinePrecision] * 4.0), $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[(1.0 / N[Abs[B], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (-N[Sqrt[N[(-2.0 * F), $MachinePrecision]], $MachinePrecision])), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if B < 2.75000000000000012e-129

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

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

   if 2.75000000000000012e-129 < B < 1.10000000000000009e-47

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

      \[\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. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

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

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

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

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

      9. lower-*.f64 N/A

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

      10. lower-unsound-sqrt.f64 18.2%

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

   6. Applied rewrites 18.2%

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

   if 1.10000000000000009e-47 < B < 1.59999999999999997e78

   1. Initial program 18.7%

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

   3. Applied rewrites 19.1%

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

   5. Applied rewrites 20.0%

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

   if 1.59999999999999997e78 < B

   1. Initial program 18.7%

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

   2. Taylor expanded in B around inf

      \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

   4. Applied rewrites 14.6%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. mult-flip N/A

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

      6. sqrt-prod N/A

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

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

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

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

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

      9. lower-*.f64 N/A

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

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

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

      11. lower-/.f64 18.4%

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

   6. Applied rewrites 18.4%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. distribute-rgt-neg-in N/A

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

      6. lower-*.f64 N/A

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

      7. lower-neg.f64 18.4%

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

   8. Applied rewrites 18.4%

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

Alternative 2: 54.1% accurate, 3.3× speedup

Math

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

FPCore

(FPCore (A B C F)
 :precision binary64
 (if (<= (fabs B) 2.75e-129)
   (* -0.25 (/ (sqrt (* -16.0 (* (fmax A C) F))) (fmax A C)))
   (if (<= (fabs B) 1.1e-47)
     (* -0.25 (/ (* (sqrt (* -16.0 F)) (sqrt (fmax A C))) (fmax A C)))
     (* -1.0 (/ (sqrt (* -2.0 F)) (sqrt (fabs B)))))))

C

double code(double A, double B, double C, double F) {
	double tmp;
	if (fabs(B) <= 2.75e-129) {
		tmp = -0.25 * (sqrt((-16.0 * (fmax(A, C) * F))) / fmax(A, C));
	} else if (fabs(B) <= 1.1e-47) {
		tmp = -0.25 * ((sqrt((-16.0 * F)) * sqrt(fmax(A, C))) / fmax(A, C));
	} else {
		tmp = -1.0 * (sqrt((-2.0 * F)) / sqrt(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) <= 2.75d-129) then
        tmp = (-0.25d0) * (sqrt(((-16.0d0) * (fmax(a, c) * f))) / fmax(a, c))
    else if (abs(b) <= 1.1d-47) then
        tmp = (-0.25d0) * ((sqrt(((-16.0d0) * f)) * sqrt(fmax(a, c))) / fmax(a, c))
    else
        tmp = (-1.0d0) * (sqrt(((-2.0d0) * f)) / sqrt(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) <= 2.75e-129) {
		tmp = -0.25 * (Math.sqrt((-16.0 * (fmax(A, C) * F))) / fmax(A, C));
	} else if (Math.abs(B) <= 1.1e-47) {
		tmp = -0.25 * ((Math.sqrt((-16.0 * F)) * Math.sqrt(fmax(A, C))) / fmax(A, C));
	} else {
		tmp = -1.0 * (Math.sqrt((-2.0 * F)) / Math.sqrt(Math.abs(B)));
	}
	return tmp;
}

Python

def code(A, B, C, F):
	tmp = 0
	if math.fabs(B) <= 2.75e-129:
		tmp = -0.25 * (math.sqrt((-16.0 * (fmax(A, C) * F))) / fmax(A, C))
	elif math.fabs(B) <= 1.1e-47:
		tmp = -0.25 * ((math.sqrt((-16.0 * F)) * math.sqrt(fmax(A, C))) / fmax(A, C))
	else:
		tmp = -1.0 * (math.sqrt((-2.0 * F)) / math.sqrt(math.fabs(B)))
	return tmp

Julia

function code(A, B, C, F)
	tmp = 0.0
	if (abs(B) <= 2.75e-129)
		tmp = Float64(-0.25 * Float64(sqrt(Float64(-16.0 * Float64(fmax(A, C) * F))) / fmax(A, C)));
	elseif (abs(B) <= 1.1e-47)
		tmp = Float64(-0.25 * Float64(Float64(sqrt(Float64(-16.0 * F)) * sqrt(fmax(A, C))) / fmax(A, C)));
	else
		tmp = Float64(-1.0 * Float64(sqrt(Float64(-2.0 * F)) / sqrt(abs(B))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C, F)
	tmp = 0.0;
	if (abs(B) <= 2.75e-129)
		tmp = -0.25 * (sqrt((-16.0 * (max(A, C) * F))) / max(A, C));
	elseif (abs(B) <= 1.1e-47)
		tmp = -0.25 * ((sqrt((-16.0 * F)) * sqrt(max(A, C))) / max(A, C));
	else
		tmp = -1.0 * (sqrt((-2.0 * F)) / sqrt(abs(B)));
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_, F_] := If[LessEqual[N[Abs[B], $MachinePrecision], 2.75e-129], 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], If[LessEqual[N[Abs[B], $MachinePrecision], 1.1e-47], N[(-0.25 * N[(N[(N[Sqrt[N[(-16.0 * F), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Max[A, C], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[Sqrt[N[(-2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[Abs[B], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if B < 2.75000000000000012e-129

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

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

   if 2.75000000000000012e-129 < B < 1.10000000000000009e-47

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

      \[\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. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. sqrt-prod N/A

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

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

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

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

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

      9. lower-*.f64 N/A

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

      10. lower-unsound-sqrt.f64 18.2%

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

   6. Applied rewrites 18.2%

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

   if 1.10000000000000009e-47 < B

   1. Initial program 18.7%

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

   2. Taylor expanded in B around inf

      \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

   4. Applied rewrites 14.6%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. sqrt-div N/A

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

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

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

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

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

      8. lower-*.f64 N/A

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

      9. lower-unsound-sqrt.f64 18.4%

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

   6. Applied rewrites 18.4%

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

Alternative 3: 53.0% accurate, 4.2× speedup

Math

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

FPCore

(FPCore (A B C F)
 :precision binary64
 (if (<= (fabs B) 1.45e-127)
   (* -0.25 (/ (sqrt (* -16.0 (* (fmax A C) F))) (fmax A C)))
   (if (<= (fabs B) 1.1e-47)
     (* -0.25 (sqrt (* -16.0 (/ F (fmax A C)))))
     (* -1.0 (/ (sqrt (* -2.0 F)) (sqrt (fabs B)))))))

C

double code(double A, double B, double C, double F) {
	double tmp;
	if (fabs(B) <= 1.45e-127) {
		tmp = -0.25 * (sqrt((-16.0 * (fmax(A, C) * F))) / fmax(A, C));
	} else if (fabs(B) <= 1.1e-47) {
		tmp = -0.25 * sqrt((-16.0 * (F / fmax(A, C))));
	} else {
		tmp = -1.0 * (sqrt((-2.0 * F)) / sqrt(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) <= 1.45d-127) then
        tmp = (-0.25d0) * (sqrt(((-16.0d0) * (fmax(a, c) * f))) / fmax(a, c))
    else if (abs(b) <= 1.1d-47) then
        tmp = (-0.25d0) * sqrt(((-16.0d0) * (f / fmax(a, c))))
    else
        tmp = (-1.0d0) * (sqrt(((-2.0d0) * f)) / sqrt(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) <= 1.45e-127) {
		tmp = -0.25 * (Math.sqrt((-16.0 * (fmax(A, C) * F))) / fmax(A, C));
	} else if (Math.abs(B) <= 1.1e-47) {
		tmp = -0.25 * Math.sqrt((-16.0 * (F / fmax(A, C))));
	} else {
		tmp = -1.0 * (Math.sqrt((-2.0 * F)) / Math.sqrt(Math.abs(B)));
	}
	return tmp;
}

Python

def code(A, B, C, F):
	tmp = 0
	if math.fabs(B) <= 1.45e-127:
		tmp = -0.25 * (math.sqrt((-16.0 * (fmax(A, C) * F))) / fmax(A, C))
	elif math.fabs(B) <= 1.1e-47:
		tmp = -0.25 * math.sqrt((-16.0 * (F / fmax(A, C))))
	else:
		tmp = -1.0 * (math.sqrt((-2.0 * F)) / math.sqrt(math.fabs(B)))
	return tmp

Julia

function code(A, B, C, F)
	tmp = 0.0
	if (abs(B) <= 1.45e-127)
		tmp = Float64(-0.25 * Float64(sqrt(Float64(-16.0 * Float64(fmax(A, C) * F))) / fmax(A, C)));
	elseif (abs(B) <= 1.1e-47)
		tmp = Float64(-0.25 * sqrt(Float64(-16.0 * Float64(F / fmax(A, C)))));
	else
		tmp = Float64(-1.0 * Float64(sqrt(Float64(-2.0 * F)) / sqrt(abs(B))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C, F)
	tmp = 0.0;
	if (abs(B) <= 1.45e-127)
		tmp = -0.25 * (sqrt((-16.0 * (max(A, C) * F))) / max(A, C));
	elseif (abs(B) <= 1.1e-47)
		tmp = -0.25 * sqrt((-16.0 * (F / max(A, C))));
	else
		tmp = -1.0 * (sqrt((-2.0 * F)) / sqrt(abs(B)));
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_, F_] := If[LessEqual[N[Abs[B], $MachinePrecision], 1.45e-127], 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], If[LessEqual[N[Abs[B], $MachinePrecision], 1.1e-47], N[(-0.25 * N[Sqrt[N[(-16.0 * N[(F / N[Max[A, C], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(-1.0 * N[(N[Sqrt[N[(-2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[Abs[B], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if B < 1.45e-127

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

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

   if 1.45e-127 < B < 1.10000000000000009e-47

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

      \[\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.7%

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

   7. Applied rewrites 14.7%

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

   if 1.10000000000000009e-47 < B

   1. Initial program 18.7%

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

   2. Taylor expanded in B around inf

      \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

   4. Applied rewrites 14.6%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. sqrt-div N/A

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

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

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

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

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

      8. lower-*.f64 N/A

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

      9. lower-unsound-sqrt.f64 18.4%

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

   6. Applied rewrites 18.4%

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

Alternative 4: 47.4% accurate, 4.4× speedup

Math

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

FPCore

(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (sqrt (* -16.0 (/ F (fmax A C))))))
   (if (<= (fabs B) 3.6e-206)
     (* 0.25 t_0)
     (if (<= (fabs B) 1.1e-47)
       (* -0.25 t_0)
       (* -1.0 (/ (sqrt (* -2.0 F)) (sqrt (fabs B))))))))

C

double code(double A, double B, double C, double F) {
	double t_0 = sqrt((-16.0 * (F / fmax(A, C))));
	double tmp;
	if (fabs(B) <= 3.6e-206) {
		tmp = 0.25 * t_0;
	} else if (fabs(B) <= 1.1e-47) {
		tmp = -0.25 * t_0;
	} else {
		tmp = -1.0 * (sqrt((-2.0 * F)) / sqrt(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) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((-16.0d0) * (f / fmax(a, c))))
    if (abs(b) <= 3.6d-206) then
        tmp = 0.25d0 * t_0
    else if (abs(b) <= 1.1d-47) then
        tmp = (-0.25d0) * t_0
    else
        tmp = (-1.0d0) * (sqrt(((-2.0d0) * f)) / sqrt(abs(b)))
    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 (Math.abs(B) <= 3.6e-206) {
		tmp = 0.25 * t_0;
	} else if (Math.abs(B) <= 1.1e-47) {
		tmp = -0.25 * t_0;
	} else {
		tmp = -1.0 * (Math.sqrt((-2.0 * F)) / Math.sqrt(Math.abs(B)));
	}
	return tmp;
}

Python

def code(A, B, C, F):
	t_0 = math.sqrt((-16.0 * (F / fmax(A, C))))
	tmp = 0
	if math.fabs(B) <= 3.6e-206:
		tmp = 0.25 * t_0
	elif math.fabs(B) <= 1.1e-47:
		tmp = -0.25 * t_0
	else:
		tmp = -1.0 * (math.sqrt((-2.0 * F)) / math.sqrt(math.fabs(B)))
	return tmp

Julia

function code(A, B, C, F)
	t_0 = sqrt(Float64(-16.0 * Float64(F / fmax(A, C))))
	tmp = 0.0
	if (abs(B) <= 3.6e-206)
		tmp = Float64(0.25 * t_0);
	elseif (abs(B) <= 1.1e-47)
		tmp = Float64(-0.25 * t_0);
	else
		tmp = Float64(-1.0 * Float64(sqrt(Float64(-2.0 * F)) / sqrt(abs(B))));
	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 (abs(B) <= 3.6e-206)
		tmp = 0.25 * t_0;
	elseif (abs(B) <= 1.1e-47)
		tmp = -0.25 * t_0;
	else
		tmp = -1.0 * (sqrt((-2.0 * F)) / sqrt(abs(B)));
	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[Abs[B], $MachinePrecision], 3.6e-206], N[(0.25 * t$95$0), $MachinePrecision], If[LessEqual[N[Abs[B], $MachinePrecision], 1.1e-47], N[(-0.25 * t$95$0), $MachinePrecision], N[(-1.0 * N[(N[Sqrt[N[(-2.0 * F), $MachinePrecision]], $MachinePrecision] / N[Sqrt[N[Abs[B], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if B < 3.59999999999999994e-206

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

      \[\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.1%

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

   7. Applied rewrites 11.1%

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

   if 3.59999999999999994e-206 < B < 1.10000000000000009e-47

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

      \[\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.7%

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

   7. Applied rewrites 14.7%

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

   if 1.10000000000000009e-47 < B

   1. Initial program 18.7%

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

   2. Taylor expanded in B around inf

      \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

   4. Applied rewrites 14.6%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. sqrt-div N/A

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

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

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

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

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

      8. lower-*.f64 N/A

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

      9. lower-unsound-sqrt.f64 18.4%

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

   6. Applied rewrites 18.4%

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

Alternative 5: 40.1% accurate, 4.4× speedup

Math

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

FPCore

(FPCore (A B C F)
 :precision binary64
 (let* ((t_0 (sqrt (* -16.0 (/ F (fmax A C))))))
   (if (<= (fabs B) 3.6e-206)
     (* 0.25 t_0)
     (if (<= (fabs B) 1.1e-47)
       (* -0.25 t_0)
       (- (sqrt (fabs (* (/ F (fabs B)) -2.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 (fabs(B) <= 3.6e-206) {
		tmp = 0.25 * t_0;
	} else if (fabs(B) <= 1.1e-47) {
		tmp = -0.25 * t_0;
	} else {
		tmp = -sqrt(fabs(((F / fabs(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) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((-16.0d0) * (f / fmax(a, c))))
    if (abs(b) <= 3.6d-206) then
        tmp = 0.25d0 * t_0
    else if (abs(b) <= 1.1d-47) then
        tmp = (-0.25d0) * t_0
    else
        tmp = -sqrt(abs(((f / abs(b)) * (-2.0d0))))
    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 (Math.abs(B) <= 3.6e-206) {
		tmp = 0.25 * t_0;
	} else if (Math.abs(B) <= 1.1e-47) {
		tmp = -0.25 * t_0;
	} else {
		tmp = -Math.sqrt(Math.abs(((F / Math.abs(B)) * -2.0)));
	}
	return tmp;
}

Python

def code(A, B, C, F):
	t_0 = math.sqrt((-16.0 * (F / fmax(A, C))))
	tmp = 0
	if math.fabs(B) <= 3.6e-206:
		tmp = 0.25 * t_0
	elif math.fabs(B) <= 1.1e-47:
		tmp = -0.25 * t_0
	else:
		tmp = -math.sqrt(math.fabs(((F / math.fabs(B)) * -2.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 (abs(B) <= 3.6e-206)
		tmp = Float64(0.25 * t_0);
	elseif (abs(B) <= 1.1e-47)
		tmp = Float64(-0.25 * t_0);
	else
		tmp = Float64(-sqrt(abs(Float64(Float64(F / abs(B)) * -2.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 (abs(B) <= 3.6e-206)
		tmp = 0.25 * t_0;
	elseif (abs(B) <= 1.1e-47)
		tmp = -0.25 * t_0;
	else
		tmp = -sqrt(abs(((F / abs(B)) * -2.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[Abs[B], $MachinePrecision], 3.6e-206], N[(0.25 * t$95$0), $MachinePrecision], If[LessEqual[N[Abs[B], $MachinePrecision], 1.1e-47], N[(-0.25 * t$95$0), $MachinePrecision], (-N[Sqrt[N[Abs[N[(N[(F / N[Abs[B], $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision]], $MachinePrecision])]]]

Derivation

1. Split input into 3 regimes

2. if B < 3.59999999999999994e-206

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

      \[\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.1%

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

   7. Applied rewrites 11.1%

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

   if 3.59999999999999994e-206 < B < 1.10000000000000009e-47

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

      \[\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.7%

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

   7. Applied rewrites 14.7%

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

   if 1.10000000000000009e-47 < B

   1. Initial program 18.7%

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

   2. Taylor expanded in B around inf

      \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

   4. Applied rewrites 14.6%

      \[\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 14.6%

         \[\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 14.6%

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

   6. Applied rewrites 14.6%

      \[\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. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. mult-flip-rev N/A

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

      8. lift-/.f64 N/A

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

      9. sqrt-prod N/A

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

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

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

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

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

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

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

      13. lift-*.f64 N/A

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

      14. lift-/.f64 N/A

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

      15. associate-*l/ N/A

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

      16. *-commutative N/A

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

      17. lift-*.f64 N/A

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

      18. mult-flip-rev N/A

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

      19. lift-/.f64 N/A

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

      20. sqrt-prod N/A

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

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

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

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

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

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

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

   8. Applied rewrites 27.7%

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

Alternative 6: 35.4% accurate, 5.4× speedup

Math

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

FPCore

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

C

double code(double A, double B, double C, double F) {
	double tmp;
	if (fabs(B) <= 8e-164) {
		tmp = 0.25 * sqrt((-16.0 * (F / fmax(A, C))));
	} else {
		tmp = -sqrt(fabs(((F / fabs(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 (abs(b) <= 8d-164) then
        tmp = 0.25d0 * sqrt(((-16.0d0) * (f / fmax(a, c))))
    else
        tmp = -sqrt(abs(((f / abs(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.abs(B) <= 8e-164) {
		tmp = 0.25 * Math.sqrt((-16.0 * (F / fmax(A, C))));
	} else {
		tmp = -Math.sqrt(Math.abs(((F / Math.abs(B)) * -2.0)));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if B < 7.99999999999999969e-164

   1. Initial program 18.7%

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

   2. Taylor expanded in 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.8%

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

   4. Applied rewrites 19.8%

      \[\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.1%

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

   7. Applied rewrites 11.1%

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

   if 7.99999999999999969e-164 < B

   1. Initial program 18.7%

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

   2. Taylor expanded in B around inf

      \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

   4. Applied rewrites 14.6%

      \[\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 14.6%

         \[\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 14.6%

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

   6. Applied rewrites 14.6%

      \[\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. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. *-commutative N/A

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

      6. lift-*.f64 N/A

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

      7. mult-flip-rev N/A

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

      8. lift-/.f64 N/A

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

      9. sqrt-prod N/A

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

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

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

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

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

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

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

      13. lift-*.f64 N/A

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

      14. lift-/.f64 N/A

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

      15. associate-*l/ N/A

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

      16. *-commutative N/A

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

      17. lift-*.f64 N/A

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

      18. mult-flip-rev N/A

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

      19. lift-/.f64 N/A

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

      20. sqrt-prod N/A

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

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

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

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

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

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

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

   8. Applied rewrites 27.7%

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

Alternative 7: 27.7% accurate, 9.7× speedup

Math

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

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(abs(Float64(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[Abs[N[(N[(F / B), $MachinePrecision] * -2.0), $MachinePrecision]], $MachinePrecision]], $MachinePrecision])

Derivation

1. Initial program 18.7%

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

2. Taylor expanded in B around inf

   \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

4. Applied rewrites 14.6%

   \[\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 14.6%

      \[\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 14.6%

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

6. Applied rewrites 14.6%

   \[\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. lift-*.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. associate-*l/ N/A

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

   5. *-commutative N/A

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

   6. lift-*.f64 N/A

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

   7. mult-flip-rev N/A

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

   8. lift-/.f64 N/A

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

   9. sqrt-prod N/A

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

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

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

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

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

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

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

   13. lift-*.f64 N/A

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

   14. lift-/.f64 N/A

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

   15. associate-*l/ N/A

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

   16. *-commutative N/A

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

   17. lift-*.f64 N/A

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

   18. mult-flip-rev N/A

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

   19. lift-/.f64 N/A

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

   20. sqrt-prod N/A

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

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

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

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

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

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

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

8. Applied rewrites 27.7%

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

Alternative 8: 27.7% 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 18.7%

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

2. Taylor expanded in B around inf

   \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

4. Applied rewrites 14.6%

   \[\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 14.6%

      \[\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 14.6%

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

6. Applied rewrites 14.6%

   \[\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 14.6%

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

8. Applied rewrites 14.6%

   \[\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. sqrt-unprod N/A

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

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

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

   4. lower-fabs.f64 27.7%

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

   5. lift-*.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 27.7%

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

10. Applied rewrites 27.7%

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

Alternative 9: 27.6% 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 18.7%

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

2. Taylor expanded in B around inf

   \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

4. Applied rewrites 14.6%

   \[\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 14.6%

      \[\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 14.6%

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

6. Applied rewrites 14.6%

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

Alternative 10: 27.6% 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 18.7%

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

2. Taylor expanded in B around inf

   \[\leadsto \color{blue}{-1 \cdot \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 14.6%

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

4. Applied rewrites 14.6%

   \[\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 14.6%

      \[\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 14.6%

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

6. Applied rewrites 14.6%

   \[\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 14.6%

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

8. Applied rewrites 14.6%

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

Reproduce

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