Henrywood and Agarwal, Equation (9a)

Percentage Accurate: 80.0% → 88.4%

Time: 11.6s

Alternatives: 19

Speedup: 1.9×

Specification

Math

\[\begin{array}{l} \\ w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \end{array} \]

FPCore

(FPCore (w0 M D h l d)
 :precision binary64
 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))

C

double code(double w0, double M, double D, double h, double l, double d) {
	return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}

Fortran

real(8) function code(w0, m, d, h, l, d_1)
    real(8), intent (in) :: w0
    real(8), intent (in) :: m
    real(8), intent (in) :: d
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d_1
    code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function

Java

public static double code(double w0, double M, double D, double h, double l, double d) {
	return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}

Python

def code(w0, M, D, h, l, d):
	return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))

Julia

function code(w0, M, D, h, l, d)
	return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))))
end

MATLAB

function tmp = code(w0, M, D, h, l, d)
	tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l))));
end

Wolfram

code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 80.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \end{array} \]

FPCore

(FPCore (w0 M D h l d)
 :precision binary64
 (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))

C

double code(double w0, double M, double D, double h, double l, double d) {
	return w0 * sqrt((1.0 - (pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}

Fortran

real(8) function code(w0, m, d, h, l, d_1)
    real(8), intent (in) :: w0
    real(8), intent (in) :: m
    real(8), intent (in) :: d
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d_1
    code = w0 * sqrt((1.0d0 - ((((m * d) / (2.0d0 * d_1)) ** 2.0d0) * (h / l))))
end function

Java

public static double code(double w0, double M, double D, double h, double l, double d) {
	return w0 * Math.sqrt((1.0 - (Math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))));
}

Python

def code(w0, M, D, h, l, d):
	return w0 * math.sqrt((1.0 - (math.pow(((M * D) / (2.0 * d)), 2.0) * (h / l))))

Julia

function code(w0, M, D, h, l, d)
	return Float64(w0 * sqrt(Float64(1.0 - Float64((Float64(Float64(M * D) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))))
end

MATLAB

function tmp = code(w0, M, D, h, l, d)
	tmp = w0 * sqrt((1.0 - ((((M * D) / (2.0 * d)) ^ 2.0) * (h / l))));
end

Wolfram

code[w0_, M_, D_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M * D), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 88.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ w0 \cdot \sqrt{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, \frac{\left(D\_m \cdot 0.5\right) \cdot \left(\frac{M\_m}{d} \cdot h\right)}{-\ell}, 1\right)} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (*
  w0
  (sqrt
   (fma
    (* (* (/ 0.5 d) M_m) D_m)
    (/ (* (* D_m 0.5) (* (/ M_m d) h)) (- l))
    1.0))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	return w0 * sqrt(fma((((0.5 / d) * M_m) * D_m), (((D_m * 0.5) * ((M_m / d) * h)) / -l), 1.0));
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	return Float64(w0 * sqrt(fma(Float64(Float64(Float64(0.5 / d) * M_m) * D_m), Float64(Float64(Float64(D_m * 0.5) * Float64(Float64(M_m / d) * h)) / Float64(-l)), 1.0)))
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0 * N[Sqrt[N[(N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] * N[(N[(N[(D$95$m * 0.5), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] / (-l)), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.2%

   \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto w0 \cdot \sqrt{\color{blue}{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

   2. sub-neg N/A

      \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right)}} \]

   3. +-commutative N/A

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right) + 1}} \]

   4. lift-*.f64 N/A

      \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}\right)\right) + 1} \]

   5. lift-/.f64 N/A

      \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \color{blue}{\frac{h}{\ell}}\right)\right) + 1} \]

   6. associate-*r/ N/A

      \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\ell}}\right)\right) + 1} \]

   7. distribute-neg-frac2 N/A

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

   8. lift-pow.f64 N/A

      \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

   9. unpow2 N/A

      \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}\right)} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

   10. associate-*l* N/A

       \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \left(\frac{M \cdot D}{2 \cdot d} \cdot h\right)}}{\mathsf{neg}\left(\ell\right)} + 1} \]

   11. associate-/l* N/A

       \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

   12. lower-fma.f64 N/A

       \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\frac{M \cdot D}{2 \cdot d}, \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}, 1\right)}} \]

4. Applied rewrites 86.4%

   \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\right) \cdot D, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)}} \]
5. Add Preprocessing

