Henrywood and Agarwal, Equation (3)

Percentage Accurate: 73.8% → 87.4%

Time: 10.8s

Alternatives: 6

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \end{array} \]

FPCore

(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))

C

double code(double c0, double A, double V, double l) {
	return c0 * sqrt((A / (V * l)));
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    code = c0 * sqrt((a / (v * l)))
end function

Java

public static double code(double c0, double A, double V, double l) {
	return c0 * Math.sqrt((A / (V * l)));
}

Python

def code(c0, A, V, l):
	return c0 * math.sqrt((A / (V * l)))

Julia

function code(c0, A, V, l)
	return Float64(c0 * sqrt(Float64(A / Float64(V * l))))
end

MATLAB

function tmp = code(c0, A, V, l)
	tmp = c0 * sqrt((A / (V * l)));
end

Wolfram

code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 73.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \end{array} \]

FPCore

(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))

C

double code(double c0, double A, double V, double l) {
	return c0 * sqrt((A / (V * l)));
}

Fortran

real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    code = c0 * sqrt((a / (v * l)))
end function

Java

public static double code(double c0, double A, double V, double l) {
	return c0 * Math.sqrt((A / (V * l)));
}

Python

def code(c0, A, V, l):
	return c0 * math.sqrt((A / (V * l)))

Julia

function code(c0, A, V, l)
	return Float64(c0 * sqrt(Float64(A / Float64(V * l))))
end

MATLAB

function tmp = code(c0, A, V, l)
	tmp = c0 * sqrt((A / (V * l)));
end

Wolfram

code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 87.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -2 \cdot 10^{-316}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{-A}}{\sqrt{V \cdot \left(-\ell\right)}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{-320}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+294}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c0 \cdot \frac{\sqrt{A}}{\sqrt{V}}}{\sqrt{\ell}}\\ \end{array} \end{array} \]

FPCore

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
 :precision binary64
 (if (<= (* V l) -2e-316)
   (* c0 (/ (sqrt (- A)) (sqrt (* V (- l)))))
   (if (<= (* V l) 1e-320)
     (/ c0 (sqrt (* V (/ l A))))
     (if (<= (* V l) 1e+294)
       (* c0 (/ (sqrt A) (sqrt (* V l))))
       (/ (* c0 (/ (sqrt A) (sqrt V))) (sqrt l))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((V * l) <= -2e-316) {
		tmp = c0 * (sqrt(-A) / sqrt((V * -l)));
	} else if ((V * l) <= 1e-320) {
		tmp = c0 / sqrt((V * (l / A)));
	} else if ((V * l) <= 1e+294) {
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	} else {
		tmp = (c0 * (sqrt(A) / sqrt(V))) / sqrt(l);
	}
	return tmp;
}

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((v * l) <= (-2d-316)) then
        tmp = c0 * (sqrt(-a) / sqrt((v * -l)))
    else if ((v * l) <= 1d-320) then
        tmp = c0 / sqrt((v * (l / a)))
    else if ((v * l) <= 1d+294) then
        tmp = c0 * (sqrt(a) / sqrt((v * l)))
    else
        tmp = (c0 * (sqrt(a) / sqrt(v))) / sqrt(l)
    end if
    code = tmp
end function

Java

assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
	double tmp;
	if ((V * l) <= -2e-316) {
		tmp = c0 * (Math.sqrt(-A) / Math.sqrt((V * -l)));
	} else if ((V * l) <= 1e-320) {
		tmp = c0 / Math.sqrt((V * (l / A)));
	} else if ((V * l) <= 1e+294) {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
	} else {
		tmp = (c0 * (Math.sqrt(A) / Math.sqrt(V))) / Math.sqrt(l);
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (V * l) <= -2e-316:
		tmp = c0 * (math.sqrt(-A) / math.sqrt((V * -l)))
	elif (V * l) <= 1e-320:
		tmp = c0 / math.sqrt((V * (l / A)))
	elif (V * l) <= 1e+294:
		tmp = c0 * (math.sqrt(A) / math.sqrt((V * l)))
	else:
		tmp = (c0 * (math.sqrt(A) / math.sqrt(V))) / math.sqrt(l)
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(V * l) <= -2e-316)
		tmp = Float64(c0 * Float64(sqrt(Float64(-A)) / sqrt(Float64(V * Float64(-l)))));
	elseif (Float64(V * l) <= 1e-320)
		tmp = Float64(c0 / sqrt(Float64(V * Float64(l / A))));
	elseif (Float64(V * l) <= 1e+294)
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l))));
	else
		tmp = Float64(Float64(c0 * Float64(sqrt(A) / sqrt(V))) / sqrt(l));
	end
	return tmp
end

MATLAB

