Henrywood and Agarwal, Equation (13)

Percentage Accurate: 24.9% → 56.9%

Time: 9.0s

Alternatives: 10

Speedup: 156.0×

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

real(8) function code(c0, w, h, d, d_1, m)
    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: 24.9% 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

real(8) function code(c0, w, h, d, d_1, m)
    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: 56.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= ((double) INFINITY)) {
		tmp = pow((((d / D) * c0) / w), 2.0) / h;
	} 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 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((Math.sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Double.POSITIVE_INFINITY) {
		tmp = Math.pow((((d / D) * c0) / w), 2.0) / h;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(N[(d * d), $MachinePrecision] * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision] * N[(c0 / N[(w * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[Power[N[(N[(N[(d / D), $MachinePrecision] * c0), $MachinePrecision] / w), $MachinePrecision], 2.0], $MachinePrecision] / h), $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 75.9%

      \[\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 54.5

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

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

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

   9. Applied rewrites 80.7%

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

   11. Applied rewrites 80.7%

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

   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. associate-/l* N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. div0 N/A

         \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

      6. mul0-rgt N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

      7. metadata-eval 53.0

         \[\leadsto \color{blue}{0} \]

   5. Applied rewrites 53.0%

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

4. Final simplification 61.7%

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

Alternative 2: 57.1% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = (d * c0) / (D * w);
	double t_1 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((sqrt(((t_1 * t_1) - (M * M))) + t_1) * (c0 / (w * 2.0))) <= ((double) INFINITY)) {
		tmp = (t_0 * t_0) / h;
	} 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 = (d * c0) / (D * w);
	double t_1 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((Math.sqrt(((t_1 * t_1) - (M * M))) + t_1) * (c0 / (w * 2.0))) <= Double.POSITIVE_INFINITY) {
		tmp = (t_0 * t_0) / h;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(d * c0), $MachinePrecision] / N[(D * w), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(d * d), $MachinePrecision] * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[Sqrt[N[(N[(t$95$1 * t$95$1), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + t$95$1), $MachinePrecision] * N[(c0 / N[(w * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(t$95$0 * t$95$0), $MachinePrecision] / h), $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 75.9%

      \[\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 54.5

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

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

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

   9. Applied rewrites 80.7%

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

   11. Applied rewrites 80.7%

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

   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. associate-/l* N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. div0 N/A

         \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

      6. mul0-rgt N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

      7. metadata-eval 53.0

         \[\leadsto \color{blue}{0} \]

   5. Applied rewrites 53.0%

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

4. Final simplification 61.7%

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

Alternative 3: 56.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= ((double) INFINITY)) {
		tmp = ((d / w) * (c0 / D)) * ((d * c0) / ((h * w) * 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 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((Math.sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d / w) * (c0 / D)) * ((d * c0) / ((h * w) * D));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(N[(d * d), $MachinePrecision] * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision] * N[(c0 / N[(w * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d / w), $MachinePrecision] * N[(c0 / D), $MachinePrecision]), $MachinePrecision] * N[(N[(d * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * D), $MachinePrecision]), $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 75.9%

      \[\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 54.5

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

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

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

   9. Applied rewrites 66.9%

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

   11. Applied rewrites 78.2%

       \[\leadsto \frac{d \cdot c0}{\left(h \cdot w\right) \cdot D} \cdot \color{blue}{\left(\frac{c0}{D} \cdot \frac{d}{w}\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. associate-/l* N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. div0 N/A

         \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

      6. mul0-rgt N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

      7. metadata-eval 53.0

         \[\leadsto \color{blue}{0} \]

   5. Applied rewrites 53.0%

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

4. Final simplification 60.9%

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

Alternative 4: 54.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= ((double) INFINITY)) {
		tmp = ((d * c0) / (((h * w) * w) * D)) * ((d / D) * 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 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((Math.sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d * c0) / (((h * w) * w) * D)) * ((d / D) * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(N[(d * d), $MachinePrecision] * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision] * N[(c0 / N[(w * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d * c0), $MachinePrecision] / N[(N[(N[(h * w), $MachinePrecision] * w), $MachinePrecision] * D), $MachinePrecision]), $MachinePrecision] * N[(N[(d / D), $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 75.9%

      \[\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 54.5

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

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

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

   9. Applied rewrites 76.9%

      \[\leadsto \frac{d \cdot c0}{\left(\left(h \cdot w\right) \cdot w\right) \cdot D} \cdot \color{blue}{\left(\frac{d}{D} \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. associate-/l* N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. div0 N/A

         \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

      6. mul0-rgt N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

      7. metadata-eval 53.0

         \[\leadsto \color{blue}{0} \]

   5. Applied rewrites 53.0%

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

4. Final simplification 60.5%

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

Alternative 5: 54.2% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= ((double) INFINITY)) {
		tmp = ((d * c0) / ((h * w) * w)) * ((d * c0) / (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 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((Math.sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d * c0) / ((h * w) * w)) * ((d * c0) / (D * D));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = ((d * d) * c0) / ((h * w) * (D * D));
	tmp = 0.0;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Inf)
		tmp = ((d * c0) / ((h * w) * w)) * ((d * c0) / (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[(N[(d * d), $MachinePrecision] * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision] * N[(c0 / N[(w * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * w), $MachinePrecision]), $MachinePrecision] * N[(N[(d * c0), $MachinePrecision] / N[(D * D), $MachinePrecision]), $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 75.9%

      \[\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 54.5

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

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

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

   9. Applied rewrites 74.6%

      \[\leadsto \frac{d \cdot c0}{D \cdot D} \cdot \color{blue}{\frac{d \cdot c0}{\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. associate-/l* N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. div0 N/A

         \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

      6. mul0-rgt N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

      7. metadata-eval 53.0

         \[\leadsto \color{blue}{0} \]

   5. Applied rewrites 53.0%

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

4. Final simplification 59.8%

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

Alternative 6: 52.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= ((double) INFINITY)) {
		tmp = (c0 * c0) * ((d / (D * w)) * (d / ((h * w) * 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 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((Math.sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Double.POSITIVE_INFINITY) {
		tmp = (c0 * c0) * ((d / (D * w)) * (d / ((h * w) * D)));
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[c0_, w_, h_, D_, d_, M_] := Block[{t$95$0 = N[(N[(N[(d * d), $MachinePrecision] * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision] * N[(c0 / N[(w * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(c0 * c0), $MachinePrecision] * N[(N[(d / N[(D * w), $MachinePrecision]), $MachinePrecision] * N[(d / N[(N[(h * w), $MachinePrecision] * D), $MachinePrecision]), $MachinePrecision]), $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 75.9%

      \[\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 54.5

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

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

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

   9. Applied rewrites 71.2%

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

   11. Applied rewrites 70.7%

       \[\leadsto \left(\frac{d}{\left(h \cdot w\right) \cdot D} \cdot \frac{d}{D \cdot 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. associate-/l* N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. div0 N/A

         \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

      6. mul0-rgt N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

      7. metadata-eval 53.0

         \[\leadsto \color{blue}{0} \]

   5. Applied rewrites 53.0%

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

4. Final simplification 58.6%

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

Alternative 7: 52.7% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= ((double) INFINITY)) {
		tmp = ((c0 * c0) / (D * w)) * ((d / ((h * 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 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((Math.sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Double.POSITIVE_INFINITY) {
		tmp = ((c0 * c0) / (D * w)) * ((d / ((h * w) * D)) * d);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(c0, w, h, D, d, M)
	t_0 = ((d * d) * c0) / ((h * w) * (D * D));
	tmp = 0.0;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Inf)
		tmp = ((c0 * c0) / (D * w)) * ((d / ((h * 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[(N[(d * d), $MachinePrecision] * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision] * N[(c0 / N[(w * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(c0 * c0), $MachinePrecision] / N[(D * w), $MachinePrecision]), $MachinePrecision] * N[(N[(d / N[(N[(h * w), $MachinePrecision] * D), $MachinePrecision]), $MachinePrecision] * 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 75.9%

      \[\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 54.5

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

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

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

   9. Applied rewrites 66.9%

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

   11. Applied rewrites 69.6%

       \[\leadsto \left(\frac{d}{\left(h \cdot w\right) \cdot D} \cdot d\right) \cdot \color{blue}{\frac{c0 \cdot c0}{D \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. associate-/l* N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. div0 N/A

         \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

      6. mul0-rgt N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

      7. metadata-eval 53.0

         \[\leadsto \color{blue}{0} \]

   5. Applied rewrites 53.0%

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

4. Final simplification 58.2%

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

Alternative 8: 51.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(d \cdot d\right) \cdot c0}{\left(h \cdot w\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\left(\sqrt{t\_0 \cdot t\_0 - M \cdot M} + t\_0\right) \cdot \frac{c0}{w \cdot 2} \leq \infty:\\ \;\;\;\;\frac{d \cdot d}{\left(\left(h \cdot w\right) \cdot \left(D \cdot w\right)\right) \cdot D} \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 (/ (* (* d d) c0) (* (* h w) (* D D)))))
   (if (<=
        (* (+ (sqrt (- (* t_0 t_0) (* M M))) t_0) (/ c0 (* w 2.0)))
        INFINITY)
     (* (/ (* d d) (* (* (* h w) (* D w)) D)) (* c0 c0))
     0.0)))

C

double code(double c0, double w, double h, double D, double d, double M) {
	double t_0 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= ((double) INFINITY)) {
		tmp = ((d * d) / (((h * w) * (D * w)) * 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 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((Math.sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d * d) / (((h * w) * (D * w)) * D)) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(Float64(d * d) * c0) / Float64(Float64(h * w) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))) + t_0) * Float64(c0 / Float64(w * 2.0))) <= Inf)
		tmp = Float64(Float64(Float64(d * d) / Float64(Float64(Float64(h * w) * Float64(D * w)) * 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 = ((d * d) * c0) / ((h * w) * (D * D));
	tmp = 0.0;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Inf)
		tmp = ((d * d) / (((h * w) * (D * w)) * 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[(N[(d * d), $MachinePrecision] * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision] * N[(c0 / N[(w * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d * d), $MachinePrecision] / N[(N[(N[(h * w), $MachinePrecision] * N[(D * w), $MachinePrecision]), $MachinePrecision] * D), $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 75.9%

      \[\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 54.5

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

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

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

   9. Applied rewrites 66.9%

      \[\leadsto \frac{d \cdot d}{D \cdot \left(\left(h \cdot w\right) \cdot \left(D \cdot w\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. associate-/l* N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. div0 N/A

         \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

      6. mul0-rgt N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

      7. metadata-eval 53.0

         \[\leadsto \color{blue}{0} \]

   5. Applied rewrites 53.0%

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

4. Final simplification 57.4%

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

Alternative 9: 50.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(d \cdot d\right) \cdot c0}{\left(h \cdot w\right) \cdot \left(D \cdot D\right)}\\ \mathbf{if}\;\left(\sqrt{t\_0 \cdot t\_0 - M \cdot M} + t\_0\right) \cdot \frac{c0}{w \cdot 2} \leq \infty:\\ \;\;\;\;\frac{d \cdot d}{\left(\left(\left(h \cdot w\right) \cdot w\right) \cdot D\right) \cdot D} \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 (/ (* (* d d) c0) (* (* h w) (* D D)))))
   (if (<=
        (* (+ (sqrt (- (* t_0 t_0) (* M M))) t_0) (/ c0 (* w 2.0)))
        INFINITY)
     (* (/ (* d d) (* (* (* (* h w) 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 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= ((double) INFINITY)) {
		tmp = ((d * d) / ((((h * w) * 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 = ((d * d) * c0) / ((h * w) * (D * D));
	double tmp;
	if (((Math.sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Double.POSITIVE_INFINITY) {
		tmp = ((d * d) / ((((h * w) * w) * D) * D)) * (c0 * c0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

Julia

function code(c0, w, h, D, d, M)
	t_0 = Float64(Float64(Float64(d * d) * c0) / Float64(Float64(h * w) * Float64(D * D)))
	tmp = 0.0
	if (Float64(Float64(sqrt(Float64(Float64(t_0 * t_0) - Float64(M * M))) + t_0) * Float64(c0 / Float64(w * 2.0))) <= Inf)
		tmp = Float64(Float64(Float64(d * d) / Float64(Float64(Float64(Float64(h * w) * 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 = ((d * d) * c0) / ((h * w) * (D * D));
	tmp = 0.0;
	if (((sqrt(((t_0 * t_0) - (M * M))) + t_0) * (c0 / (w * 2.0))) <= Inf)
		tmp = ((d * d) / ((((h * w) * 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[(N[(d * d), $MachinePrecision] * c0), $MachinePrecision] / N[(N[(h * w), $MachinePrecision] * N[(D * D), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[Sqrt[N[(N[(t$95$0 * t$95$0), $MachinePrecision] - N[(M * M), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + t$95$0), $MachinePrecision] * N[(c0 / N[(w * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(N[(N[(d * d), $MachinePrecision] / N[(N[(N[(N[(h * w), $MachinePrecision] * w), $MachinePrecision] * D), $MachinePrecision] * D), $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 75.9%

      \[\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 54.5

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

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

      \[\leadsto \frac{d \cdot d}{D \cdot \left(D \cdot \left(\left(h \cdot w\right) \cdot w\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. associate-/l* N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

      2. distribute-lft1-in N/A

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

      3. metadata-eval N/A

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

      4. mul0-lft N/A

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

      5. div0 N/A

         \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

      6. mul0-rgt N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

      7. metadata-eval 53.0

         \[\leadsto \color{blue}{0} \]

   5. Applied rewrites 53.0%

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

4. Final simplification 56.6%

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

Alternative 10: 33.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

real(8) function code(c0, w, h, d, d_1, m)
    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 23.7%

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

      \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left({c0}^{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}\right)} \]

   2. distribute-lft1-in N/A

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

   3. metadata-eval N/A

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

   4. mul0-lft N/A

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

   5. div0 N/A

      \[\leadsto \frac{-1}{2} \cdot \left({c0}^{2} \cdot \color{blue}{0}\right) \]

   6. mul0-rgt N/A

      \[\leadsto \frac{-1}{2} \cdot \color{blue}{0} \]

   7. metadata-eval 38.7

      \[\leadsto \color{blue}{0} \]

5. Applied rewrites 38.7%

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

Reproduce

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