Henrywood and Agarwal, Equation (13)

Percentage Accurate: 25.1% → 54.2%

Time: 15.2s

Alternatives: 12

Speedup: 156.0×

• Could not converge on a ground truth

  1. c0 = -6.424317158143397e+264
  2. w = -1.0327339271355824e-247
  3. h = -2.481999435004268e-259
  4. D = 2.279856419638977e-245
  5. d = 2.6718391820609753e+158
  6. M = 1.1537003449050697e-198

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	return (c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, w, h, d, d_1, m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: w
    real(8), intent (in) :: h
    real(8), intent (in) :: d
    real(8), intent (in) :: d_1
    real(8), intent (in) :: m
    real(8) :: t_0
    t_0 = (c0 * (d_1 * d_1)) / ((w * h) * (d * d))
    code = (c0 / (2.0d0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (m * m))))
end function

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	return (c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))));
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	return (c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	return Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M)))))
end

MATLAB

function tmp = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = (c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))));
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Initial Program: 25.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	return (c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, w, h, d, d_1, m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: w
    real(8), intent (in) :: h
    real(8), intent (in) :: d
    real(8), intent (in) :: d_1
    real(8), intent (in) :: m
    real(8) :: t_0
    t_0 = (c0 * (d_1 * d_1)) / ((w * h) * (d * d))
    code = (c0 / (2.0d0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (m * m))))
end function

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	return (c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))));
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	return (c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	return Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M)))))
end

MATLAB