c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if ((V * l) <= -2e-316)
		tmp = c0 * (sqrt(-A) / sqrt((V * -l)));
	elseif ((V * l) <= 1e-320)
		tmp = c0 / sqrt((V * (l / A)));
	elseif ((V * l) <= 1e+294)
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	else
		tmp = (c0 * (sqrt(A) / sqrt(V))) / sqrt(l);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := If[LessEqual[N[(V * l), $MachinePrecision], -2e-316], N[(c0 * N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[(V * (-l)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-320], N[(c0 / N[Sqrt[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+294], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[V], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 V l) < -2.000000017e-316

   1. Initial program 86.7%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. frac-2neg 86.7%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{-A}{-V \cdot \ell}}} \]

      2. sqrt-div 92.6%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{-A}}{\sqrt{-V \cdot \ell}}} \]

      3. distribute-rgt-neg-in 92.6%

         \[\leadsto c0 \cdot \frac{\sqrt{-A}}{\sqrt{\color{blue}{V \cdot \left(-\ell\right)}}} \]

   4. Applied egg-rr 92.6%

      \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{-A}}{\sqrt{V \cdot \left(-\ell\right)}}} \]
   5. Step-by-step derivation

      1. distribute-rgt-neg-out 92.6%

         \[\leadsto c0 \cdot \frac{\sqrt{-A}}{\sqrt{\color{blue}{-V \cdot \ell}}} \]

      2. *-commutative 92.6%

         \[\leadsto c0 \cdot \frac{\sqrt{-A}}{\sqrt{-\color{blue}{\ell \cdot V}}} \]

      3. distribute-rgt-neg-in 92.6%

         \[\leadsto c0 \cdot \frac{\sqrt{-A}}{\sqrt{\color{blue}{\ell \cdot \left(-V\right)}}} \]

   6. Simplified 92.6%

      \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{-A}}{\sqrt{\ell \cdot \left(-V\right)}}} \]

   if -2.000000017e-316 < (*.f64 V l) < 9.99989e-321

   1. Initial program 37.4%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-/r* 64.5%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{\frac{A}{V}}{\ell}}} \]

      2. clear-num 64.5%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{1}{\frac{\ell}{\frac{A}{V}}}}} \]

      3. sqrt-div 66.2%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}}} \]

      4. metadata-eval 66.2%

         \[\leadsto c0 \cdot \frac{\color{blue}{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}} \]

      5. div-inv 66.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\ell \cdot \frac{1}{\frac{A}{V}}}}} \]

      6. clear-num 66.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\ell \cdot \color{blue}{\frac{V}{A}}}} \]

   4. Applied egg-rr 66.2%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}} \]
   5. Step-by-step derivation

      1. *-commutative 66.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V}{A} \cdot \ell}}} \]

      2. associate-*l/ 37.4%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}} \]

      3. associate-/l* 66.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   6. Simplified 66.2%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{V \cdot \frac{\ell}{A}}}} \]
   7. Step-by-step derivation

      1. un-div-inv 66.3%

         \[\leadsto \color{blue}{\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}} \]

      2. clear-num 66.2%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{V \cdot \frac{\ell}{A}}}{c0}}} \]

      3. associate-*r/ 37.4%

         \[\leadsto \frac{1}{\frac{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}}{c0}} \]

   8. Applied egg-rr 37.4%

      \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{\frac{V \cdot \ell}{A}}}{c0}}} \]
   9. Step-by-step derivation

      1. associate-/r/ 37.4%

         \[\leadsto \color{blue}{\frac{1}{\sqrt{\frac{V \cdot \ell}{A}}} \cdot c0} \]

      2. associate-*l/ 37.4%

         \[\leadsto \color{blue}{\frac{1 \cdot c0}{\sqrt{\frac{V \cdot \ell}{A}}}} \]

      3. *-lft-identity 37.4%

         \[\leadsto \frac{\color{blue}{c0}}{\sqrt{\frac{V \cdot \ell}{A}}} \]

      4. associate-/l* 66.3%

         \[\leadsto \frac{c0}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   10. Simplified 66.3%

       \[\leadsto \color{blue}{\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}} \]

   if 9.99989e-321 < (*.f64 V l) < 1.00000000000000007e294

   1. Initial program 81.3%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. sqrt-div 99.4%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{A}}{\sqrt{V \cdot \ell}}} \]

      2. div-inv 99.4%

         \[\leadsto c0 \cdot \color{blue}{\left(\sqrt{A} \cdot \frac{1}{\sqrt{V \cdot \ell}}\right)} \]

   4. Applied egg-rr 99.4%

      \[\leadsto c0 \cdot \color{blue}{\left(\sqrt{A} \cdot \frac{1}{\sqrt{V \cdot \ell}}\right)} \]
   5. Step-by-step derivation

      1. associate-*r/ 99.4%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{A} \cdot 1}{\sqrt{V \cdot \ell}}} \]

      2. *-rgt-identity 99.4%

         \[\leadsto c0 \cdot \frac{\color{blue}{\sqrt{A}}}{\sqrt{V \cdot \ell}} \]

   6. Simplified 99.4%

      \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{A}}{\sqrt{V \cdot \ell}}} \]

   if 1.00000000000000007e294 < (*.f64 V l)

   1. Initial program 52.4%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-/r* 65.3%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{\frac{A}{V}}{\ell}}} \]

      2. clear-num 61.9%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{1}{\frac{\ell}{\frac{A}{V}}}}} \]

      3. sqrt-div 61.9%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}}} \]

      4. metadata-eval 61.9%

         \[\leadsto c0 \cdot \frac{\color{blue}{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}} \]

      5. div-inv 61.9%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\ell \cdot \frac{1}{\frac{A}{V}}}}} \]

      6. clear-num 61.9%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\ell \cdot \color{blue}{\frac{V}{A}}}} \]

   4. Applied egg-rr 61.9%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}} \]
   5. Step-by-step derivation

      1. *-commutative 61.9%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V}{A} \cdot \ell}}} \]

      2. associate-*l/ 52.4%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}} \]

      3. associate-/l* 61.9%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   6. Simplified 61.9%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{V \cdot \frac{\ell}{A}}}} \]
   7. Step-by-step derivation

      1. inv-pow 61.9%

         \[\leadsto c0 \cdot \color{blue}{{\left(\sqrt{V \cdot \frac{\ell}{A}}\right)}^{-1}} \]

      2. sqrt-pow2 61.9%

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

      3. associate-*r/ 52.4%

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

      4. metadata-eval 52.4%

         \[\leadsto c0 \cdot {\left(\frac{V \cdot \ell}{A}\right)}^{\color{blue}{-0.5}} \]

   8. Applied egg-rr 52.4%

      \[\leadsto c0 \cdot \color{blue}{{\left(\frac{V \cdot \ell}{A}\right)}^{-0.5}} \]
   9. Step-by-step derivation

      1. *-commutative 52.4%

         \[\leadsto \color{blue}{{\left(\frac{V \cdot \ell}{A}\right)}^{-0.5} \cdot c0} \]

      2. associate-*r/ 61.9%

         \[\leadsto {\color{blue}{\left(V \cdot \frac{\ell}{A}\right)}}^{-0.5} \cdot c0 \]

      3. metadata-eval 61.9%

         \[\leadsto {\left(V \cdot \frac{\ell}{A}\right)}^{\color{blue}{\left(-0.5\right)}} \cdot c0 \]

      4. pow-flip 61.9%

         \[\leadsto \color{blue}{\frac{1}{{\left(V \cdot \frac{\ell}{A}\right)}^{0.5}}} \cdot c0 \]

      5. pow1/2 61.9%

         \[\leadsto \frac{1}{\color{blue}{\sqrt{V \cdot \frac{\ell}{A}}}} \cdot c0 \]

      6. associate-/r/ 61.9%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{V \cdot \frac{\ell}{A}}}{c0}}} \]

      7. associate-*r/ 52.4%

         \[\leadsto \frac{1}{\frac{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}}{c0}} \]

      8. sqrt-div 52.4%

         \[\leadsto \frac{1}{\frac{\color{blue}{\frac{\sqrt{V \cdot \ell}}{\sqrt{A}}}}{c0}} \]

      9. associate-/r* 52.4%

         \[\leadsto \frac{1}{\color{blue}{\frac{\sqrt{V \cdot \ell}}{\sqrt{A} \cdot c0}}} \]

      10. clear-num 52.4%

          \[\leadsto \color{blue}{\frac{\sqrt{A} \cdot c0}{\sqrt{V \cdot \ell}}} \]

      11. sqrt-prod 74.5%

          \[\leadsto \frac{\sqrt{A} \cdot c0}{\color{blue}{\sqrt{V} \cdot \sqrt{\ell}}} \]

      12. associate-/r* 74.6%

          \[\leadsto \color{blue}{\frac{\frac{\sqrt{A} \cdot c0}{\sqrt{V}}}{\sqrt{\ell}}} \]

      13. *-commutative 74.6%

          \[\leadsto \frac{\frac{\color{blue}{c0 \cdot \sqrt{A}}}{\sqrt{V}}}{\sqrt{\ell}} \]

   10. Applied egg-rr 74.6%

       \[\leadsto \color{blue}{\frac{\frac{c0 \cdot \sqrt{A}}{\sqrt{V}}}{\sqrt{\ell}}} \]
   11. Step-by-step derivation

       1. associate-/l* 74.7%

          \[\leadsto \frac{\color{blue}{c0 \cdot \frac{\sqrt{A}}{\sqrt{V}}}}{\sqrt{\ell}} \]

   12. Simplified 74.7%

       \[\leadsto \color{blue}{\frac{c0 \cdot \frac{\sqrt{A}}{\sqrt{V}}}{\sqrt{\ell}}} \]