Alternative 2: 87.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;\sqrt{1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \leq 5 \cdot 10^{+147}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{h}{\ell} \cdot \frac{\left(D\_m \cdot M\_m\right) \cdot -0.5}{d}, \left(\frac{0.5}{d} \cdot M\_m\right) \cdot D\_m, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\left(D\_m \cdot M\_m\right) \cdot 0.5, \frac{\left(\left(h \cdot \frac{M\_m}{d}\right) \cdot D\_m\right) \cdot 0.5}{\left(-\ell\right) \cdot d}, 1\right)}\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (sqrt (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)))) 5e+147)
   (*
    w0
    (sqrt
     (fma
      (* (/ h l) (/ (* (* D_m M_m) -0.5) d))
      (* (* (/ 0.5 d) M_m) D_m)
      1.0)))
   (*
    w0
    (sqrt
     (fma
      (* (* D_m M_m) 0.5)
      (/ (* (* (* h (/ M_m d)) D_m) 0.5) (* (- l) d))
      1.0)))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if (sqrt((1.0 - (pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)))) <= 5e+147) {
		tmp = w0 * sqrt(fma(((h / l) * (((D_m * M_m) * -0.5) / d)), (((0.5 / d) * M_m) * D_m), 1.0));
	} else {
		tmp = w0 * sqrt(fma(((D_m * M_m) * 0.5), ((((h * (M_m / d)) * D_m) * 0.5) / (-l * d)), 1.0));
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (sqrt(Float64(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))) <= 5e+147)
		tmp = Float64(w0 * sqrt(fma(Float64(Float64(h / l) * Float64(Float64(Float64(D_m * M_m) * -0.5) / d)), Float64(Float64(Float64(0.5 / d) * M_m) * D_m), 1.0)));
	else
		tmp = Float64(w0 * sqrt(fma(Float64(Float64(D_m * M_m) * 0.5), Float64(Float64(Float64(Float64(h * Float64(M_m / d)) * D_m) * 0.5) / Float64(Float64(-l) * d)), 1.0)));
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 5e+147], N[(w0 * N[Sqrt[N[(N[(N[(h / l), $MachinePrecision] * N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * -0.5), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(0.5 / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * 0.5), $MachinePrecision] * N[(N[(N[(N[(h * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] * 0.5), $MachinePrecision] / N[((-l) * d), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))) < 5.0000000000000002e147

   1. Initial program 99.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. sub-neg N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right)}} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right) + 1}} \]

      4. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}\right)\right) + 1} \]

      5. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{\frac{h}{\ell} \cdot {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}\right)\right) + 1} \]

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

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{h}{\ell} \cdot \left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}\right)\right)} + 1} \]

      7. lift-pow.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{h}{\ell} \cdot \left(\mathsf{neg}\left(\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}}\right)\right) + 1} \]

      8. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{h}{\ell} \cdot \left(\mathsf{neg}\left(\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}}\right)\right) + 1} \]

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

         \[\leadsto w0 \cdot \sqrt{\frac{h}{\ell} \cdot \color{blue}{\left(\left(\mathsf{neg}\left(\frac{M \cdot D}{2 \cdot d}\right)\right) \cdot \frac{M \cdot D}{2 \cdot d}\right)} + 1} \]

      10. associate-*r* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{h}{\ell} \cdot \left(\mathsf{neg}\left(\frac{M \cdot D}{2 \cdot d}\right)\right)\right) \cdot \frac{M \cdot D}{2 \cdot d}} + 1} \]

      11. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\frac{h}{\ell} \cdot \left(\mathsf{neg}\left(\frac{M \cdot D}{2 \cdot d}\right)\right), \frac{M \cdot D}{2 \cdot d}, 1\right)}} \]

   4. Applied rewrites 96.1%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\frac{h}{\ell} \cdot \frac{\left(D \cdot M\right) \cdot -0.5}{d}, \left(\frac{0.5}{d} \cdot M\right) \cdot D, 1\right)}} \]

   if 5.0000000000000002e147 < (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))))

   1. Initial program 37.8%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. sub-neg N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right)}} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right) + 1}} \]

      4. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}\right)\right) + 1} \]

      5. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \color{blue}{\frac{h}{\ell}}\right)\right) + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\ell}}\right)\right) + 1} \]

      7. distribute-neg-frac2 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

      8. lift-pow.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

      9. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}\right)} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

      10. associate-*l* N/A

          \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \left(\frac{M \cdot D}{2 \cdot d} \cdot h\right)}}{\mathsf{neg}\left(\ell\right)} + 1} \]

      11. associate-/l* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\frac{M \cdot D}{2 \cdot d}, \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}, 1\right)}} \]

   4. Applied rewrites 70.2%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\right) \cdot D, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\left(\frac{\frac{1}{2}}{d} \cdot M\right) \cdot D}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\left(\frac{\frac{1}{2}}{d} \cdot M\right)} \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      3. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\left(\color{blue}{\frac{\frac{1}{2}}{d}} \cdot M\right) \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      4. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\frac{1}{2} \cdot M}{d}} \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\left(\frac{1}{2} \cdot M\right) \cdot D}{d}}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      6. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot \frac{1}{2}\right)} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      7. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \color{blue}{\frac{1}{2}}\right) \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      8. div-inv N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\frac{M}{2}} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\frac{M}{2} \cdot D}{d}}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\frac{M}{2} \cdot D}}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      11. div-inv N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot \frac{1}{2}\right)} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      12. metadata-eval N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \color{blue}{\frac{1}{2}}\right) \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      13. lower-*.f64 66.6

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot 0.5\right)} \cdot D}{d}, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

   6. Applied rewrites 66.6%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\left(M \cdot 0.5\right) \cdot D}{d}}, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]
   7. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d} \cdot \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell} + 1}} \]

      2. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell} \cdot \frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}} + 1} \]

      3. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}} \cdot \frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d} + 1} \]

      4. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell} \cdot \color{blue}{\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}} + 1} \]

      5. frac-times N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right) \cdot \left(\left(M \cdot \frac{1}{2}\right) \cdot D\right)}{\left(-\ell\right) \cdot d}} + 1} \]

      6. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right) \cdot \color{blue}{\left(\left(M \cdot \frac{1}{2}\right) \cdot D\right)}}{\left(-\ell\right) \cdot d} + 1} \]

      7. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right) \cdot \left(\color{blue}{\left(M \cdot \frac{1}{2}\right)} \cdot D\right)}{\left(-\ell\right) \cdot d} + 1} \]

      8. associate-*l* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right) \cdot \color{blue}{\left(M \cdot \left(\frac{1}{2} \cdot D\right)\right)}}{\left(-\ell\right) \cdot d} + 1} \]

      9. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right) \cdot \left(M \cdot \color{blue}{\left(D \cdot \frac{1}{2}\right)}\right)}{\left(-\ell\right) \cdot d} + 1} \]

      10. associate-*r* N/A

          \[\leadsto w0 \cdot \sqrt{\frac{\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right) \cdot \color{blue}{\left(\left(M \cdot D\right) \cdot \frac{1}{2}\right)}}{\left(-\ell\right) \cdot d} + 1} \]

      11. metadata-eval N/A

          \[\leadsto w0 \cdot \sqrt{\frac{\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right) \cdot \left(\left(M \cdot D\right) \cdot \color{blue}{\frac{1}{2}}\right)}{\left(-\ell\right) \cdot d} + 1} \]

      12. div-inv N/A

          \[\leadsto w0 \cdot \sqrt{\frac{\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right) \cdot \color{blue}{\frac{M \cdot D}{2}}}{\left(-\ell\right) \cdot d} + 1} \]

      13. *-commutative N/A

          \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\frac{M \cdot D}{2} \cdot \left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right)}}{\left(-\ell\right) \cdot d} + 1} \]

      14. *-commutative N/A

          \[\leadsto w0 \cdot \sqrt{\frac{\frac{M \cdot D}{2} \cdot \left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right)}{\color{blue}{d \cdot \left(-\ell\right)}} + 1} \]

      15. associate-/l* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{M \cdot D}{2} \cdot \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{d \cdot \left(-\ell\right)}} + 1} \]

   8. Applied rewrites 66.4%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\left(D \cdot M\right) \cdot 0.5, \frac{\left(\left(h \cdot \frac{M}{d}\right) \cdot D\right) \cdot 0.5}{\left(-\ell\right) \cdot d}, 1\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 81.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;\sqrt{1 - {\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \leq 1:\\ \;\;\;\;w0 \cdot 1\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, M\_m \cdot \left(\left(D\_m \cdot M\_m\right) \cdot \frac{D\_m}{\left(\ell \cdot d\right) \cdot d}\right), 1\right)}\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (sqrt (- 1.0 (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)))) 1.0)
   (* w0 1.0)
   (*
    w0
    (sqrt
     (fma (* h -0.25) (* M_m (* (* D_m M_m) (/ D_m (* (* l d) d)))) 1.0)))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if (sqrt((1.0 - (pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)))) <= 1.0) {
		tmp = w0 * 1.0;
	} else {
		tmp = w0 * sqrt(fma((h * -0.25), (M_m * ((D_m * M_m) * (D_m / ((l * d) * d)))), 1.0));
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (sqrt(Float64(1.0 - Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)))) <= 1.0)
		tmp = Float64(w0 * 1.0);
	else
		tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(M_m * Float64(Float64(D_m * M_m) * Float64(D_m / Float64(Float64(l * d) * d)))), 1.0)));
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[Sqrt[N[(1.0 - N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 1.0], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(M$95$m * N[(N[(D$95$m * M$95$m), $MachinePrecision] * N[(D$95$m / N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)))) < 1

   1. Initial program 99.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.2%

      \[\leadsto w0 \cdot \color{blue}{1} \]

   if 1 < (sqrt.f64 (-.f64 #s(literal 1 binary64) (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))))

   1. Initial program 47.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1}} \]

      2. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}{{d}^{2} \cdot \ell}} + 1} \]

      3. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\frac{-1}{4} \cdot \color{blue}{\left(\left({D}^{2} \cdot {M}^{2}\right) \cdot h\right)}}{{d}^{2} \cdot \ell} + 1} \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)\right) \cdot h}}{{d}^{2} \cdot \ell} + 1} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)}{{d}^{2} \cdot \ell} \cdot h} + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \cdot h + 1} \]

      7. lft-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) \cdot h + \color{blue}{\frac{1}{h} \cdot h}} \]

      8. distribute-rgt-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      9. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      10. associate-*r* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      11. rgt-mult-inverse N/A

          \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 44.2%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 50.5%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(\ell \cdot d\right) \cdot \color{blue}{d}}, 1\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 57.9%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, M \cdot \color{blue}{\left(\left(D \cdot M\right) \cdot \frac{D}{\left(\ell \cdot d\right) \cdot d}\right)}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 81.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -1 \cdot 10^{-13}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(\left(h \cdot D\_m\right) \cdot -0.25\right) \cdot D\_m}{\ell \cdot d}, \frac{M\_m}{d} \cdot M\_m, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -1e-13)
   (*
    w0
    (sqrt (fma (/ (* (* (* h D_m) -0.25) D_m) (* l d)) (* (/ M_m d) M_m) 1.0)))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -1e-13) {
		tmp = w0 * sqrt(fma(((((h * D_m) * -0.25) * D_m) / (l * d)), ((M_m / d) * M_m), 1.0));
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -1e-13)
		tmp = Float64(w0 * sqrt(fma(Float64(Float64(Float64(Float64(h * D_m) * -0.25) * D_m) / Float64(l * d)), Float64(Float64(M_m / d) * M_m), 1.0)));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -1e-13], N[(w0 * N[Sqrt[N[(N[(N[(N[(N[(h * D$95$m), $MachinePrecision] * -0.25), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1e-13

   1. Initial program 63.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1}} \]

      2. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}{{d}^{2} \cdot \ell}} + 1} \]

      3. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\frac{-1}{4} \cdot \color{blue}{\left(\left({D}^{2} \cdot {M}^{2}\right) \cdot h\right)}}{{d}^{2} \cdot \ell} + 1} \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)\right) \cdot h}}{{d}^{2} \cdot \ell} + 1} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)}{{d}^{2} \cdot \ell} \cdot h} + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \cdot h + 1} \]

      7. lft-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) \cdot h + \color{blue}{\frac{1}{h} \cdot h}} \]

      8. distribute-rgt-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      9. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      10. associate-*r* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      11. rgt-mult-inverse N/A

          \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 42.3%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 47.9%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(\ell \cdot d\right) \cdot \color{blue}{d}}, 1\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 62.1%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\left(\frac{D}{\ell} \cdot \left(-0.25 \cdot h\right)\right) \cdot \frac{D}{d}, \color{blue}{\frac{M}{d} \cdot M}, 1\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 55.1%

       \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(\left(h \cdot D\right) \cdot -0.25\right) \cdot D}{\ell \cdot d}, \color{blue}{\frac{M}{d}} \cdot M, 1\right)} \]

   if -1e-13 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 86.5%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 95.1%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 82.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -1 \cdot 10^{-13}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{D\_m}{\ell \cdot d} \cdot \left(\left(\frac{M\_m}{d} \cdot M\_m\right) \cdot D\_m\right), 1\right)}\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -1e-13)
   (*
    w0
    (sqrt (fma (* h -0.25) (* (/ D_m (* l d)) (* (* (/ M_m d) M_m) D_m)) 1.0)))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -1e-13) {
		tmp = w0 * sqrt(fma((h * -0.25), ((D_m / (l * d)) * (((M_m / d) * M_m) * D_m)), 1.0));
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -1e-13)
		tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(Float64(D_m / Float64(l * d)) * Float64(Float64(Float64(M_m / d) * M_m) * D_m)), 1.0)));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -1e-13], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(D$95$m / N[(l * d), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(M$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * D$95$m), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1e-13

   1. Initial program 63.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1}} \]

      2. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}{{d}^{2} \cdot \ell}} + 1} \]

      3. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\frac{-1}{4} \cdot \color{blue}{\left(\left({D}^{2} \cdot {M}^{2}\right) \cdot h\right)}}{{d}^{2} \cdot \ell} + 1} \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)\right) \cdot h}}{{d}^{2} \cdot \ell} + 1} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)}{{d}^{2} \cdot \ell} \cdot h} + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \cdot h + 1} \]

      7. lft-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) \cdot h + \color{blue}{\frac{1}{h} \cdot h}} \]

      8. distribute-rgt-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      9. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      10. associate-*r* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      11. rgt-mult-inverse N/A

          \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 42.3%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 47.9%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(\ell \cdot d\right) \cdot \color{blue}{d}}, 1\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 54.0%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{D}{\ell \cdot d} \cdot \color{blue}{\left(\left(\frac{M}{d} \cdot M\right) \cdot D\right)}, 1\right)} \]

   if -1e-13 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 86.5%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 95.1%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 80.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+16}:\\ \;\;\;\;w0 \cdot \sqrt{\left(\left(\left(\frac{h}{d \cdot d} \cdot M\_m\right) \cdot \frac{M\_m}{\ell}\right) \cdot \left(-0.25 \cdot D\_m\right)\right) \cdot D\_m}\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -5e+16)
   (* w0 (sqrt (* (* (* (* (/ h (* d d)) M_m) (/ M_m l)) (* -0.25 D_m)) D_m)))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+16) {
		tmp = w0 * sqrt((((((h / (d * d)) * M_m) * (M_m / l)) * (-0.25 * D_m)) * D_m));
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Fortran

D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
    real(8), intent (in) :: w0
    real(8), intent (in) :: m_m
    real(8), intent (in) :: d_m
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((((m_m * d_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-5d+16)) then
        tmp = w0 * sqrt((((((h / (d * d)) * m_m) * (m_m / l)) * ((-0.25d0) * d_m)) * d_m))
    else
        tmp = w0 * 1.0d0
    end if
    code = tmp
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((Math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+16) {
		tmp = w0 * Math.sqrt((((((h / (d * d)) * M_m) * (M_m / l)) * (-0.25 * D_m)) * D_m));
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
[w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d])
def code(w0, M_m, D_m, h, l, d):
	tmp = 0
	if (math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+16:
		tmp = w0 * math.sqrt((((((h / (d * d)) * M_m) * (M_m / l)) * (-0.25 * D_m)) * D_m))
	else:
		tmp = w0 * 1.0
	return tmp

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+16)
		tmp = Float64(w0 * sqrt(Float64(Float64(Float64(Float64(Float64(h / Float64(d * d)) * M_m) * Float64(M_m / l)) * Float64(-0.25 * D_m)) * D_m)));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
	tmp = 0.0;
	if (((((M_m * D_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -5e+16)
		tmp = w0 * sqrt((((((h / (d * d)) * M_m) * (M_m / l)) * (-0.25 * D_m)) * D_m));
	else
		tmp = w0 * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+16], N[(w0 * N[Sqrt[N[(N[(N[(N[(N[(h / N[(d * d), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / l), $MachinePrecision]), $MachinePrecision] * N[(-0.25 * D$95$m), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -5e16

   1. Initial program 62.1%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around inf

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{-1}{4} \cdot \color{blue}{\left({D}^{2} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}\right)}} \]

      2. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot {D}^{2}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}}} \]

      3. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot {D}^{2}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}}} \]

      4. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot {D}^{2}\right)} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}} \]

      5. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \color{blue}{\left(D \cdot D\right)}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}} \]

      6. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \color{blue}{\left(D \cdot D\right)}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}} \]

      7. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \frac{\color{blue}{h \cdot {M}^{2}}}{{d}^{2} \cdot \ell}} \]

      8. times-frac N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \color{blue}{\left(\frac{h}{{d}^{2}} \cdot \frac{{M}^{2}}{\ell}\right)}} \]

      9. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \color{blue}{\left(\frac{h}{{d}^{2}} \cdot \frac{{M}^{2}}{\ell}\right)}} \]

      10. lower-/.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\color{blue}{\frac{h}{{d}^{2}}} \cdot \frac{{M}^{2}}{\ell}\right)} \]

      11. unpow2 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{\color{blue}{d \cdot d}} \cdot \frac{{M}^{2}}{\ell}\right)} \]

      12. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{\color{blue}{d \cdot d}} \cdot \frac{{M}^{2}}{\ell}\right)} \]

      13. lower-/.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{d \cdot d} \cdot \color{blue}{\frac{{M}^{2}}{\ell}}\right)} \]

      14. unpow2 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{d \cdot d} \cdot \frac{\color{blue}{M \cdot M}}{\ell}\right)} \]

      15. lower-*.f64 39.4

          \[\leadsto w0 \cdot \sqrt{\left(-0.25 \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{d \cdot d} \cdot \frac{\color{blue}{M \cdot M}}{\ell}\right)} \]

   5. Applied rewrites 39.4%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(-0.25 \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{d \cdot d} \cdot \frac{M \cdot M}{\ell}\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 50.3%

      \[\leadsto w0 \cdot \sqrt{\left(\left(\left(\frac{h}{d \cdot d} \cdot M\right) \cdot \frac{M}{\ell}\right) \cdot \left(-0.25 \cdot D\right)\right) \cdot \color{blue}{D}} \]

   if -5e16 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 86.7%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 94.3%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 81.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -1 \cdot 10^{-13}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, M\_m \cdot \left(\left(D\_m \cdot M\_m\right) \cdot \frac{D\_m}{\left(d \cdot d\right) \cdot \ell}\right), 1\right)}\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -1e-13)
   (*
    w0
    (sqrt (fma (* h -0.25) (* M_m (* (* D_m M_m) (/ D_m (* (* d d) l)))) 1.0)))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -1e-13) {
		tmp = w0 * sqrt(fma((h * -0.25), (M_m * ((D_m * M_m) * (D_m / ((d * d) * l)))), 1.0));
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -1e-13)
		tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(M_m * Float64(Float64(D_m * M_m) * Float64(D_m / Float64(Float64(d * d) * l)))), 1.0)));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -1e-13], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(M$95$m * N[(N[(D$95$m * M$95$m), $MachinePrecision] * N[(D$95$m / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -1e-13

   1. Initial program 63.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1}} \]

      2. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}{{d}^{2} \cdot \ell}} + 1} \]

      3. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\frac{-1}{4} \cdot \color{blue}{\left(\left({D}^{2} \cdot {M}^{2}\right) \cdot h\right)}}{{d}^{2} \cdot \ell} + 1} \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)\right) \cdot h}}{{d}^{2} \cdot \ell} + 1} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)}{{d}^{2} \cdot \ell} \cdot h} + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \cdot h + 1} \]

      7. lft-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) \cdot h + \color{blue}{\frac{1}{h} \cdot h}} \]

      8. distribute-rgt-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      9. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      10. associate-*r* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      11. rgt-mult-inverse N/A

          \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 42.3%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 49.8%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, M \cdot \color{blue}{\left(\left(D \cdot M\right) \cdot \frac{D}{\left(d \cdot d\right) \cdot \ell}\right)}, 1\right)} \]

   if -1e-13 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 86.5%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 95.1%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 79.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -5 \cdot 10^{+16}:\\ \;\;\;\;w0 \cdot \sqrt{\left(-0.25 \cdot \left(D\_m \cdot D\_m\right)\right) \cdot \left(M\_m \cdot \frac{h \cdot M\_m}{\left(d \cdot d\right) \cdot \ell}\right)}\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -5e+16)
   (* w0 (sqrt (* (* -0.25 (* D_m D_m)) (* M_m (/ (* h M_m) (* (* d d) l))))))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+16) {
		tmp = w0 * sqrt(((-0.25 * (D_m * D_m)) * (M_m * ((h * M_m) / ((d * d) * l)))));
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Fortran

D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
    real(8), intent (in) :: w0
    real(8), intent (in) :: m_m
    real(8), intent (in) :: d_m
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d
    real(8) :: tmp
    if (((((m_m * d_m) / (2.0d0 * d)) ** 2.0d0) * (h / l)) <= (-5d+16)) then
        tmp = w0 * sqrt((((-0.25d0) * (d_m * d_m)) * (m_m * ((h * m_m) / ((d * d) * l)))))
    else
        tmp = w0 * 1.0d0
    end if
    code = tmp
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((Math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+16) {
		tmp = w0 * Math.sqrt(((-0.25 * (D_m * D_m)) * (M_m * ((h * M_m) / ((d * d) * l)))));
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
[w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d])
def code(w0, M_m, D_m, h, l, d):
	tmp = 0
	if (math.pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -5e+16:
		tmp = w0 * math.sqrt(((-0.25 * (D_m * D_m)) * (M_m * ((h * M_m) / ((d * d) * l)))))
	else:
		tmp = w0 * 1.0
	return tmp

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -5e+16)
		tmp = Float64(w0 * sqrt(Float64(Float64(-0.25 * Float64(D_m * D_m)) * Float64(M_m * Float64(Float64(h * M_m) / Float64(Float64(d * d) * l))))));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp_2 = code(w0, M_m, D_m, h, l, d)
	tmp = 0.0;
	if (((((M_m * D_m) / (2.0 * d)) ^ 2.0) * (h / l)) <= -5e+16)
		tmp = w0 * sqrt(((-0.25 * (D_m * D_m)) * (M_m * ((h * M_m) / ((d * d) * l)))));
	else
		tmp = w0 * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -5e+16], N[(w0 * N[Sqrt[N[(N[(-0.25 * N[(D$95$m * D$95$m), $MachinePrecision]), $MachinePrecision] * N[(M$95$m * N[(N[(h * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -5e16

   1. Initial program 62.1%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around inf

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{-1}{4} \cdot \color{blue}{\left({D}^{2} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}\right)}} \]

      2. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot {D}^{2}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}}} \]

      3. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot {D}^{2}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}}} \]

      4. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot {D}^{2}\right)} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}} \]

      5. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \color{blue}{\left(D \cdot D\right)}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}} \]

      6. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \color{blue}{\left(D \cdot D\right)}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}} \]

      7. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \frac{\color{blue}{h \cdot {M}^{2}}}{{d}^{2} \cdot \ell}} \]

      8. times-frac N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \color{blue}{\left(\frac{h}{{d}^{2}} \cdot \frac{{M}^{2}}{\ell}\right)}} \]

      9. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \color{blue}{\left(\frac{h}{{d}^{2}} \cdot \frac{{M}^{2}}{\ell}\right)}} \]

      10. lower-/.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\color{blue}{\frac{h}{{d}^{2}}} \cdot \frac{{M}^{2}}{\ell}\right)} \]

      11. unpow2 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{\color{blue}{d \cdot d}} \cdot \frac{{M}^{2}}{\ell}\right)} \]

      12. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{\color{blue}{d \cdot d}} \cdot \frac{{M}^{2}}{\ell}\right)} \]

      13. lower-/.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{d \cdot d} \cdot \color{blue}{\frac{{M}^{2}}{\ell}}\right)} \]

      14. unpow2 N/A

          \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{d \cdot d} \cdot \frac{\color{blue}{M \cdot M}}{\ell}\right)} \]

      15. lower-*.f64 39.4

          \[\leadsto w0 \cdot \sqrt{\left(-0.25 \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{d \cdot d} \cdot \frac{\color{blue}{M \cdot M}}{\ell}\right)} \]

   5. Applied rewrites 39.4%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(-0.25 \cdot \left(D \cdot D\right)\right) \cdot \left(\frac{h}{d \cdot d} \cdot \frac{M \cdot M}{\ell}\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 39.6%

      \[\leadsto w0 \cdot \sqrt{\left(-0.25 \cdot \left(D \cdot D\right)\right) \cdot \left(M \cdot \color{blue}{\frac{h \cdot M}{\left(d \cdot d\right) \cdot \ell}}\right)} \]

   if -5e16 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 86.7%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 94.3%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 78.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+144}:\\ \;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, \frac{M\_m}{d} \cdot \frac{h \cdot M\_m}{\ell \cdot d}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+144)
   (* w0 (fma (* (* D_m D_m) -0.125) (* (/ M_m d) (/ (* h M_m) (* l d))) 1.0))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+144) {
		tmp = w0 * fma(((D_m * D_m) * -0.125), ((M_m / d) * ((h * M_m) / (l * d))), 1.0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+144)
		tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(Float64(M_m / d) * Float64(Float64(h * M_m) / Float64(l * d))), 1.0));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+144], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(N[(M$95$m / d), $MachinePrecision] * N[(N[(h * M$95$m), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000005e144

   1. Initial program 57.8%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \color{blue}{\left(\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1\right)} \]

      2. *-commutative N/A

         \[\leadsto w0 \cdot \left(\color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + 1\right) \]

      3. associate-/l* N/A

         \[\leadsto w0 \cdot \left(\color{blue}{\left({D}^{2} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}\right)} \cdot \frac{-1}{8} + 1\right) \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \left(\color{blue}{{D}^{2} \cdot \left(\frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}\right)} + 1\right) \]

      5. *-commutative N/A

         \[\leadsto w0 \cdot \left({D}^{2} \cdot \color{blue}{\left(\frac{-1}{8} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}\right)} + 1\right) \]

      6. associate-*r* N/A

         \[\leadsto w0 \cdot \left(\color{blue}{\left({D}^{2} \cdot \frac{-1}{8}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}} + 1\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \color{blue}{\mathsf{fma}\left({D}^{2} \cdot \frac{-1}{8}, \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}, 1\right)} \]

   5. Applied rewrites 39.2%

      \[\leadsto w0 \cdot \color{blue}{\mathsf{fma}\left(\left(D \cdot D\right) \cdot -0.125, \frac{h}{d \cdot d} \cdot \frac{M \cdot M}{\ell}, 1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.9%

      \[\leadsto w0 \cdot \mathsf{fma}\left(\left(D \cdot D\right) \cdot -0.125, \frac{M}{d} \cdot \color{blue}{\frac{h \cdot M}{\ell \cdot d}}, 1\right) \]

   if -2.00000000000000005e144 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 87.2%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 91.2%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 78.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+144}:\\ \;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, \left(\frac{M\_m}{d} \cdot M\_m\right) \cdot \frac{h}{\ell \cdot d}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+144)
   (* w0 (fma (* (* D_m D_m) -0.125) (* (* (/ M_m d) M_m) (/ h (* l d))) 1.0))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+144) {
		tmp = w0 * fma(((D_m * D_m) * -0.125), (((M_m / d) * M_m) * (h / (l * d))), 1.0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+144)
		tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(Float64(Float64(M_m / d) * M_m) * Float64(h / Float64(l * d))), 1.0));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+144], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(N[(N[(M$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(h / N[(l * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000005e144

   1. Initial program 57.8%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \color{blue}{\left(\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1\right)} \]

      2. *-commutative N/A

         \[\leadsto w0 \cdot \left(\color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + 1\right) \]

      3. associate-/l* N/A

         \[\leadsto w0 \cdot \left(\color{blue}{\left({D}^{2} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}\right)} \cdot \frac{-1}{8} + 1\right) \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \left(\color{blue}{{D}^{2} \cdot \left(\frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}\right)} + 1\right) \]

      5. *-commutative N/A

         \[\leadsto w0 \cdot \left({D}^{2} \cdot \color{blue}{\left(\frac{-1}{8} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}\right)} + 1\right) \]

      6. associate-*r* N/A

         \[\leadsto w0 \cdot \left(\color{blue}{\left({D}^{2} \cdot \frac{-1}{8}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}} + 1\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \color{blue}{\mathsf{fma}\left({D}^{2} \cdot \frac{-1}{8}, \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}, 1\right)} \]

   5. Applied rewrites 39.2%

      \[\leadsto w0 \cdot \color{blue}{\mathsf{fma}\left(\left(D \cdot D\right) \cdot -0.125, \frac{h}{d \cdot d} \cdot \frac{M \cdot M}{\ell}, 1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 45.0%

      \[\leadsto w0 \cdot \mathsf{fma}\left(\left(D \cdot D\right) \cdot -0.125, \left(\frac{M}{d} \cdot M\right) \cdot \color{blue}{\frac{h}{\ell \cdot d}}, 1\right) \]

   if -2.00000000000000005e144 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 87.2%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 91.2%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 78.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -2 \cdot 10^{+144}:\\ \;\;\;\;\mathsf{fma}\left(w0 \cdot -0.125, \frac{\left(D\_m \cdot D\_m\right) \cdot \left(\left(\frac{h}{d \cdot d} \cdot M\_m\right) \cdot M\_m\right)}{\ell}, w0\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) -2e+144)
   (fma (* w0 -0.125) (/ (* (* D_m D_m) (* (* (/ h (* d d)) M_m) M_m)) l) w0)
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -2e+144) {
		tmp = fma((w0 * -0.125), (((D_m * D_m) * (((h / (d * d)) * M_m) * M_m)) / l), w0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= -2e+144)
		tmp = fma(Float64(w0 * -0.125), Float64(Float64(Float64(D_m * D_m) * Float64(Float64(Float64(h / Float64(d * d)) * M_m) * M_m)) / l), w0);
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], -2e+144], N[(N[(w0 * -0.125), $MachinePrecision] * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * N[(N[(N[(h / N[(d * d), $MachinePrecision]), $MachinePrecision] * M$95$m), $MachinePrecision] * M$95$m), $MachinePrecision]), $MachinePrecision] / l), $MachinePrecision] + w0), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -2.00000000000000005e144

   1. Initial program 57.8%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto \color{blue}{w0 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} + w0} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + w0 \]

      3. associate-/l* N/A

         \[\leadsto \color{blue}{\left({D}^{2} \cdot \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}\right)} \cdot \frac{-1}{8} + w0 \]

      4. associate-*r* N/A

         \[\leadsto \color{blue}{{D}^{2} \cdot \left(\frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}\right)} + w0 \]

      5. *-commutative N/A

         \[\leadsto {D}^{2} \cdot \color{blue}{\left(\frac{-1}{8} \cdot \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}\right)} + w0 \]

      6. associate-*r* N/A

         \[\leadsto \color{blue}{\left({D}^{2} \cdot \frac{-1}{8}\right) \cdot \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}} + w0 \]

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({D}^{2} \cdot \frac{-1}{8}, \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}, w0\right)} \]

   5. Applied rewrites 39.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\left(D \cdot D\right) \cdot -0.125, \frac{\left(M \cdot M\right) \cdot h}{\ell} \cdot \frac{w0}{d \cdot d}, w0\right)} \]

   6. Taylor expanded in w0 around 0

      \[\leadsto w0 \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 44.3%

      \[\leadsto \mathsf{fma}\left(w0 \cdot -0.125, \color{blue}{\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}}, w0\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 41.4%

       \[\leadsto \mathsf{fma}\left(w0 \cdot -0.125, \frac{\left(D \cdot D\right) \cdot \left(\left(\frac{h}{d \cdot d} \cdot M\right) \cdot M\right)}{\ell}, w0\right) \]

   if -2.00000000000000005e144 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 87.2%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 91.2%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 77.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -\infty:\\ \;\;\;\;w0 \cdot \mathsf{fma}\left(\left(D\_m \cdot D\_m\right) \cdot -0.125, M\_m \cdot \frac{h \cdot M\_m}{\left(d \cdot d\right) \cdot \ell}, 1\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) (- INFINITY))
   (* w0 (fma (* (* D_m D_m) -0.125) (* M_m (/ (* h M_m) (* (* d d) l))) 1.0))
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -((double) INFINITY)) {
		tmp = w0 * fma(((D_m * D_m) * -0.125), (M_m * ((h * M_m) / ((d * d) * l))), 1.0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= Float64(-Inf))
		tmp = Float64(w0 * fma(Float64(Float64(D_m * D_m) * -0.125), Float64(M_m * Float64(Float64(h * M_m) / Float64(Float64(d * d) * l))), 1.0));
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(w0 * N[(N[(N[(D$95$m * D$95$m), $MachinePrecision] * -0.125), $MachinePrecision] * N[(M$95$m * N[(N[(h * M$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0

   1. Initial program 54.1%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \color{blue}{\left(\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1\right)} \]

      2. *-commutative N/A

         \[\leadsto w0 \cdot \left(\color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + 1\right) \]

      3. associate-/l* N/A

         \[\leadsto w0 \cdot \left(\color{blue}{\left({D}^{2} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}\right)} \cdot \frac{-1}{8} + 1\right) \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \left(\color{blue}{{D}^{2} \cdot \left(\frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}\right)} + 1\right) \]

      5. *-commutative N/A

         \[\leadsto w0 \cdot \left({D}^{2} \cdot \color{blue}{\left(\frac{-1}{8} \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}\right)} + 1\right) \]

      6. associate-*r* N/A

         \[\leadsto w0 \cdot \left(\color{blue}{\left({D}^{2} \cdot \frac{-1}{8}\right) \cdot \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}} + 1\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto w0 \cdot \color{blue}{\mathsf{fma}\left({D}^{2} \cdot \frac{-1}{8}, \frac{{M}^{2} \cdot h}{{d}^{2} \cdot \ell}, 1\right)} \]

   5. Applied rewrites 40.7%

      \[\leadsto w0 \cdot \color{blue}{\mathsf{fma}\left(\left(D \cdot D\right) \cdot -0.125, \frac{h}{d \cdot d} \cdot \frac{M \cdot M}{\ell}, 1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 43.0%

      \[\leadsto w0 \cdot \mathsf{fma}\left(\left(D \cdot D\right) \cdot -0.125, M \cdot \color{blue}{\frac{h \cdot M}{\left(d \cdot d\right) \cdot \ell}}, 1\right) \]

   if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 87.5%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 89.1%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 77.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(w0 \cdot -0.125, \frac{\left(M\_m \cdot \left(M\_m \cdot \left(h \cdot D\_m\right)\right)\right) \cdot D\_m}{\left(d \cdot d\right) \cdot \ell}, w0\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) (- INFINITY))
   (fma (* w0 -0.125) (/ (* (* M_m (* M_m (* h D_m))) D_m) (* (* d d) l)) w0)
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -((double) INFINITY)) {
		tmp = fma((w0 * -0.125), (((M_m * (M_m * (h * D_m))) * D_m) / ((d * d) * l)), w0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= Float64(-Inf))
		tmp = fma(Float64(w0 * -0.125), Float64(Float64(Float64(M_m * Float64(M_m * Float64(h * D_m))) * D_m) / Float64(Float64(d * d) * l)), w0);
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(w0 * -0.125), $MachinePrecision] * N[(N[(N[(M$95$m * N[(M$95$m * N[(h * D$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * D$95$m), $MachinePrecision] / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0

   1. Initial program 54.1%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto \color{blue}{w0 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} + w0} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + w0 \]

      3. associate-/l* N/A

         \[\leadsto \color{blue}{\left({D}^{2} \cdot \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}\right)} \cdot \frac{-1}{8} + w0 \]

      4. associate-*r* N/A

         \[\leadsto \color{blue}{{D}^{2} \cdot \left(\frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}\right)} + w0 \]

      5. *-commutative N/A

         \[\leadsto {D}^{2} \cdot \color{blue}{\left(\frac{-1}{8} \cdot \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}\right)} + w0 \]

      6. associate-*r* N/A

         \[\leadsto \color{blue}{\left({D}^{2} \cdot \frac{-1}{8}\right) \cdot \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}} + w0 \]

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({D}^{2} \cdot \frac{-1}{8}, \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}, w0\right)} \]

   5. Applied rewrites 41.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\left(D \cdot D\right) \cdot -0.125, \frac{\left(M \cdot M\right) \cdot h}{\ell} \cdot \frac{w0}{d \cdot d}, w0\right)} \]

   6. Taylor expanded in w0 around 0

      \[\leadsto w0 \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 48.2%

      \[\leadsto \mathsf{fma}\left(w0 \cdot -0.125, \color{blue}{\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}}, w0\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 50.1%

       \[\leadsto \mathsf{fma}\left(w0 \cdot -0.125, \frac{\left(M \cdot \left(M \cdot \left(h \cdot D\right)\right)\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, w0\right) \]

   if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 87.5%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 89.1%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 76.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;{\left(\frac{M\_m \cdot D\_m}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell} \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(w0 \cdot -0.125, \left(M\_m \cdot M\_m\right) \cdot \left(\left(h \cdot D\_m\right) \cdot \frac{D\_m}{\left(d \cdot d\right) \cdot \ell}\right), w0\right)\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot 1\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* (pow (/ (* M_m D_m) (* 2.0 d)) 2.0) (/ h l)) (- INFINITY))
   (fma (* w0 -0.125) (* (* M_m M_m) (* (* h D_m) (/ D_m (* (* d d) l)))) w0)
   (* w0 1.0)))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((pow(((M_m * D_m) / (2.0 * d)), 2.0) * (h / l)) <= -((double) INFINITY)) {
		tmp = fma((w0 * -0.125), ((M_m * M_m) * ((h * D_m) * (D_m / ((d * d) * l)))), w0);
	} else {
		tmp = w0 * 1.0;
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64((Float64(Float64(M_m * D_m) / Float64(2.0 * d)) ^ 2.0) * Float64(h / l)) <= Float64(-Inf))
		tmp = fma(Float64(w0 * -0.125), Float64(Float64(M_m * M_m) * Float64(Float64(h * D_m) * Float64(D_m / Float64(Float64(d * d) * l)))), w0);
	else
		tmp = Float64(w0 * 1.0);
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(N[Power[N[(N[(M$95$m * D$95$m), $MachinePrecision] / N[(2.0 * d), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] * N[(h / l), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(w0 * -0.125), $MachinePrecision] * N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(N[(h * D$95$m), $MachinePrecision] * N[(D$95$m / N[(N[(d * d), $MachinePrecision] * l), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + w0), $MachinePrecision], N[(w0 * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l)) < -inf.0

   1. Initial program 54.1%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto \color{blue}{w0 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} + w0} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{D}^{2} \cdot \left({M}^{2} \cdot \left(h \cdot w0\right)\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}} + w0 \]

      3. associate-/l* N/A

         \[\leadsto \color{blue}{\left({D}^{2} \cdot \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}\right)} \cdot \frac{-1}{8} + w0 \]

      4. associate-*r* N/A

         \[\leadsto \color{blue}{{D}^{2} \cdot \left(\frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell} \cdot \frac{-1}{8}\right)} + w0 \]

      5. *-commutative N/A

         \[\leadsto {D}^{2} \cdot \color{blue}{\left(\frac{-1}{8} \cdot \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}\right)} + w0 \]

      6. associate-*r* N/A

         \[\leadsto \color{blue}{\left({D}^{2} \cdot \frac{-1}{8}\right) \cdot \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}} + w0 \]

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({D}^{2} \cdot \frac{-1}{8}, \frac{{M}^{2} \cdot \left(h \cdot w0\right)}{{d}^{2} \cdot \ell}, w0\right)} \]

   5. Applied rewrites 41.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\left(D \cdot D\right) \cdot -0.125, \frac{\left(M \cdot M\right) \cdot h}{\ell} \cdot \frac{w0}{d \cdot d}, w0\right)} \]

   6. Taylor expanded in w0 around 0

      \[\leadsto w0 \cdot \color{blue}{\left(1 + \frac{-1}{8} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 48.2%

      \[\leadsto \mathsf{fma}\left(w0 \cdot -0.125, \color{blue}{\frac{\left(\left(\left(M \cdot M\right) \cdot h\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}}, w0\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 48.4%

       \[\leadsto \mathsf{fma}\left(w0 \cdot -0.125, \left(M \cdot M\right) \cdot \left(\left(h \cdot D\right) \cdot \color{blue}{\frac{D}{\left(d \cdot d\right) \cdot \ell}}\right), w0\right) \]

   if -inf.0 < (*.f64 (pow.f64 (/.f64 (*.f64 M D) (*.f64 #s(literal 2 binary64) d)) #s(literal 2 binary64)) (/.f64 h l))

   1. Initial program 87.5%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 89.1%

      \[\leadsto w0 \cdot \color{blue}{1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 15: 87.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;M\_m \cdot D\_m \leq 5 \cdot 10^{-235}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{D\_m}{\ell}, \left(\left(\frac{D\_m}{d} \cdot M\_m\right) \cdot \frac{M\_m}{d}\right) \cdot \left(-0.25 \cdot h\right), 1\right)}\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M\_m \cdot 0.5\right) \cdot D\_m}{d}, h \cdot \frac{-0.5 \cdot \left(D\_m \cdot M\_m\right)}{\ell \cdot d}, 1\right)}\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* M_m D_m) 5e-235)
   (*
    w0
    (sqrt (fma (/ D_m l) (* (* (* (/ D_m d) M_m) (/ M_m d)) (* -0.25 h)) 1.0)))
   (*
    w0
    (sqrt
     (fma
      (/ (* (* M_m 0.5) D_m) d)
      (* h (/ (* -0.5 (* D_m M_m)) (* l d)))
      1.0)))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((M_m * D_m) <= 5e-235) {
		tmp = w0 * sqrt(fma((D_m / l), ((((D_m / d) * M_m) * (M_m / d)) * (-0.25 * h)), 1.0));
	} else {
		tmp = w0 * sqrt(fma((((M_m * 0.5) * D_m) / d), (h * ((-0.5 * (D_m * M_m)) / (l * d))), 1.0));
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64(M_m * D_m) <= 5e-235)
		tmp = Float64(w0 * sqrt(fma(Float64(D_m / l), Float64(Float64(Float64(Float64(D_m / d) * M_m) * Float64(M_m / d)) * Float64(-0.25 * h)), 1.0)));
	else
		tmp = Float64(w0 * sqrt(fma(Float64(Float64(Float64(M_m * 0.5) * D_m) / d), Float64(h * Float64(Float64(-0.5 * Float64(D_m * M_m)) / Float64(l * d))), 1.0)));
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 5e-235], N[(w0 * N[Sqrt[N[(N[(D$95$m / l), $MachinePrecision] * N[(N[(N[(N[(D$95$m / d), $MachinePrecision] * M$95$m), $MachinePrecision] * N[(M$95$m / d), $MachinePrecision]), $MachinePrecision] * N[(-0.25 * h), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(N[(N[(M$95$m * 0.5), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $MachinePrecision] * N[(h * N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 M D) < 4.9999999999999998e-235

   1. Initial program 82.6%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1}} \]

      2. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}{{d}^{2} \cdot \ell}} + 1} \]

      3. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\frac{-1}{4} \cdot \color{blue}{\left(\left({D}^{2} \cdot {M}^{2}\right) \cdot h\right)}}{{d}^{2} \cdot \ell} + 1} \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)\right) \cdot h}}{{d}^{2} \cdot \ell} + 1} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)}{{d}^{2} \cdot \ell} \cdot h} + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \cdot h + 1} \]

      7. lft-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) \cdot h + \color{blue}{\frac{1}{h} \cdot h}} \]

      8. distribute-rgt-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      9. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      10. associate-*r* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      11. rgt-mult-inverse N/A

          \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 61.9%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 65.1%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(\ell \cdot d\right) \cdot \color{blue}{d}}, 1\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 84.8%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{D}{\ell}, \color{blue}{\left(\left(\frac{D}{d} \cdot M\right) \cdot \frac{M}{d}\right) \cdot \left(-0.25 \cdot h\right)}, 1\right)} \]

   if 4.9999999999999998e-235 < (*.f64 M D)

   1. Initial program 76.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. sub-neg N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right)}} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right) + 1}} \]

      4. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}\right)\right) + 1} \]

      5. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \color{blue}{\frac{h}{\ell}}\right)\right) + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\ell}}\right)\right) + 1} \]

      7. distribute-neg-frac2 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

      8. lift-pow.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

      9. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}\right)} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

      10. associate-*l* N/A

          \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \left(\frac{M \cdot D}{2 \cdot d} \cdot h\right)}}{\mathsf{neg}\left(\ell\right)} + 1} \]

      11. associate-/l* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\frac{M \cdot D}{2 \cdot d}, \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}, 1\right)}} \]

   4. Applied rewrites 80.6%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\right) \cdot D, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\left(\frac{\frac{1}{2}}{d} \cdot M\right) \cdot D}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\left(\frac{\frac{1}{2}}{d} \cdot M\right)} \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      3. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\left(\color{blue}{\frac{\frac{1}{2}}{d}} \cdot M\right) \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      4. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\frac{1}{2} \cdot M}{d}} \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\left(\frac{1}{2} \cdot M\right) \cdot D}{d}}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      6. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot \frac{1}{2}\right)} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      7. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \color{blue}{\frac{1}{2}}\right) \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      8. div-inv N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\frac{M}{2}} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\frac{M}{2} \cdot D}{d}}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\frac{M}{2} \cdot D}}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      11. div-inv N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot \frac{1}{2}\right)} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      12. metadata-eval N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \color{blue}{\frac{1}{2}}\right) \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      13. lower-*.f64 80.6

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot 0.5\right)} \cdot D}{d}, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

   6. Applied rewrites 80.6%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\left(M \cdot 0.5\right) \cdot D}{d}}, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]
   7. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, \color{blue}{\frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}}, 1\right)} \]

      2. frac-2neg N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, \color{blue}{\frac{\mathsf{neg}\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right)}{\mathsf{neg}\left(\left(-\ell\right)\right)}}, 1\right)} \]

   8. Applied rewrites 89.4%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot 0.5\right) \cdot D}{d}, \color{blue}{h \cdot \frac{-0.5 \cdot \left(D \cdot M\right)}{\ell \cdot d}}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 16: 83.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} t_0 := \left(\ell \cdot d\right) \cdot d\\ \mathbf{if}\;M\_m \cdot D\_m \leq 4 \cdot 10^{-161}:\\ \;\;\;\;w0 \cdot 1\\ \mathbf{elif}\;M\_m \cdot D\_m \leq 10^{+115}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(D\_m \cdot M\_m\right) \cdot \left(D\_m \cdot M\_m\right)}{t\_0}, 1\right)}\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \left(M\_m \cdot M\_m\right) \cdot \left(D\_m \cdot \frac{D\_m}{t\_0}\right), 1\right)}\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (let* ((t_0 (* (* l d) d)))
   (if (<= (* M_m D_m) 4e-161)
     (* w0 1.0)
     (if (<= (* M_m D_m) 1e+115)
       (* w0 (sqrt (fma (* h -0.25) (/ (* (* D_m M_m) (* D_m M_m)) t_0) 1.0)))
       (*
        w0
        (sqrt (fma (* h -0.25) (* (* M_m M_m) (* D_m (/ D_m t_0))) 1.0)))))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double t_0 = (l * d) * d;
	double tmp;
	if ((M_m * D_m) <= 4e-161) {
		tmp = w0 * 1.0;
	} else if ((M_m * D_m) <= 1e+115) {
		tmp = w0 * sqrt(fma((h * -0.25), (((D_m * M_m) * (D_m * M_m)) / t_0), 1.0));
	} else {
		tmp = w0 * sqrt(fma((h * -0.25), ((M_m * M_m) * (D_m * (D_m / t_0))), 1.0));
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	t_0 = Float64(Float64(l * d) * d)
	tmp = 0.0
	if (Float64(M_m * D_m) <= 4e-161)
		tmp = Float64(w0 * 1.0);
	elseif (Float64(M_m * D_m) <= 1e+115)
		tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(Float64(Float64(D_m * M_m) * Float64(D_m * M_m)) / t_0), 1.0)));
	else
		tmp = Float64(w0 * sqrt(fma(Float64(h * -0.25), Float64(Float64(M_m * M_m) * Float64(D_m * Float64(D_m / t_0))), 1.0)));
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := Block[{t$95$0 = N[(N[(l * d), $MachinePrecision] * d), $MachinePrecision]}, If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 4e-161], N[(w0 * 1.0), $MachinePrecision], If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 1e+115], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(N[(D$95$m * M$95$m), $MachinePrecision] * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(h * -0.25), $MachinePrecision] * N[(N[(M$95$m * M$95$m), $MachinePrecision] * N[(D$95$m * N[(D$95$m / t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 M D) < 4.00000000000000011e-161

   1. Initial program 83.2%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 77.0%

      \[\leadsto w0 \cdot \color{blue}{1} \]

   if 4.00000000000000011e-161 < (*.f64 M D) < 1e115

   1. Initial program 78.8%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1}} \]

      2. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}{{d}^{2} \cdot \ell}} + 1} \]

      3. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\frac{-1}{4} \cdot \color{blue}{\left(\left({D}^{2} \cdot {M}^{2}\right) \cdot h\right)}}{{d}^{2} \cdot \ell} + 1} \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)\right) \cdot h}}{{d}^{2} \cdot \ell} + 1} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)}{{d}^{2} \cdot \ell} \cdot h} + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \cdot h + 1} \]

      7. lft-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) \cdot h + \color{blue}{\frac{1}{h} \cdot h}} \]

      8. distribute-rgt-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      9. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      10. associate-*r* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      11. rgt-mult-inverse N/A

          \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 67.5%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 71.3%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(\ell \cdot d\right) \cdot \color{blue}{d}}, 1\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 90.4%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(D \cdot M\right) \cdot \left(D \cdot M\right)}{\color{blue}{\left(\ell \cdot d\right)} \cdot d}, 1\right)} \]

   if 1e115 < (*.f64 M D)

   1. Initial program 64.7%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell}}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{-1}{4} \cdot \frac{{D}^{2} \cdot \left({M}^{2} \cdot h\right)}{{d}^{2} \cdot \ell} + 1}} \]

      2. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot \left({M}^{2} \cdot h\right)\right)}{{d}^{2} \cdot \ell}} + 1} \]

      3. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\frac{-1}{4} \cdot \color{blue}{\left(\left({D}^{2} \cdot {M}^{2}\right) \cdot h\right)}}{{d}^{2} \cdot \ell} + 1} \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)\right) \cdot h}}{{d}^{2} \cdot \ell} + 1} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{\frac{-1}{4} \cdot \left({D}^{2} \cdot {M}^{2}\right)}{{d}^{2} \cdot \ell} \cdot h} + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right)} \cdot h + 1} \]

      7. lft-mult-inverse N/A

         \[\leadsto w0 \cdot \sqrt{\left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) \cdot h + \color{blue}{\frac{1}{h} \cdot h}} \]

      8. distribute-rgt-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \frac{1}{h}\right)}} \]

      9. distribute-lft-in N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{h \cdot \left(\frac{-1}{4} \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}\right) + h \cdot \frac{1}{h}}} \]

      10. associate-*r* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}} + h \cdot \frac{1}{h}} \]

      11. rgt-mult-inverse N/A

          \[\leadsto w0 \cdot \sqrt{\left(h \cdot \frac{-1}{4}\right) \cdot \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell} + \color{blue}{1}} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot \frac{-1}{4}, \frac{{D}^{2} \cdot {M}^{2}}{{d}^{2} \cdot \ell}, 1\right)}} \]

   5. Applied rewrites 38.3%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(d \cdot d\right) \cdot \ell}, 1\right)}} \]
   6. Step-by-step derivation

   7. Applied rewrites 45.1%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \frac{\left(\left(M \cdot M\right) \cdot D\right) \cdot D}{\left(\ell \cdot d\right) \cdot \color{blue}{d}}, 1\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 58.4%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(h \cdot -0.25, \left(M \cdot M\right) \cdot \color{blue}{\left(D \cdot \frac{D}{\left(\ell \cdot d\right) \cdot d}\right)}, 1\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 17: 86.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;M\_m \cdot D\_m \leq 2 \cdot 10^{-204}:\\ \;\;\;\;w0 \cdot 1\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M\_m \cdot 0.5\right) \cdot D\_m}{d}, h \cdot \frac{-0.5 \cdot \left(D\_m \cdot M\_m\right)}{\ell \cdot d}, 1\right)}\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* M_m D_m) 2e-204)
   (* w0 1.0)
   (*
    w0
    (sqrt
     (fma
      (/ (* (* M_m 0.5) D_m) d)
      (* h (/ (* -0.5 (* D_m M_m)) (* l d)))
      1.0)))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((M_m * D_m) <= 2e-204) {
		tmp = w0 * 1.0;
	} else {
		tmp = w0 * sqrt(fma((((M_m * 0.5) * D_m) / d), (h * ((-0.5 * (D_m * M_m)) / (l * d))), 1.0));
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64(M_m * D_m) <= 2e-204)
		tmp = Float64(w0 * 1.0);
	else
		tmp = Float64(w0 * sqrt(fma(Float64(Float64(Float64(M_m * 0.5) * D_m) / d), Float64(h * Float64(Float64(-0.5 * Float64(D_m * M_m)) / Float64(l * d))), 1.0)));
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 2e-204], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(N[(N[(M$95$m * 0.5), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $MachinePrecision] * N[(h * N[(N[(-0.5 * N[(D$95$m * M$95$m), $MachinePrecision]), $MachinePrecision] / N[(l * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 M D) < 2e-204

   1. Initial program 82.8%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 76.1%

      \[\leadsto w0 \cdot \color{blue}{1} \]

   if 2e-204 < (*.f64 M D)

   1. Initial program 75.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. sub-neg N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right)}} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right) + 1}} \]

      4. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}\right)\right) + 1} \]

      5. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \color{blue}{\frac{h}{\ell}}\right)\right) + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\ell}}\right)\right) + 1} \]

      7. distribute-neg-frac2 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

      8. lift-pow.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

      9. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}\right)} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

      10. associate-*l* N/A

          \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \left(\frac{M \cdot D}{2 \cdot d} \cdot h\right)}}{\mathsf{neg}\left(\ell\right)} + 1} \]

      11. associate-/l* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\frac{M \cdot D}{2 \cdot d}, \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}, 1\right)}} \]

   4. Applied rewrites 80.0%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\right) \cdot D, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\left(\frac{\frac{1}{2}}{d} \cdot M\right) \cdot D}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\left(\frac{\frac{1}{2}}{d} \cdot M\right)} \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      3. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\left(\color{blue}{\frac{\frac{1}{2}}{d}} \cdot M\right) \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      4. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\frac{1}{2} \cdot M}{d}} \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\left(\frac{1}{2} \cdot M\right) \cdot D}{d}}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      6. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot \frac{1}{2}\right)} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      7. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \color{blue}{\frac{1}{2}}\right) \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      8. div-inv N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\frac{M}{2}} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\frac{M}{2} \cdot D}{d}}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\frac{M}{2} \cdot D}}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      11. div-inv N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot \frac{1}{2}\right)} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      12. metadata-eval N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \color{blue}{\frac{1}{2}}\right) \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      13. lower-*.f64 80.0

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot 0.5\right)} \cdot D}{d}, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

   6. Applied rewrites 80.0%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\left(M \cdot 0.5\right) \cdot D}{d}}, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]
   7. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, \color{blue}{\frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}}, 1\right)} \]

      2. frac-2neg N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, \color{blue}{\frac{\mathsf{neg}\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right)}{\mathsf{neg}\left(\left(-\ell\right)\right)}}, 1\right)} \]

   8. Applied rewrites 88.4%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot 0.5\right) \cdot D}{d}, \color{blue}{h \cdot \frac{-0.5 \cdot \left(D \cdot M\right)}{\ell \cdot d}}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 18: 85.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ \begin{array}{l} \mathbf{if}\;M\_m \cdot D\_m \leq 2 \cdot 10^{-204}:\\ \;\;\;\;w0 \cdot 1\\ \mathbf{else}:\\ \;\;\;\;w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M\_m \cdot 0.5\right) \cdot D\_m}{d}, h \cdot \left(\left(-0.5 \cdot D\_m\right) \cdot \frac{M\_m}{\ell \cdot d}\right), 1\right)}\\ \end{array} \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d)
 :precision binary64
 (if (<= (* M_m D_m) 2e-204)
   (* w0 1.0)
   (*
    w0
    (sqrt
     (fma
      (/ (* (* M_m 0.5) D_m) d)
      (* h (* (* -0.5 D_m) (/ M_m (* l d))))
      1.0)))))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	double tmp;
	if ((M_m * D_m) <= 2e-204) {
		tmp = w0 * 1.0;
	} else {
		tmp = w0 * sqrt(fma((((M_m * 0.5) * D_m) / d), (h * ((-0.5 * D_m) * (M_m / (l * d)))), 1.0));
	}
	return tmp;
}

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	tmp = 0.0
	if (Float64(M_m * D_m) <= 2e-204)
		tmp = Float64(w0 * 1.0);
	else
		tmp = Float64(w0 * sqrt(fma(Float64(Float64(Float64(M_m * 0.5) * D_m) / d), Float64(h * Float64(Float64(-0.5 * D_m) * Float64(M_m / Float64(l * d)))), 1.0)));
	end
	return tmp
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := If[LessEqual[N[(M$95$m * D$95$m), $MachinePrecision], 2e-204], N[(w0 * 1.0), $MachinePrecision], N[(w0 * N[Sqrt[N[(N[(N[(N[(M$95$m * 0.5), $MachinePrecision] * D$95$m), $MachinePrecision] / d), $MachinePrecision] * N[(h * N[(N[(-0.5 * D$95$m), $MachinePrecision] * N[(M$95$m / N[(l * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 M D) < 2e-204

   1. Initial program 82.8%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing

   3. Taylor expanded in M around 0

      \[\leadsto w0 \cdot \color{blue}{1} \]
   4. Step-by-step derivation

   5. Applied rewrites 76.1%

      \[\leadsto w0 \cdot \color{blue}{1} \]

   if 2e-204 < (*.f64 M D)

   1. Initial program 75.4%

      \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}} \]

      2. sub-neg N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{1 + \left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right)}} \]

      3. +-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}\right)\right) + 1}} \]

      4. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}}\right)\right) + 1} \]

      5. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left({\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \color{blue}{\frac{h}{\ell}}\right)\right) + 1} \]

      6. associate-*r/ N/A

         \[\leadsto w0 \cdot \sqrt{\left(\mathsf{neg}\left(\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\ell}}\right)\right) + 1} \]

      7. distribute-neg-frac2 N/A

         \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

      8. lift-pow.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{{\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2}} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

      9. unpow2 N/A

         \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\left(\frac{M \cdot D}{2 \cdot d} \cdot \frac{M \cdot D}{2 \cdot d}\right)} \cdot h}{\mathsf{neg}\left(\ell\right)} + 1} \]

      10. associate-*l* N/A

          \[\leadsto w0 \cdot \sqrt{\frac{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \left(\frac{M \cdot D}{2 \cdot d} \cdot h\right)}}{\mathsf{neg}\left(\ell\right)} + 1} \]

      11. associate-/l* N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\frac{M \cdot D}{2 \cdot d} \cdot \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}} + 1} \]

      12. lower-fma.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\frac{M \cdot D}{2 \cdot d}, \frac{\frac{M \cdot D}{2 \cdot d} \cdot h}{\mathsf{neg}\left(\ell\right)}, 1\right)}} \]

   4. Applied rewrites 80.0%

      \[\leadsto w0 \cdot \sqrt{\color{blue}{\mathsf{fma}\left(\left(\frac{0.5}{d} \cdot M\right) \cdot D, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\left(\frac{\frac{1}{2}}{d} \cdot M\right) \cdot D}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\left(\frac{\frac{1}{2}}{d} \cdot M\right)} \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      3. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\left(\color{blue}{\frac{\frac{1}{2}}{d}} \cdot M\right) \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      4. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\frac{1}{2} \cdot M}{d}} \cdot D, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      5. associate-*l/ N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\left(\frac{1}{2} \cdot M\right) \cdot D}{d}}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      6. *-commutative N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot \frac{1}{2}\right)} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      7. metadata-eval N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \color{blue}{\frac{1}{2}}\right) \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      8. div-inv N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\frac{M}{2}} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      9. lower-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\frac{M}{2} \cdot D}{d}}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      10. lower-*.f64 N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\frac{M}{2} \cdot D}}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      11. div-inv N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot \frac{1}{2}\right)} \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      12. metadata-eval N/A

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \color{blue}{\frac{1}{2}}\right) \cdot D}{d}, \frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

      13. lower-*.f64 80.0

          \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\color{blue}{\left(M \cdot 0.5\right)} \cdot D}{d}, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]

   6. Applied rewrites 80.0%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\color{blue}{\frac{\left(M \cdot 0.5\right) \cdot D}{d}}, \frac{\left(D \cdot 0.5\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}, 1\right)} \]
   7. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, \color{blue}{\frac{\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)}{-\ell}}, 1\right)} \]

      2. frac-2neg N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, \color{blue}{\frac{\mathsf{neg}\left(\left(D \cdot \frac{1}{2}\right) \cdot \left(\frac{M}{d} \cdot h\right)\right)}{\mathsf{neg}\left(\left(-\ell\right)\right)}}, 1\right)} \]

   8. Applied rewrites 88.4%

      \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot 0.5\right) \cdot D}{d}, \color{blue}{h \cdot \frac{-0.5 \cdot \left(D \cdot M\right)}{\ell \cdot d}}, 1\right)} \]
   9. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, h \cdot \color{blue}{\frac{\frac{-1}{2} \cdot \left(D \cdot M\right)}{\ell \cdot d}}, 1\right)} \]

      2. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, h \cdot \frac{\color{blue}{\frac{-1}{2} \cdot \left(D \cdot M\right)}}{\ell \cdot d}, 1\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, h \cdot \frac{\frac{-1}{2} \cdot \color{blue}{\left(D \cdot M\right)}}{\ell \cdot d}, 1\right)} \]

      4. associate-*r* N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, h \cdot \frac{\color{blue}{\left(\frac{-1}{2} \cdot D\right) \cdot M}}{\ell \cdot d}, 1\right)} \]

      5. associate-/l* N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, h \cdot \color{blue}{\left(\left(\frac{-1}{2} \cdot D\right) \cdot \frac{M}{\ell \cdot d}\right)}, 1\right)} \]

      6. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, h \cdot \color{blue}{\left(\left(\frac{-1}{2} \cdot D\right) \cdot \frac{M}{\ell \cdot d}\right)}, 1\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot \frac{1}{2}\right) \cdot D}{d}, h \cdot \left(\color{blue}{\left(\frac{-1}{2} \cdot D\right)} \cdot \frac{M}{\ell \cdot d}\right), 1\right)} \]

      8. lower-/.f64 85.2

         \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot 0.5\right) \cdot D}{d}, h \cdot \left(\left(-0.5 \cdot D\right) \cdot \color{blue}{\frac{M}{\ell \cdot d}}\right), 1\right)} \]

   10. Applied rewrites 85.2%

       \[\leadsto w0 \cdot \sqrt{\mathsf{fma}\left(\frac{\left(M \cdot 0.5\right) \cdot D}{d}, h \cdot \color{blue}{\left(\left(-0.5 \cdot D\right) \cdot \frac{M}{\ell \cdot d}\right)}, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 19: 67.2% accurate, 26.2× speedup

Math

\[\begin{array}{l} D_m = \left|D\right| \\ M_m = \left|M\right| \\ [w0, M_m, D_m, h, l, d] = \mathsf{sort}([w0, M_m, D_m, h, l, d])\\ \\ w0 \cdot 1 \end{array} \]

FPCore

D_m = (fabs.f64 D)
M_m = (fabs.f64 M)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
(FPCore (w0 M_m D_m h l d) :precision binary64 (* w0 1.0))

C

D_m = fabs(D);
M_m = fabs(M);
assert(w0 < M_m && M_m < D_m && D_m < h && h < l && l < d);
double code(double w0, double M_m, double D_m, double h, double l, double d) {
	return w0 * 1.0;
}

Fortran

D_m = abs(d)
M_m = abs(m)
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
real(8) function code(w0, m_m, d_m, h, l, d)
    real(8), intent (in) :: w0
    real(8), intent (in) :: m_m
    real(8), intent (in) :: d_m
    real(8), intent (in) :: h
    real(8), intent (in) :: l
    real(8), intent (in) :: d
    code = w0 * 1.0d0
end function

Java

D_m = Math.abs(D);
M_m = Math.abs(M);
assert w0 < M_m && M_m < D_m && D_m < h && h < l && l < d;
public static double code(double w0, double M_m, double D_m, double h, double l, double d) {
	return w0 * 1.0;
}

Python

D_m = math.fabs(D)
M_m = math.fabs(M)
[w0, M_m, D_m, h, l, d] = sort([w0, M_m, D_m, h, l, d])
def code(w0, M_m, D_m, h, l, d):
	return w0 * 1.0

Julia

D_m = abs(D)
M_m = abs(M)
w0, M_m, D_m, h, l, d = sort([w0, M_m, D_m, h, l, d])
function code(w0, M_m, D_m, h, l, d)
	return Float64(w0 * 1.0)
end

MATLAB

D_m = abs(D);
M_m = abs(M);
w0, M_m, D_m, h, l, d = num2cell(sort([w0, M_m, D_m, h, l, d])){:}
function tmp = code(w0, M_m, D_m, h, l, d)
	tmp = w0 * 1.0;
end

Wolfram

D_m = N[Abs[D], $MachinePrecision]
M_m = N[Abs[M], $MachinePrecision]
NOTE: w0, M_m, D_m, h, l, and d should be sorted in increasing order before calling this function.
code[w0_, M$95$m_, D$95$m_, h_, l_, d_] := N[(w0 * 1.0), $MachinePrecision]

Derivation

1. Initial program 80.2%

   \[w0 \cdot \sqrt{1 - {\left(\frac{M \cdot D}{2 \cdot d}\right)}^{2} \cdot \frac{h}{\ell}} \]
2. Add Preprocessing

3. Taylor expanded in M around 0

   \[\leadsto w0 \cdot \color{blue}{1} \]
4. Step-by-step derivation

5. Applied rewrites 70.5%

   \[\leadsto w0 \cdot \color{blue}{1} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024312 
(FPCore (w0 M D h l d)
  :name "Henrywood and Agarwal, Equation (9a)"
  :precision binary64
  (* w0 (sqrt (- 1.0 (* (pow (/ (* M D) (* 2.0 d)) 2.0) (/ h l))))))