function tmp = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = (c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))));
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Alternative 1: 54.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\frac{{\left(\frac{d}{D} \cdot c0\right)}^{2}}{\left(h \cdot w\right) \cdot w}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (/ (pow (* (/ d D) c0) 2.0) (* (* h w) w))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = pow(((d / D) * c0), 2.0) / ((h * w) * w);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = Math.pow(((d / D) * c0), 2.0) / ((h * w) * w);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = math.pow(((d / D) * c0), 2.0) / ((h * w) * w)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64((Float64(Float64(d / D) * c0) ^ 2.0) / Float64(Float64(h * w) * w));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = (((d / D) * c0) ^ 2.0) / ((h * w) * w);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[Power[N[(N[(d / D), $MachinePrecision] * c0), $MachinePrecision], 2.0], $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * w), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around inf

      \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot {d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{{d}^{2} \cdot {c0}^{2}}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \cdot {c0}^{2} \]

      5. unpow2 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      7. associate-*r* N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right)} \cdot {w}^{2}} \cdot {c0}^{2} \]

      10. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      12. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      13. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      14. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

      15. lower-*.f64 74.6

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(c0 \cdot c0\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 80.5%

      \[\leadsto \frac{\frac{{\left(\frac{d}{D}\right)}^{2}}{w}}{h} \cdot \color{blue}{\left(\frac{c0}{w} \cdot c0\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 87.7%

      \[\leadsto \frac{{\left(\frac{d}{D} \cdot c0\right)}^{2}}{\color{blue}{\left(h \cdot w\right) \cdot w}} \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

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

Alternative 2: 55.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\left(\frac{c0}{\left(h \cdot w\right) \cdot D} \cdot \frac{\frac{c0}{w}}{D}\right) \cdot \left(d \cdot d\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (* (* (/ c0 (* (* h w) D)) (/ (/ c0 w) D)) (* d d))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = ((c0 / ((h * w) * D)) * ((c0 / w) / D)) * (d * d);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = ((c0 / ((h * w) * D)) * ((c0 / w) / D)) * (d * d);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = ((c0 / ((h * w) * D)) * ((c0 / w) / D)) * (d * d)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64(Float64(Float64(c0 / Float64(Float64(h * w) * D)) * Float64(Float64(c0 / w) / D)) * Float64(d * d));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = ((c0 / ((h * w) * D)) * ((c0 / w) / D)) * (d * d);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(c0 / N[(N[(h * w), $MachinePrecision] * D), $MachinePrecision]), $MachinePrecision] * N[(N[(c0 / w), $MachinePrecision] / D), $MachinePrecision]), $MachinePrecision] * N[(d * d), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in d around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 65.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{{d}^{4}}, -0.25, \frac{c0 \cdot c0}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)}\right) \cdot \left(d \cdot d\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 71.1%

      \[\leadsto \mathsf{fma}\left(\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{{d}^{4}}, -0.25, \frac{c0}{\left(w \cdot D\right) \cdot \left(h \cdot D\right)} \cdot \frac{c0}{w}\right) \cdot \left(d \cdot d\right) \]

   8. Taylor expanded in c0 around inf

      \[\leadsto \frac{{c0}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot \left(\color{blue}{d} \cdot d\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 73.2%

       \[\leadsto \frac{c0 \cdot c0}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(\color{blue}{d} \cdot d\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 86.9%

       \[\leadsto \left(\frac{c0}{\left(h \cdot w\right) \cdot D} \cdot \frac{\frac{c0}{w}}{D}\right) \cdot \left(d \cdot d\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

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

Alternative 3: 53.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\frac{d \cdot d}{\left(\left(h \cdot w\right) \cdot D\right) \cdot D} \cdot \left(\frac{c0}{w} \cdot c0\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (* (/ (* d d) (* (* (* h w) D) D)) (* (/ c0 w) c0))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = ((d * d) / (((h * w) * D) * D)) * ((c0 / w) * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d * d) / (((h * w) * D) * D)) * ((c0 / w) * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = ((d * d) / (((h * w) * D) * D)) * ((c0 / w) * c0)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64(Float64(Float64(d * d) / Float64(Float64(Float64(h * w) * D) * D)) * Float64(Float64(c0 / w) * c0));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = ((d * d) / (((h * w) * D) * D)) * ((c0 / w) * c0);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d * d), $MachinePrecision] / N[(N[(N[(h * w), $MachinePrecision] * D), $MachinePrecision] * D), $MachinePrecision]), $MachinePrecision] * N[(N[(c0 / w), $MachinePrecision] * c0), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around inf

      \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot {d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{{d}^{2} \cdot {c0}^{2}}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \cdot {c0}^{2} \]

      5. unpow2 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      7. associate-*r* N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right)} \cdot {w}^{2}} \cdot {c0}^{2} \]

      10. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      12. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      13. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      14. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

      15. lower-*.f64 74.6

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(c0 \cdot c0\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 80.5%

      \[\leadsto \frac{\frac{{\left(\frac{d}{D}\right)}^{2}}{w}}{h} \cdot \color{blue}{\left(\frac{c0}{w} \cdot c0\right)} \]
   8. Step-by-step derivation

   9. Applied rewrites 83.5%

      \[\leadsto \frac{\left(-d\right) \cdot d}{\left(\left(h \cdot w\right) \cdot D\right) \cdot \left(-D\right)} \cdot \left(\color{blue}{\frac{c0}{w}} \cdot c0\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

      \[\leadsto \color{blue}{0} \]
3. Recombined 2 regimes into one program.

4. Final simplification 54.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\frac{d \cdot d}{\left(\left(h \cdot w\right) \cdot D\right) \cdot D} \cdot \left(\frac{c0}{w} \cdot c0\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 51.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\left(\frac{d}{\left(\left(D \cdot w\right) \cdot D\right) \cdot h} \cdot \frac{d}{w}\right) \cdot \left(c0 \cdot c0\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (* (* (/ d (* (* (* D w) D) h)) (/ d w)) (* c0 c0))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = ((d / (((D * w) * D) * h)) * (d / w)) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d / (((D * w) * D) * h)) * (d / w)) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = ((d / (((D * w) * D) * h)) * (d / w)) * (c0 * c0)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64(Float64(Float64(d / Float64(Float64(Float64(D * w) * D) * h)) * Float64(d / w)) * Float64(c0 * c0));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = ((d / (((D * w) * D) * h)) * (d / w)) * (c0 * c0);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d / N[(N[(N[(D * w), $MachinePrecision] * D), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision] * N[(d / w), $MachinePrecision]), $MachinePrecision] * N[(c0 * c0), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around inf

      \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot {d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{{d}^{2} \cdot {c0}^{2}}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \cdot {c0}^{2} \]

      5. unpow2 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      7. associate-*r* N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right)} \cdot {w}^{2}} \cdot {c0}^{2} \]

      10. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      12. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      13. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      14. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

      15. lower-*.f64 74.6

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(c0 \cdot c0\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 82.3%

      \[\leadsto \left(\frac{d}{\left(\left(D \cdot w\right) \cdot D\right) \cdot h} \cdot \frac{d}{w}\right) \cdot \left(\color{blue}{c0} \cdot c0\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

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

Alternative 5: 54.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\left(c0 \cdot \frac{\frac{c0}{w}}{\left(\left(D \cdot w\right) \cdot D\right) \cdot h}\right) \cdot \left(d \cdot d\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (* (* c0 (/ (/ c0 w) (* (* (* D w) D) h))) (* d d))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = (c0 * ((c0 / w) / (((D * w) * D) * h))) * (d * d);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = (c0 * ((c0 / w) / (((D * w) * D) * h))) * (d * d);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = (c0 * ((c0 / w) / (((D * w) * D) * h))) * (d * d)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64(Float64(c0 * Float64(Float64(c0 / w) / Float64(Float64(Float64(D * w) * D) * h))) * Float64(d * d));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = (c0 * ((c0 / w) / (((D * w) * D) * h))) * (d * d);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(c0 * N[(N[(c0 / w), $MachinePrecision] / N[(N[(N[(D * w), $MachinePrecision] * D), $MachinePrecision] * h), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * d), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in d around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 65.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{{d}^{4}}, -0.25, \frac{c0 \cdot c0}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)}\right) \cdot \left(d \cdot d\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 71.1%

      \[\leadsto \mathsf{fma}\left(\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{{d}^{4}}, -0.25, \frac{c0}{\left(w \cdot D\right) \cdot \left(h \cdot D\right)} \cdot \frac{c0}{w}\right) \cdot \left(d \cdot d\right) \]

   8. Taylor expanded in c0 around inf

      \[\leadsto \frac{{c0}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot \left(\color{blue}{d} \cdot d\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 73.2%

       \[\leadsto \frac{c0 \cdot c0}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(\color{blue}{d} \cdot d\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 81.0%

       \[\leadsto \left(c0 \cdot \frac{\frac{c0}{w}}{\left(\left(D \cdot w\right) \cdot D\right) \cdot h}\right) \cdot \left(d \cdot d\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

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

Alternative 6: 51.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\frac{d \cdot d}{w \cdot \left(\left(\left(h \cdot w\right) \cdot D\right) \cdot D\right)} \cdot \left(c0 \cdot c0\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (* (/ (* d d) (* w (* (* (* h w) D) D))) (* c0 c0))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = ((d * d) / (w * (((h * w) * D) * D))) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d * d) / (w * (((h * w) * D) * D))) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = ((d * d) / (w * (((h * w) * D) * D))) * (c0 * c0)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64(Float64(Float64(d * d) / Float64(w * Float64(Float64(Float64(h * w) * D) * D))) * Float64(c0 * c0));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = ((d * d) / (w * (((h * w) * D) * D))) * (c0 * c0);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d * d), $MachinePrecision] / N[(w * N[(N[(N[(h * w), $MachinePrecision] * D), $MachinePrecision] * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(c0 * c0), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around inf

      \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot {d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{{d}^{2} \cdot {c0}^{2}}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \cdot {c0}^{2} \]

      5. unpow2 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      7. associate-*r* N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right)} \cdot {w}^{2}} \cdot {c0}^{2} \]

      10. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      12. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      13. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      14. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

      15. lower-*.f64 74.6

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(c0 \cdot c0\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 80.7%

      \[\leadsto \frac{d \cdot d}{\left(-w\right) \cdot \left(\left(\left(h \cdot w\right) \cdot D\right) \cdot \left(-D\right)\right)} \cdot \left(c0 \cdot c0\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

      \[\leadsto \color{blue}{0} \]
3. Recombined 2 regimes into one program.

4. Final simplification 53.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\frac{d \cdot d}{w \cdot \left(\left(\left(h \cdot w\right) \cdot D\right) \cdot D\right)} \cdot \left(c0 \cdot c0\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 51.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\frac{d \cdot d}{\left(\left(h \cdot w\right) \cdot D\right) \cdot \left(D \cdot w\right)} \cdot \left(c0 \cdot c0\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (* (/ (* d d) (* (* (* h w) D) (* D w))) (* c0 c0))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = ((d * d) / (((h * w) * D) * (D * w))) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d * d) / (((h * w) * D) * (D * w))) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = ((d * d) / (((h * w) * D) * (D * w))) * (c0 * c0)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64(Float64(Float64(d * d) / Float64(Float64(Float64(h * w) * D) * Float64(D * w))) * Float64(c0 * c0));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = ((d * d) / (((h * w) * D) * (D * w))) * (c0 * c0);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d * d), $MachinePrecision] / N[(N[(N[(h * w), $MachinePrecision] * D), $MachinePrecision] * N[(D * w), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(c0 * c0), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around inf

      \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot {d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{{d}^{2} \cdot {c0}^{2}}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \cdot {c0}^{2} \]

      5. unpow2 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      7. associate-*r* N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right)} \cdot {w}^{2}} \cdot {c0}^{2} \]

      10. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      12. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      13. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      14. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

      15. lower-*.f64 74.6

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(c0 \cdot c0\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 80.7%

      \[\leadsto \frac{d \cdot d}{\left(\left(h \cdot w\right) \cdot D\right) \cdot \left(D \cdot w\right)} \cdot \left(c0 \cdot c0\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

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

Alternative 8: 51.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\frac{d \cdot d}{\left(D \cdot w\right) \cdot \left(\left(D \cdot h\right) \cdot w\right)} \cdot \left(c0 \cdot c0\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (* (/ (* d d) (* (* D w) (* (* D h) w))) (* c0 c0))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = ((d * d) / ((D * w) * ((D * h) * w))) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d * d) / ((D * w) * ((D * h) * w))) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = ((d * d) / ((D * w) * ((D * h) * w))) * (c0 * c0)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64(Float64(Float64(d * d) / Float64(Float64(D * w) * Float64(Float64(D * h) * w))) * Float64(c0 * c0));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = ((d * d) / ((D * w) * ((D * h) * w))) * (c0 * c0);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d * d), $MachinePrecision] / N[(N[(D * w), $MachinePrecision] * N[(N[(D * h), $MachinePrecision] * w), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(c0 * c0), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around inf

      \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot {d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\color{blue}{{d}^{2} \cdot {c0}^{2}}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \]

      2. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)}} \cdot {c0}^{2} \]

      5. unpow2 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      6. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{d \cdot d}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot {c0}^{2} \]

      7. associate-*r* N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      8. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right) \cdot {w}^{2}}} \cdot {c0}^{2} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{d \cdot d}{\color{blue}{\left({D}^{2} \cdot h\right)} \cdot {w}^{2}} \cdot {c0}^{2} \]

      10. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\color{blue}{\left(D \cdot D\right)} \cdot h\right) \cdot {w}^{2}} \cdot {c0}^{2} \]

      12. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      13. lower-*.f64 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \color{blue}{\left(w \cdot w\right)}} \cdot {c0}^{2} \]

      14. unpow2 N/A

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

      15. lower-*.f64 74.6

          \[\leadsto \frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \color{blue}{\left(c0 \cdot c0\right)} \]

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\frac{d \cdot d}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(c0 \cdot c0\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 80.5%

      \[\leadsto \frac{d \cdot d}{\left(D \cdot w\right) \cdot \left(\left(D \cdot h\right) \cdot w\right)} \cdot \left(c0 \cdot c0\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

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

Alternative 9: 51.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\frac{c0 \cdot c0}{\left(\left(h \cdot w\right) \cdot D\right) \cdot \left(D \cdot w\right)} \cdot \left(d \cdot d\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (* (/ (* c0 c0) (* (* (* h w) D) (* D w))) (* d d))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = ((c0 * c0) / (((h * w) * D) * (D * w))) * (d * d);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = ((c0 * c0) / (((h * w) * D) * (D * w))) * (d * d);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = ((c0 * c0) / (((h * w) * D) * (D * w))) * (d * d)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64(Float64(Float64(c0 * c0) / Float64(Float64(Float64(h * w) * D) * Float64(D * w))) * Float64(d * d));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = ((c0 * c0) / (((h * w) * D) * (D * w))) * (d * d);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(c0 * c0), $MachinePrecision] / N[(N[(N[(h * w), $MachinePrecision] * D), $MachinePrecision] * N[(D * w), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * d), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in d around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 65.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{{d}^{4}}, -0.25, \frac{c0 \cdot c0}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)}\right) \cdot \left(d \cdot d\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 71.1%

      \[\leadsto \mathsf{fma}\left(\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{{d}^{4}}, -0.25, \frac{c0}{\left(w \cdot D\right) \cdot \left(h \cdot D\right)} \cdot \frac{c0}{w}\right) \cdot \left(d \cdot d\right) \]

   8. Taylor expanded in c0 around inf

      \[\leadsto \frac{{c0}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot \left(\color{blue}{d} \cdot d\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 73.2%

       \[\leadsto \frac{c0 \cdot c0}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(\color{blue}{d} \cdot d\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 79.3%

       \[\leadsto \frac{c0 \cdot c0}{\left(\left(h \cdot w\right) \cdot D\right) \cdot \left(D \cdot w\right)} \cdot \left(d \cdot d\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

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

Alternative 10: 50.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\frac{c0}{2 \cdot w} \cdot \left(t\_0 + \sqrt{t\_0 \cdot t\_0 - M \cdot M}\right) \leq \infty:\\ \;\;\;\;\frac{c0 \cdot c0}{\left(D \cdot h\right) \cdot \left(\left(D \cdot w\right) \cdot w\right)} \cdot \left(d \cdot d\right)\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (let* ((t_0 (/ (* c0 (* d d)) (* (* w h) (* D D)))))
   (if (<=
        (* (/ c0 (* 2.0 w)) (+ t_0 (sqrt (- (* t_0 t_0) (* M M)))))
        INFINITY)
     (* (/ (* c0 c0) (* (* D h) (* (* D w) w))) (* d d))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= ((double) INFINITY)) {
		tmp = ((c0 * c0) / ((D * h) * ((D * w) * w))) * (d * d);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	double tmp;
	if (((c0 / (2.0 * w)) * (t_0 + Math.sqrt(((t_0 * t_0) - (M * M))))) <= Double.POSITIVE_INFINITY) {
		tmp = ((c0 * c0) / ((D * h) * ((D * w) * w))) * (d * d);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D))
	tmp = 0
	if ((c0 / (2.0 * w)) * (t_0 + math.sqrt(((t_0 * t_0) - (M * M))))) <= math.inf:
		tmp = ((c0 * c0) / ((D * h) * ((D * w) * w))) * (d * d)
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(c0 * Float64(d * d)) / Float64(Float64(w * h) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(c0 / Float64(2.0 * w)) * Float64(t_0 + sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))))) <= Inf)
		tmp = Float64(Float64(Float64(c0 * c0) / Float64(Float64(D * h) * Float64(Float64(D * w) * w))) * Float64(d * d));
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = (c0 * (d * d)) / ((w * h) * (D * D));
	tmp = 0.0;
	if (((c0 / (2.0 * w)) * (t_0 + sqrt(((t_0 * t_0) - (M * M))))) <= Inf)
		tmp = ((c0 * c0) / ((D * h) * ((D * w) * w))) * (d * d);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(c0 * N[(d * d), $MachinePrecision]), $MachinePrecision] / N[(N[(w * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(c0 / N[(2.0 * w), $MachinePrecision]), $MachinePrecision] * N[(t$95$0 + N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(c0 * c0), $MachinePrecision] / N[(N[(D * h), $MachinePrecision] * N[(N[(D * w), $MachinePrecision] * w), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(d * d), $MachinePrecision]), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M))))) < +inf.0

   1. Initial program 79.6%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in d around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 65.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{{d}^{4}}, -0.25, \frac{c0 \cdot c0}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)}\right) \cdot \left(d \cdot d\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 71.1%

      \[\leadsto \mathsf{fma}\left(\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{{d}^{4}}, -0.25, \frac{c0}{\left(w \cdot D\right) \cdot \left(h \cdot D\right)} \cdot \frac{c0}{w}\right) \cdot \left(d \cdot d\right) \]

   8. Taylor expanded in c0 around inf

      \[\leadsto \frac{{c0}^{2}}{{D}^{2} \cdot \left(h \cdot {w}^{2}\right)} \cdot \left(\color{blue}{d} \cdot d\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 73.2%

       \[\leadsto \frac{c0 \cdot c0}{\left(\left(D \cdot D\right) \cdot h\right) \cdot \left(w \cdot w\right)} \cdot \left(\color{blue}{d} \cdot d\right) \]
   11. Step-by-step derivation

   12. Applied rewrites 77.7%

       \[\leadsto \frac{c0 \cdot c0}{\left(D \cdot h\right) \cdot \left(\left(D \cdot w\right) \cdot w\right)} \cdot \left(d \cdot d\right) \]

   if +inf.0 < (*.f64 (/.f64 c0 (*.f64 #s(literal 2 binary64) w)) (+.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (sqrt.f64 (-.f64 (*.f64 (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D))) (/.f64 (*.f64 c0 (*.f64 d d)) (*.f64 (*.f64 w h) (*.f64 D D)))) (*.f64 M M)))))

   1. Initial program 0.0%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 32.0%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.8%

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

Alternative 11: 34.2% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d \leq 8.2 \cdot 10^{+127}:\\ \;\;\;\;\frac{\left(\left(M \cdot M\right) \cdot h\right) \cdot \left(D \cdot D\right)}{d \cdot d} \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (c0 w h D d M)
 :precision binary64
 (if (<= d 8.2e+127) (* (/ (* (* (* M M) h) (* D D)) (* d d)) 0.25) 0.0))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double tmp;
	if (d <= 8.2e+127) {
		tmp = ((((M * M) * h) * (D * D)) / (d * d)) * 0.25;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, w, h, d, d_1, m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: w
    real(8), intent (in) :: h
    real(8), intent (in) :: d
    real(8), intent (in) :: d_1
    real(8), intent (in) :: m
    real(8) :: tmp
    if (d_1 <= 8.2d+127) then
        tmp = ((((m * m) * h) * (d * d)) / (d_1 * d_1)) * 0.25d0
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	double tmp;
	if (d <= 8.2e+127) {
		tmp = ((((M * M) * h) * (D * D)) / (d * d)) * 0.25;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(c0, w, h, D, d, M):
	tmp = 0
	if d <= 8.2e+127:
		tmp = ((((M * M) * h) * (D * D)) / (d * d)) * 0.25
	else:
		tmp = 0.0
	return tmp

Julia

function code(c0, w, h, D, d, M)
	tmp = 0.0
	if (d <= 8.2e+127)
		tmp = Float64(Float64(Float64(Float64(Float64(M * M) * h) * Float64(D * D)) / Float64(d * d)) * 0.25);
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	tmp = 0.0;
	if (d <= 8.2e+127)
		tmp = ((((M * M) * h) * (D * D)) / (d * d)) * 0.25;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := If[LessEqual[d, 8.2e+127], N[(N[(N[(N[(N[(M * M), $MachinePrecision] * h), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision] / N[(d * d), $MachinePrecision]), $MachinePrecision] * 0.25), $MachinePrecision], 0.0]

Derivation

1. Split input into 2 regimes

2. if d < 8.19999999999999965e127

   1. Initial program 20.8%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 14.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{D \cdot D}{c0 \cdot c0} \cdot \left(\left(M \cdot M\right) \cdot \frac{h}{d \cdot d}\right), 0.25, \frac{0}{w}\right) \cdot \left(c0 \cdot c0\right)} \]

   6. Taylor expanded in c0 around 0

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

   8. Applied rewrites 33.7%

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

   if 8.19999999999999965e127 < d

   1. Initial program 18.3%

      \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in c0 around -inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

   5. Applied rewrites 35.3%

      \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 45.7%

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

Alternative 12: 32.8% accurate, 156.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (c0 w h D d M) :precision binary64 0.0)

C

double code(double c0, double w, double h, double D, double d, double M) {
	return 0.0;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, w, h, d, d_1, m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: w
    real(8), intent (in) :: h
    real(8), intent (in) :: d
    real(8), intent (in) :: d_1
    real(8), intent (in) :: m
    code = 0.0d0
end function

Java

public static double code(double c0, double w, double h, double D, double d, double M) {
	return 0.0;
}

Python

def code(c0, w, h, D, d, M):
	return 0.0

Julia

function code(c0, w, h, D, d, M)
	return 0.0
end

MATLAB

function tmp = code(c0, w, h, D, d, M)
	tmp = 0.0;
end

Wolfram

code[c0_, w_, h_, D_, d_, M_] := 0.0

Derivation

1. Initial program 20.2%

   \[\frac{c0}{2 \cdot w} \cdot \left(\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} + \sqrt{\frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} \cdot \frac{c0 \cdot \left(d \cdot d\right)}{\left(w \cdot h\right) \cdot \left(D \cdot D\right)} - M \cdot M}\right) \]
2. Add Preprocessing

3. Taylor expanded in c0 around -inf

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

   1. *-commutative N/A

      \[\leadsto \color{blue}{\frac{{c0}^{2} \cdot \left(-1 \cdot \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)} + \frac{{d}^{2}}{{D}^{2} \cdot \left(h \cdot w\right)}\right)}{w} \cdot \frac{-1}{2}} \]

5. Applied rewrites 25.4%

   \[\leadsto \color{blue}{\frac{0 \cdot \left(c0 \cdot c0\right)}{w} \cdot -0.5} \]
6. Step-by-step derivation

7. Applied rewrites 35.0%

   \[\leadsto \color{blue}{0} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024352 
(FPCore (c0 w h D d M)
  :name "Henrywood and Agarwal, Equation (13)"
  :precision binary64
  (* (/ c0 (* 2.0 w)) (+ (/ (* c0 (* d d)) (* (* w h) (* D D))) (sqrt (- (* (/ (* c0 (* d d)) (* (* w h) (* D D))) (/ (* c0 (* d d)) (* (* w h) (* D D)))) (* M M))))))