3. Recombined 4 regimes into one program.

4. Final simplification 89.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -2 \cdot 10^{-316}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{-A}}{\sqrt{V \cdot \left(-\ell\right)}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{-320}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+294}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c0 \cdot \frac{\sqrt{A}}{\sqrt{V}}}{\sqrt{\ell}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 81.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -2 \cdot 10^{-272}:\\ \;\;\;\;c0 \cdot {\left(\frac{V \cdot \ell}{A}\right)}^{-0.5}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{-320}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \end{array} \end{array} \]

FPCore

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
 :precision binary64
 (if (<= (* V l) -2e-272)
   (* c0 (pow (/ (* V l) A) -0.5))
   (if (<= (* V l) 1e-320)
     (/ c0 (sqrt (* V (/ l A))))
     (* c0 (/ (sqrt A) (sqrt (* V l)))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((V * l) <= -2e-272) {
		tmp = c0 * pow(((V * l) / A), -0.5);
	} else if ((V * l) <= 1e-320) {
		tmp = c0 / sqrt((V * (l / A)));
	} else {
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	}
	return tmp;
}

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((v * l) <= (-2d-272)) then
        tmp = c0 * (((v * l) / a) ** (-0.5d0))
    else if ((v * l) <= 1d-320) then
        tmp = c0 / sqrt((v * (l / a)))
    else
        tmp = c0 * (sqrt(a) / sqrt((v * l)))
    end if
    code = tmp
end function

Java

assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
	double tmp;
	if ((V * l) <= -2e-272) {
		tmp = c0 * Math.pow(((V * l) / A), -0.5);
	} else if ((V * l) <= 1e-320) {
		tmp = c0 / Math.sqrt((V * (l / A)));
	} else {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (V * l) <= -2e-272:
		tmp = c0 * math.pow(((V * l) / A), -0.5)
	elif (V * l) <= 1e-320:
		tmp = c0 / math.sqrt((V * (l / A)))
	else:
		tmp = c0 * (math.sqrt(A) / math.sqrt((V * l)))
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(V * l) <= -2e-272)
		tmp = Float64(c0 * (Float64(Float64(V * l) / A) ^ -0.5));
	elseif (Float64(V * l) <= 1e-320)
		tmp = Float64(c0 / sqrt(Float64(V * Float64(l / A))));
	else
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l))));
	end
	return tmp
end

MATLAB

c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if ((V * l) <= -2e-272)
		tmp = c0 * (((V * l) / A) ^ -0.5);
	elseif ((V * l) <= 1e-320)
		tmp = c0 / sqrt((V * (l / A)));
	else
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := If[LessEqual[N[(V * l), $MachinePrecision], -2e-272], N[(c0 * N[Power[N[(N[(V * l), $MachinePrecision] / A), $MachinePrecision], -0.5], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-320], N[(c0 / N[Sqrt[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 V l) < -1.99999999999999986e-272

   1. Initial program 87.2%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-/r* 83.3%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{\frac{A}{V}}{\ell}}} \]

      2. clear-num 83.2%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{1}{\frac{\ell}{\frac{A}{V}}}}} \]

      3. sqrt-div 83.1%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}}} \]

      4. metadata-eval 83.1%

         \[\leadsto c0 \cdot \frac{\color{blue}{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}} \]

      5. div-inv 83.0%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\ell \cdot \frac{1}{\frac{A}{V}}}}} \]

      6. clear-num 83.1%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\ell \cdot \color{blue}{\frac{V}{A}}}} \]

   4. Applied egg-rr 83.1%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}} \]
   5. Step-by-step derivation

      1. *-commutative 83.1%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V}{A} \cdot \ell}}} \]

      2. associate-*l/ 87.7%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}} \]

      3. associate-/l* 71.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   6. Simplified 71.2%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{V \cdot \frac{\ell}{A}}}} \]
   7. Step-by-step derivation

      1. inv-pow 71.2%

         \[\leadsto c0 \cdot \color{blue}{{\left(\sqrt{V \cdot \frac{\ell}{A}}\right)}^{-1}} \]

      2. sqrt-pow2 71.3%

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

      3. associate-*r/ 87.9%

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

      4. metadata-eval 87.9%

         \[\leadsto c0 \cdot {\left(\frac{V \cdot \ell}{A}\right)}^{\color{blue}{-0.5}} \]

   8. Applied egg-rr 87.9%

      \[\leadsto c0 \cdot \color{blue}{{\left(\frac{V \cdot \ell}{A}\right)}^{-0.5}} \]

   if -1.99999999999999986e-272 < (*.f64 V l) < 9.99989e-321

   1. Initial program 39.4%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-/r* 64.7%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{\frac{A}{V}}{\ell}}} \]

      2. clear-num 64.7%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{1}{\frac{\ell}{\frac{A}{V}}}}} \]

      3. sqrt-div 66.3%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}}} \]

      4. metadata-eval 66.3%

         \[\leadsto c0 \cdot \frac{\color{blue}{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}} \]

      5. div-inv 66.3%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\ell \cdot \frac{1}{\frac{A}{V}}}}} \]

      6. clear-num 66.3%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\ell \cdot \color{blue}{\frac{V}{A}}}} \]

   4. Applied egg-rr 66.3%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}} \]
   5. Step-by-step derivation

      1. *-commutative 66.3%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V}{A} \cdot \ell}}} \]

      2. associate-*l/ 39.4%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}} \]

      3. associate-/l* 66.3%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   6. Simplified 66.3%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{V \cdot \frac{\ell}{A}}}} \]
   7. Step-by-step derivation

      1. un-div-inv 66.4%

         \[\leadsto \color{blue}{\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}} \]

      2. clear-num 66.3%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{V \cdot \frac{\ell}{A}}}{c0}}} \]

      3. associate-*r/ 39.4%

         \[\leadsto \frac{1}{\frac{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}}{c0}} \]

   8. Applied egg-rr 39.4%

      \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{\frac{V \cdot \ell}{A}}}{c0}}} \]
   9. Step-by-step derivation

      1. associate-/r/ 39.4%

         \[\leadsto \color{blue}{\frac{1}{\sqrt{\frac{V \cdot \ell}{A}}} \cdot c0} \]

      2. associate-*l/ 39.4%

         \[\leadsto \color{blue}{\frac{1 \cdot c0}{\sqrt{\frac{V \cdot \ell}{A}}}} \]

      3. *-lft-identity 39.4%

         \[\leadsto \frac{\color{blue}{c0}}{\sqrt{\frac{V \cdot \ell}{A}}} \]

      4. associate-/l* 66.4%

         \[\leadsto \frac{c0}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   10. Simplified 66.4%

       \[\leadsto \color{blue}{\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}} \]

   if 9.99989e-321 < (*.f64 V l)

   1. Initial program 76.1%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. sqrt-div 91.0%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{A}}{\sqrt{V \cdot \ell}}} \]

      2. div-inv 91.0%

         \[\leadsto c0 \cdot \color{blue}{\left(\sqrt{A} \cdot \frac{1}{\sqrt{V \cdot \ell}}\right)} \]

   4. Applied egg-rr 91.0%

      \[\leadsto c0 \cdot \color{blue}{\left(\sqrt{A} \cdot \frac{1}{\sqrt{V \cdot \ell}}\right)} \]
   5. Step-by-step derivation

      1. associate-*r/ 91.0%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{A} \cdot 1}{\sqrt{V \cdot \ell}}} \]

      2. *-rgt-identity 91.0%

         \[\leadsto c0 \cdot \frac{\color{blue}{\sqrt{A}}}{\sqrt{V \cdot \ell}} \]

   6. Simplified 91.0%

      \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{A}}{\sqrt{V \cdot \ell}}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 85.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -2 \cdot 10^{-272}:\\ \;\;\;\;c0 \cdot {\left(\frac{V \cdot \ell}{A}\right)}^{-0.5}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{-320}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 87.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -2 \cdot 10^{-316}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{-A}}{\sqrt{V \cdot \left(-\ell\right)}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{-320}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \end{array} \end{array} \]

FPCore

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
 :precision binary64
 (if (<= (* V l) -2e-316)
   (* c0 (/ (sqrt (- A)) (sqrt (* V (- l)))))
   (if (<= (* V l) 1e-320)
     (/ c0 (sqrt (* V (/ l A))))
     (* c0 (/ (sqrt A) (sqrt (* V l)))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((V * l) <= -2e-316) {
		tmp = c0 * (sqrt(-A) / sqrt((V * -l)));
	} else if ((V * l) <= 1e-320) {
		tmp = c0 / sqrt((V * (l / A)));
	} else {
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	}
	return tmp;
}

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((v * l) <= (-2d-316)) then
        tmp = c0 * (sqrt(-a) / sqrt((v * -l)))
    else if ((v * l) <= 1d-320) then
        tmp = c0 / sqrt((v * (l / a)))
    else
        tmp = c0 * (sqrt(a) / sqrt((v * l)))
    end if
    code = tmp
end function

Java

assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
	double tmp;
	if ((V * l) <= -2e-316) {
		tmp = c0 * (Math.sqrt(-A) / Math.sqrt((V * -l)));
	} else if ((V * l) <= 1e-320) {
		tmp = c0 / Math.sqrt((V * (l / A)));
	} else {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (V * l) <= -2e-316:
		tmp = c0 * (math.sqrt(-A) / math.sqrt((V * -l)))
	elif (V * l) <= 1e-320:
		tmp = c0 / math.sqrt((V * (l / A)))
	else:
		tmp = c0 * (math.sqrt(A) / math.sqrt((V * l)))
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(V * l) <= -2e-316)
		tmp = Float64(c0 * Float64(sqrt(Float64(-A)) / sqrt(Float64(V * Float64(-l)))));
	elseif (Float64(V * l) <= 1e-320)
		tmp = Float64(c0 / sqrt(Float64(V * Float64(l / A))));
	else
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l))));
	end
	return tmp
end

MATLAB

c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if ((V * l) <= -2e-316)
		tmp = c0 * (sqrt(-A) / sqrt((V * -l)));
	elseif ((V * l) <= 1e-320)
		tmp = c0 / sqrt((V * (l / A)));
	else
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := If[LessEqual[N[(V * l), $MachinePrecision], -2e-316], N[(c0 * N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[(V * (-l)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e-320], N[(c0 / N[Sqrt[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 V l) < -2.000000017e-316

   1. Initial program 86.7%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. frac-2neg 86.7%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{-A}{-V \cdot \ell}}} \]

      2. sqrt-div 92.6%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{-A}}{\sqrt{-V \cdot \ell}}} \]

      3. distribute-rgt-neg-in 92.6%

         \[\leadsto c0 \cdot \frac{\sqrt{-A}}{\sqrt{\color{blue}{V \cdot \left(-\ell\right)}}} \]

   4. Applied egg-rr 92.6%

      \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{-A}}{\sqrt{V \cdot \left(-\ell\right)}}} \]
   5. Step-by-step derivation

      1. distribute-rgt-neg-out 92.6%

         \[\leadsto c0 \cdot \frac{\sqrt{-A}}{\sqrt{\color{blue}{-V \cdot \ell}}} \]

      2. *-commutative 92.6%

         \[\leadsto c0 \cdot \frac{\sqrt{-A}}{\sqrt{-\color{blue}{\ell \cdot V}}} \]

      3. distribute-rgt-neg-in 92.6%

         \[\leadsto c0 \cdot \frac{\sqrt{-A}}{\sqrt{\color{blue}{\ell \cdot \left(-V\right)}}} \]

   6. Simplified 92.6%

      \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{-A}}{\sqrt{\ell \cdot \left(-V\right)}}} \]

   if -2.000000017e-316 < (*.f64 V l) < 9.99989e-321

   1. Initial program 37.4%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-/r* 64.5%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{\frac{A}{V}}{\ell}}} \]

      2. clear-num 64.5%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{1}{\frac{\ell}{\frac{A}{V}}}}} \]

      3. sqrt-div 66.2%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}}} \]

      4. metadata-eval 66.2%

         \[\leadsto c0 \cdot \frac{\color{blue}{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}} \]

      5. div-inv 66.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\ell \cdot \frac{1}{\frac{A}{V}}}}} \]

      6. clear-num 66.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\ell \cdot \color{blue}{\frac{V}{A}}}} \]

   4. Applied egg-rr 66.2%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}} \]
   5. Step-by-step derivation

      1. *-commutative 66.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V}{A} \cdot \ell}}} \]

      2. associate-*l/ 37.4%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}} \]

      3. associate-/l* 66.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   6. Simplified 66.2%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{V \cdot \frac{\ell}{A}}}} \]
   7. Step-by-step derivation

      1. un-div-inv 66.3%

         \[\leadsto \color{blue}{\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}} \]

      2. clear-num 66.2%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{V \cdot \frac{\ell}{A}}}{c0}}} \]

      3. associate-*r/ 37.4%

         \[\leadsto \frac{1}{\frac{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}}{c0}} \]

   8. Applied egg-rr 37.4%

      \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{\frac{V \cdot \ell}{A}}}{c0}}} \]
   9. Step-by-step derivation

      1. associate-/r/ 37.4%

         \[\leadsto \color{blue}{\frac{1}{\sqrt{\frac{V \cdot \ell}{A}}} \cdot c0} \]

      2. associate-*l/ 37.4%

         \[\leadsto \color{blue}{\frac{1 \cdot c0}{\sqrt{\frac{V \cdot \ell}{A}}}} \]

      3. *-lft-identity 37.4%

         \[\leadsto \frac{\color{blue}{c0}}{\sqrt{\frac{V \cdot \ell}{A}}} \]

      4. associate-/l* 66.3%

         \[\leadsto \frac{c0}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   10. Simplified 66.3%

       \[\leadsto \color{blue}{\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}} \]

   if 9.99989e-321 < (*.f64 V l)

   1. Initial program 76.1%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. sqrt-div 91.0%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{A}}{\sqrt{V \cdot \ell}}} \]

      2. div-inv 91.0%

         \[\leadsto c0 \cdot \color{blue}{\left(\sqrt{A} \cdot \frac{1}{\sqrt{V \cdot \ell}}\right)} \]

   4. Applied egg-rr 91.0%

      \[\leadsto c0 \cdot \color{blue}{\left(\sqrt{A} \cdot \frac{1}{\sqrt{V \cdot \ell}}\right)} \]
   5. Step-by-step derivation

      1. associate-*r/ 91.0%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{A} \cdot 1}{\sqrt{V \cdot \ell}}} \]

      2. *-rgt-identity 91.0%

         \[\leadsto c0 \cdot \frac{\color{blue}{\sqrt{A}}}{\sqrt{V \cdot \ell}} \]

   6. Simplified 91.0%

      \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{A}}{\sqrt{V \cdot \ell}}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 87.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -2 \cdot 10^{-316}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{-A}}{\sqrt{V \cdot \left(-\ell\right)}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{-320}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 76.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} t_0 := \frac{A}{V \cdot \ell}\\ \mathbf{if}\;t\_0 \leq 5 \cdot 10^{+296}:\\ \;\;\;\;c0 \cdot \sqrt{t\_0}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \end{array} \end{array} \]

FPCore

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (/ A (* V l))))
   (if (<= t_0 5e+296) (* c0 (sqrt t_0)) (* c0 (sqrt (/ (/ A V) l))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double t_0 = A / (V * l);
	double tmp;
	if (t_0 <= 5e+296) {
		tmp = c0 * sqrt(t_0);
	} else {
		tmp = c0 * sqrt(((A / V) / l));
	}
	return tmp;
}

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = a / (v * l)
    if (t_0 <= 5d+296) then
        tmp = c0 * sqrt(t_0)
    else
        tmp = c0 * sqrt(((a / v) / l))
    end if
    code = tmp
end function

Java

assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
	double t_0 = A / (V * l);
	double tmp;
	if (t_0 <= 5e+296) {
		tmp = c0 * Math.sqrt(t_0);
	} else {
		tmp = c0 * Math.sqrt(((A / V) / l));
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	t_0 = A / (V * l)
	tmp = 0
	if t_0 <= 5e+296:
		tmp = c0 * math.sqrt(t_0)
	else:
		tmp = c0 * math.sqrt(((A / V) / l))
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	t_0 = Float64(A / Float64(V * l))
	tmp = 0.0
	if (t_0 <= 5e+296)
		tmp = Float64(c0 * sqrt(t_0));
	else
		tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l)));
	end
	return tmp
end

MATLAB

c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
	t_0 = A / (V * l);
	tmp = 0.0;
	if (t_0 <= 5e+296)
		tmp = c0 * sqrt(t_0);
	else
		tmp = c0 * sqrt(((A / V) / l));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 5e+296], N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 A (*.f64 V l)) < 5.0000000000000001e296

   1. Initial program 86.2%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing

   if 5.0000000000000001e296 < (/.f64 A (*.f64 V l))

   1. Initial program 34.8%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Step-by-step derivation

      1. associate-/r* 51.2%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{\frac{A}{V}}{\ell}}} \]

   3. Simplified 51.2%

      \[\leadsto \color{blue}{c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{A}{V \cdot \ell} \leq 5 \cdot 10^{+296}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 76.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} t_0 := \frac{A}{V \cdot \ell}\\ \mathbf{if}\;t\_0 \leq 5 \cdot 10^{+297}:\\ \;\;\;\;c0 \cdot \sqrt{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \end{array} \end{array} \]

FPCore

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l)
 :precision binary64
 (let* ((t_0 (/ A (* V l))))
   (if (<= t_0 5e+297) (* c0 (sqrt t_0)) (/ c0 (sqrt (* V (/ l A)))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double t_0 = A / (V * l);
	double tmp;
	if (t_0 <= 5e+297) {
		tmp = c0 * sqrt(t_0);
	} else {
		tmp = c0 / sqrt((V * (l / A)));
	}
	return tmp;
}

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = a / (v * l)
    if (t_0 <= 5d+297) then
        tmp = c0 * sqrt(t_0)
    else
        tmp = c0 / sqrt((v * (l / a)))
    end if
    code = tmp
end function

Java

assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
	double t_0 = A / (V * l);
	double tmp;
	if (t_0 <= 5e+297) {
		tmp = c0 * Math.sqrt(t_0);
	} else {
		tmp = c0 / Math.sqrt((V * (l / A)));
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	t_0 = A / (V * l)
	tmp = 0
	if t_0 <= 5e+297:
		tmp = c0 * math.sqrt(t_0)
	else:
		tmp = c0 / math.sqrt((V * (l / A)))
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	t_0 = Float64(A / Float64(V * l))
	tmp = 0.0
	if (t_0 <= 5e+297)
		tmp = Float64(c0 * sqrt(t_0));
	else
		tmp = Float64(c0 / sqrt(Float64(V * Float64(l / A))));
	end
	return tmp
end

MATLAB

c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
	t_0 = A / (V * l);
	tmp = 0.0;
	if (t_0 <= 5e+297)
		tmp = c0 * sqrt(t_0);
	else
		tmp = c0 / sqrt((V * (l / A)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := Block[{t$95$0 = N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 5e+297], N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[(c0 / N[Sqrt[N[(V * N[(l / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 A (*.f64 V l)) < 4.9999999999999998e297

   1. Initial program 86.3%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing

   if 4.9999999999999998e297 < (/.f64 A (*.f64 V l))

   1. Initial program 33.7%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-/r* 51.9%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{\frac{A}{V}}{\ell}}} \]

      2. clear-num 51.9%

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{1}{\frac{\ell}{\frac{A}{V}}}}} \]

      3. sqrt-div 54.4%

         \[\leadsto c0 \cdot \color{blue}{\frac{\sqrt{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}}} \]

      4. metadata-eval 54.4%

         \[\leadsto c0 \cdot \frac{\color{blue}{1}}{\sqrt{\frac{\ell}{\frac{A}{V}}}} \]

      5. div-inv 54.5%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\ell \cdot \frac{1}{\frac{A}{V}}}}} \]

      6. clear-num 54.5%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\ell \cdot \color{blue}{\frac{V}{A}}}} \]

   4. Applied egg-rr 54.5%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}} \]
   5. Step-by-step derivation

      1. *-commutative 54.5%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V}{A} \cdot \ell}}} \]

      2. associate-*l/ 38.3%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}} \]

      3. associate-/l* 57.2%

         \[\leadsto c0 \cdot \frac{1}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   6. Simplified 57.2%

      \[\leadsto c0 \cdot \color{blue}{\frac{1}{\sqrt{V \cdot \frac{\ell}{A}}}} \]
   7. Step-by-step derivation

      1. un-div-inv 57.3%

         \[\leadsto \color{blue}{\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}} \]

      2. clear-num 57.2%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{V \cdot \frac{\ell}{A}}}{c0}}} \]

      3. associate-*r/ 38.3%

         \[\leadsto \frac{1}{\frac{\sqrt{\color{blue}{\frac{V \cdot \ell}{A}}}}{c0}} \]

   8. Applied egg-rr 38.3%

      \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{\frac{V \cdot \ell}{A}}}{c0}}} \]
   9. Step-by-step derivation

      1. associate-/r/ 38.3%

         \[\leadsto \color{blue}{\frac{1}{\sqrt{\frac{V \cdot \ell}{A}}} \cdot c0} \]

      2. associate-*l/ 38.4%

         \[\leadsto \color{blue}{\frac{1 \cdot c0}{\sqrt{\frac{V \cdot \ell}{A}}}} \]

      3. *-lft-identity 38.4%

         \[\leadsto \frac{\color{blue}{c0}}{\sqrt{\frac{V \cdot \ell}{A}}} \]

      4. associate-/l* 57.3%

         \[\leadsto \frac{c0}{\sqrt{\color{blue}{V \cdot \frac{\ell}{A}}}} \]

   10. Simplified 57.3%

       \[\leadsto \color{blue}{\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{A}{V \cdot \ell} \leq 5 \cdot 10^{+297}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c0}{\sqrt{V \cdot \frac{\ell}{A}}}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 73.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \end{array} \]

FPCore

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
(FPCore (c0 A V l) :precision binary64 (* c0 (sqrt (/ A (* V l)))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	return c0 * sqrt((A / (V * l)));
}

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
real(8) function code(c0, a, v, l)
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    code = c0 * sqrt((a / (v * l)))
end function

Java

assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
	return c0 * Math.sqrt((A / (V * l)));
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	return c0 * math.sqrt((A / (V * l)))

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	return Float64(c0 * sqrt(Float64(A / Float64(V * l))))
end

MATLAB

c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp = code(c0, A, V, l)
	tmp = c0 * sqrt((A / (V * l)));
end

Wolfram

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 73.8%

   \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
2. Add Preprocessing

3. Final simplification 73.8%

   \[\leadsto c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
4. Add Preprocessing

Reproduce

herbie shell --seed 2024076 
(FPCore (c0 A V l)
  :name "Henrywood and Agarwal, Equation (3)"
  :precision binary64
  (* c0 (sqrt (/ A (* V l)))))