Henrywood and Agarwal, Equation (3)

Percentage Accurate: 73.1% → 90.7%

Time: 8.2s

Alternatives: 10

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.1% 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: 90.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 -\infty:\\ \;\;\;\;c0 \cdot \left(\sqrt{\frac{A}{V}} \cdot \sqrt{\frac{1}{\ell}}\right)\\ \mathbf{elif}\;V \cdot \ell \leq -1 \cdot 10^{-314}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{-A}}{\sqrt{V \cdot \left(-\ell\right)}}\\ \mathbf{elif}\;V \cdot \ell \leq 0:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+266}:\\ \;\;\;\;c0 \cdot \frac{1}{\frac{\sqrt{V \cdot \ell}}{\sqrt{A}}}\\ \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
 (if (<= (* V l) (- INFINITY))
   (* c0 (* (sqrt (/ A V)) (sqrt (/ 1.0 l))))
   (if (<= (* V l) -1e-314)
     (* c0 (/ (sqrt (- A)) (sqrt (* V (- l)))))
     (if (<= (* V l) 0.0)
       (* c0 (/ 1.0 (sqrt (* l (/ V A)))))
       (if (<= (* V l) 1e+266)
         (* c0 (/ 1.0 (/ (sqrt (* V l)) (sqrt A))))
         (* c0 (sqrt (/ (/ A 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) <= -((double) INFINITY)) {
		tmp = c0 * (sqrt((A / V)) * sqrt((1.0 / l)));
	} else if ((V * l) <= -1e-314) {
		tmp = c0 * (sqrt(-A) / sqrt((V * -l)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (1.0 / (sqrt((V * l)) / sqrt(A)));
	} else {
		tmp = c0 * sqrt(((A / V) / l));
	}
	return tmp;
}

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) <= -Double.POSITIVE_INFINITY) {
		tmp = c0 * (Math.sqrt((A / V)) * Math.sqrt((1.0 / l)));
	} else if ((V * l) <= -1e-314) {
		tmp = c0 * (Math.sqrt(-A) / Math.sqrt((V * -l)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / Math.sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (1.0 / (Math.sqrt((V * l)) / Math.sqrt(A)));
	} 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):
	tmp = 0
	if (V * l) <= -math.inf:
		tmp = c0 * (math.sqrt((A / V)) * math.sqrt((1.0 / l)))
	elif (V * l) <= -1e-314:
		tmp = c0 * (math.sqrt(-A) / math.sqrt((V * -l)))
	elif (V * l) <= 0.0:
		tmp = c0 * (1.0 / math.sqrt((l * (V / A))))
	elif (V * l) <= 1e+266:
		tmp = c0 * (1.0 / (math.sqrt((V * l)) / math.sqrt(A)))
	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)
	tmp = 0.0
	if (Float64(V * l) <= Float64(-Inf))
		tmp = Float64(c0 * Float64(sqrt(Float64(A / V)) * sqrt(Float64(1.0 / l))));
	elseif (Float64(V * l) <= -1e-314)
		tmp = Float64(c0 * Float64(sqrt(Float64(-A)) / sqrt(Float64(V * Float64(-l)))));
	elseif (Float64(V * l) <= 0.0)
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(l * Float64(V / A)))));
	elseif (Float64(V * l) <= 1e+266)
		tmp = Float64(c0 * Float64(1.0 / Float64(sqrt(Float64(V * l)) / sqrt(A))));
	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)
	tmp = 0.0;
	if ((V * l) <= -Inf)
		tmp = c0 * (sqrt((A / V)) * sqrt((1.0 / l)));
	elseif ((V * l) <= -1e-314)
		tmp = c0 * (sqrt(-A) / sqrt((V * -l)));
	elseif ((V * l) <= 0.0)
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	elseif ((V * l) <= 1e+266)
		tmp = c0 * (1.0 / (sqrt((V * l)) / sqrt(A)));
	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_] := If[LessEqual[N[(V * l), $MachinePrecision], (-Infinity)], N[(c0 * N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -1e-314], N[(c0 * N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[(V * (-l)), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[(c0 * N[(1.0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+266], N[(c0 * N[(1.0 / N[(N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[A], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.f64 V l) < -inf.0

   1. Initial program 31.3%

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

      1. pow1/2 31.3%

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

      2. associate-/r* 63.3%

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

      3. div-inv 63.4%

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

      4. unpow-prod-down 34.1%

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

      5. pow1/2 34.1%

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

   4. Applied egg-rr 34.1%

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

      1. unpow1/2 34.1%

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

   6. Simplified 34.1%

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

   if -inf.0 < (*.f64 V l) < -9.9999999996e-315

   1. Initial program 80.6%

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

      1. frac-2neg 80.6%

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

      2. sqrt-div 99.2%

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

      3. *-commutative 99.2%

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

      4. distribute-rgt-neg-in 99.2%

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

   4. Applied egg-rr 99.2%

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

   if -9.9999999996e-315 < (*.f64 V l) < 0.0

   1. Initial program 33.6%

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

      1. associate-/r* 69.6%

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

      2. clear-num 69.6%

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

      3. sqrt-div 72.5%

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

      4. metadata-eval 72.5%

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

      5. div-inv 72.4%

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

      6. clear-num 72.4%

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

   4. Applied egg-rr 72.4%

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

   if 0.0 < (*.f64 V l) < 1e266

   1. Initial program 78.0%

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

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

   4. Applied egg-rr 99.4%

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

   if 1e266 < (*.f64 V l)

   1. Initial program 51.0%

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

      1. *-commutative 51.0%

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

      2. associate-/l/ 78.9%

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

   3. Simplified 78.9%

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

4. Final simplification 89.3%

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

Alternative 2: 85.5% 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 -4 \cdot 10^{+51}:\\ \;\;\;\;c0 \cdot \left(\sqrt{\frac{A}{V}} \cdot \sqrt{\frac{1}{\ell}}\right)\\ \mathbf{elif}\;V \cdot \ell \leq -5 \cdot 10^{-204}:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\frac{V \cdot \ell}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 0:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+266}:\\ \;\;\;\;c0 \cdot \frac{1}{\frac{\sqrt{V \cdot \ell}}{\sqrt{A}}}\\ \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
 (if (<= (* V l) -4e+51)
   (* c0 (* (sqrt (/ A V)) (sqrt (/ 1.0 l))))
   (if (<= (* V l) -5e-204)
     (* c0 (/ 1.0 (sqrt (/ (* V l) A))))
     (if (<= (* V l) 0.0)
       (* c0 (/ 1.0 (sqrt (* l (/ V A)))))
       (if (<= (* V l) 1e+266)
         (* c0 (/ 1.0 (/ (sqrt (* V l)) (sqrt A))))
         (* c0 (sqrt (/ (/ A 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) <= -4e+51) {
		tmp = c0 * (sqrt((A / V)) * sqrt((1.0 / l)));
	} else if ((V * l) <= -5e-204) {
		tmp = c0 * (1.0 / sqrt(((V * l) / A)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (1.0 / (sqrt((V * l)) / sqrt(A)));
	} 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) :: tmp
    if ((v * l) <= (-4d+51)) then
        tmp = c0 * (sqrt((a / v)) * sqrt((1.0d0 / l)))
    else if ((v * l) <= (-5d-204)) then
        tmp = c0 * (1.0d0 / sqrt(((v * l) / a)))
    else if ((v * l) <= 0.0d0) then
        tmp = c0 * (1.0d0 / sqrt((l * (v / a))))
    else if ((v * l) <= 1d+266) then
        tmp = c0 * (1.0d0 / (sqrt((v * l)) / sqrt(a)))
    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 tmp;
	if ((V * l) <= -4e+51) {
		tmp = c0 * (Math.sqrt((A / V)) * Math.sqrt((1.0 / l)));
	} else if ((V * l) <= -5e-204) {
		tmp = c0 * (1.0 / Math.sqrt(((V * l) / A)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / Math.sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (1.0 / (Math.sqrt((V * l)) / Math.sqrt(A)));
	} 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):
	tmp = 0
	if (V * l) <= -4e+51:
		tmp = c0 * (math.sqrt((A / V)) * math.sqrt((1.0 / l)))
	elif (V * l) <= -5e-204:
		tmp = c0 * (1.0 / math.sqrt(((V * l) / A)))
	elif (V * l) <= 0.0:
		tmp = c0 * (1.0 / math.sqrt((l * (V / A))))
	elif (V * l) <= 1e+266:
		tmp = c0 * (1.0 / (math.sqrt((V * l)) / math.sqrt(A)))
	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)
	tmp = 0.0
	if (Float64(V * l) <= -4e+51)
		tmp = Float64(c0 * Float64(sqrt(Float64(A / V)) * sqrt(Float64(1.0 / l))));
	elseif (Float64(V * l) <= -5e-204)
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(Float64(V * l) / A))));
	elseif (Float64(V * l) <= 0.0)
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(l * Float64(V / A)))));
	elseif (Float64(V * l) <= 1e+266)
		tmp = Float64(c0 * Float64(1.0 / Float64(sqrt(Float64(V * l)) / sqrt(A))));
	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)
	tmp = 0.0;
	if ((V * l) <= -4e+51)
		tmp = c0 * (sqrt((A / V)) * sqrt((1.0 / l)));
	elseif ((V * l) <= -5e-204)
		tmp = c0 * (1.0 / sqrt(((V * l) / A)));
	elseif ((V * l) <= 0.0)
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	elseif ((V * l) <= 1e+266)
		tmp = c0 * (1.0 / (sqrt((V * l)) / sqrt(A)));
	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_] := If[LessEqual[N[(V * l), $MachinePrecision], -4e+51], N[(c0 * N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -5e-204], N[(c0 * N[(1.0 / N[Sqrt[N[(N[(V * l), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[(c0 * N[(1.0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+266], N[(c0 * N[(1.0 / N[(N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision] / N[Sqrt[A], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.f64 V l) < -4e51

   1. Initial program 56.8%

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

      1. pow1/2 56.8%

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

      2. associate-/r* 62.5%

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

      3. div-inv 62.4%

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

      4. unpow-prod-down 34.9%

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

      5. pow1/2 34.9%

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

   4. Applied egg-rr 34.9%

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

      1. unpow1/2 34.9%

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

   6. Simplified 34.9%

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

   if -4e51 < (*.f64 V l) < -5.0000000000000002e-204

   1. Initial program 94.9%

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

      1. associate-/r* 80.5%

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

      2. clear-num 80.5%

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

      3. sqrt-div 80.5%

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

      4. metadata-eval 80.5%

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

      5. div-inv 80.4%

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

      6. clear-num 81.8%

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

   4. Applied egg-rr 81.8%

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

      1. *-commutative 81.8%

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

      2. associate-*l/ 96.7%

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

   6. Simplified 96.7%

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

   if -5.0000000000000002e-204 < (*.f64 V l) < 0.0

   1. Initial program 47.5%

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

      1. associate-/r* 69.8%

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

      2. clear-num 69.8%

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

      3. sqrt-div 71.6%

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

      4. metadata-eval 71.6%

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

      5. div-inv 71.5%

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

      6. clear-num 71.5%

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

   4. Applied egg-rr 71.5%

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

   if 0.0 < (*.f64 V l) < 1e266

   1. Initial program 78.0%

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

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

   4. Applied egg-rr 99.4%

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

   if 1e266 < (*.f64 V l)

   1. Initial program 51.0%

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

      1. *-commutative 51.0%

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

      2. associate-/l/ 78.9%

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

   3. Simplified 78.9%

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

4. Final simplification 77.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -4 \cdot 10^{+51}:\\ \;\;\;\;c0 \cdot \left(\sqrt{\frac{A}{V}} \cdot \sqrt{\frac{1}{\ell}}\right)\\ \mathbf{elif}\;V \cdot \ell \leq -5 \cdot 10^{-204}:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\frac{V \cdot \ell}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 0:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+266}:\\ \;\;\;\;c0 \cdot \frac{1}{\frac{\sqrt{V \cdot \ell}}{\sqrt{A}}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 84.1% 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 -\infty:\\ \;\;\;\;c0 \cdot \sqrt{\frac{1}{V} \cdot \frac{A}{\ell}}\\ \mathbf{elif}\;V \cdot \ell \leq -1 \cdot 10^{-224}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\ \mathbf{elif}\;V \cdot \ell \leq 0:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+266}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \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
 (if (<= (* V l) (- INFINITY))
   (* c0 (sqrt (* (/ 1.0 V) (/ A l))))
   (if (<= (* V l) -1e-224)
     (* c0 (sqrt (/ A (* V l))))
     (if (<= (* V l) 0.0)
       (* c0 (/ 1.0 (sqrt (* l (/ V A)))))
       (if (<= (* V l) 1e+266)
         (* c0 (/ (sqrt A) (sqrt (* V l))))
         (* c0 (sqrt (/ (/ A 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) <= -((double) INFINITY)) {
		tmp = c0 * sqrt(((1.0 / V) * (A / l)));
	} else if ((V * l) <= -1e-224) {
		tmp = c0 * sqrt((A / (V * l)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	} else {
		tmp = c0 * sqrt(((A / V) / l));
	}
	return tmp;
}

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) <= -Double.POSITIVE_INFINITY) {
		tmp = c0 * Math.sqrt(((1.0 / V) * (A / l)));
	} else if ((V * l) <= -1e-224) {
		tmp = c0 * Math.sqrt((A / (V * l)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / Math.sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
	} 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):
	tmp = 0
	if (V * l) <= -math.inf:
		tmp = c0 * math.sqrt(((1.0 / V) * (A / l)))
	elif (V * l) <= -1e-224:
		tmp = c0 * math.sqrt((A / (V * l)))
	elif (V * l) <= 0.0:
		tmp = c0 * (1.0 / math.sqrt((l * (V / A))))
	elif (V * l) <= 1e+266:
		tmp = c0 * (math.sqrt(A) / math.sqrt((V * l)))
	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)
	tmp = 0.0
	if (Float64(V * l) <= Float64(-Inf))
		tmp = Float64(c0 * sqrt(Float64(Float64(1.0 / V) * Float64(A / l))));
	elseif (Float64(V * l) <= -1e-224)
		tmp = Float64(c0 * sqrt(Float64(A / Float64(V * l))));
	elseif (Float64(V * l) <= 0.0)
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(l * Float64(V / A)))));
	elseif (Float64(V * l) <= 1e+266)
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l))));
	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)
	tmp = 0.0;
	if ((V * l) <= -Inf)
		tmp = c0 * sqrt(((1.0 / V) * (A / l)));
	elseif ((V * l) <= -1e-224)
		tmp = c0 * sqrt((A / (V * l)));
	elseif ((V * l) <= 0.0)
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	elseif ((V * l) <= 1e+266)
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	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_] := If[LessEqual[N[(V * l), $MachinePrecision], (-Infinity)], N[(c0 * N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -1e-224], N[(c0 * N[Sqrt[N[(A / N[(V * l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[(c0 * N[(1.0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+266], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.f64 V l) < -inf.0

   1. Initial program 31.3%

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

      1. *-un-lft-identity 31.3%

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

      2. times-frac 63.4%

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

   4. Applied egg-rr 63.4%

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

   if -inf.0 < (*.f64 V l) < -1e-224

   1. Initial program 82.7%

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

   if -1e-224 < (*.f64 V l) < 0.0

   1. Initial program 45.0%

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

      1. associate-/r* 69.2%

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

      2. clear-num 69.2%

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

      3. sqrt-div 71.2%

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

      4. metadata-eval 71.2%

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

      5. div-inv 71.1%

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

      6. clear-num 71.1%

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

   4. Applied egg-rr 71.1%

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

   if 0.0 < (*.f64 V l) < 1e266

   1. Initial program 78.0%

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

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

   4. Applied egg-rr 99.3%

      \[\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 1e266 < (*.f64 V l)

   1. Initial program 51.0%

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

      1. *-commutative 51.0%

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

      2. associate-/l/ 78.9%

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

   3. Simplified 78.9%

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

4. Final simplification 84.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -\infty:\\ \;\;\;\;c0 \cdot \sqrt{\frac{1}{V} \cdot \frac{A}{\ell}}\\ \mathbf{elif}\;V \cdot \ell \leq -1 \cdot 10^{-224}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\ \mathbf{elif}\;V \cdot \ell \leq 0:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+266}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 85.5% 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 -4 \cdot 10^{+51}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}}\\ \mathbf{elif}\;V \cdot \ell \leq -5 \cdot 10^{-204}:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\frac{V \cdot \ell}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 0:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+266}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \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
 (if (<= (* V l) -4e+51)
   (* c0 (/ (sqrt (/ A V)) (sqrt l)))
   (if (<= (* V l) -5e-204)
     (* c0 (/ 1.0 (sqrt (/ (* V l) A))))
     (if (<= (* V l) 0.0)
       (* c0 (/ 1.0 (sqrt (* l (/ V A)))))
       (if (<= (* V l) 1e+266)
         (* c0 (/ (sqrt A) (sqrt (* V l))))
         (* c0 (sqrt (/ (/ A 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) <= -4e+51) {
		tmp = c0 * (sqrt((A / V)) / sqrt(l));
	} else if ((V * l) <= -5e-204) {
		tmp = c0 * (1.0 / sqrt(((V * l) / A)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	} 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) :: tmp
    if ((v * l) <= (-4d+51)) then
        tmp = c0 * (sqrt((a / v)) / sqrt(l))
    else if ((v * l) <= (-5d-204)) then
        tmp = c0 * (1.0d0 / sqrt(((v * l) / a)))
    else if ((v * l) <= 0.0d0) then
        tmp = c0 * (1.0d0 / sqrt((l * (v / a))))
    else if ((v * l) <= 1d+266) then
        tmp = c0 * (sqrt(a) / sqrt((v * l)))
    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 tmp;
	if ((V * l) <= -4e+51) {
		tmp = c0 * (Math.sqrt((A / V)) / Math.sqrt(l));
	} else if ((V * l) <= -5e-204) {
		tmp = c0 * (1.0 / Math.sqrt(((V * l) / A)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / Math.sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
	} 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):
	tmp = 0
	if (V * l) <= -4e+51:
		tmp = c0 * (math.sqrt((A / V)) / math.sqrt(l))
	elif (V * l) <= -5e-204:
		tmp = c0 * (1.0 / math.sqrt(((V * l) / A)))
	elif (V * l) <= 0.0:
		tmp = c0 * (1.0 / math.sqrt((l * (V / A))))
	elif (V * l) <= 1e+266:
		tmp = c0 * (math.sqrt(A) / math.sqrt((V * l)))
	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)
	tmp = 0.0
	if (Float64(V * l) <= -4e+51)
		tmp = Float64(c0 * Float64(sqrt(Float64(A / V)) / sqrt(l)));
	elseif (Float64(V * l) <= -5e-204)
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(Float64(V * l) / A))));
	elseif (Float64(V * l) <= 0.0)
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(l * Float64(V / A)))));
	elseif (Float64(V * l) <= 1e+266)
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l))));
	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)
	tmp = 0.0;
	if ((V * l) <= -4e+51)
		tmp = c0 * (sqrt((A / V)) / sqrt(l));
	elseif ((V * l) <= -5e-204)
		tmp = c0 * (1.0 / sqrt(((V * l) / A)));
	elseif ((V * l) <= 0.0)
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	elseif ((V * l) <= 1e+266)
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	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_] := If[LessEqual[N[(V * l), $MachinePrecision], -4e+51], N[(c0 * N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -5e-204], N[(c0 * N[(1.0 / N[Sqrt[N[(N[(V * l), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[(c0 * N[(1.0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+266], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.f64 V l) < -4e51

   1. Initial program 56.8%

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

      1. associate-/r* 62.5%

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

      2. sqrt-div 34.9%

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

      3. div-inv 34.9%

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

   4. Applied egg-rr 34.9%

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

      1. associate-*r/ 34.9%

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

      2. *-rgt-identity 34.9%

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

   6. Simplified 34.9%

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

   if -4e51 < (*.f64 V l) < -5.0000000000000002e-204

   1. Initial program 94.9%

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

      1. associate-/r* 80.5%

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

      2. clear-num 80.5%

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

      3. sqrt-div 80.5%

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

      4. metadata-eval 80.5%

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

      5. div-inv 80.4%

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

      6. clear-num 81.8%

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

   4. Applied egg-rr 81.8%

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

      1. *-commutative 81.8%

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

      2. associate-*l/ 96.7%

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

   6. Simplified 96.7%

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

   if -5.0000000000000002e-204 < (*.f64 V l) < 0.0

   1. Initial program 47.5%

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

      1. associate-/r* 69.8%

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

      2. clear-num 69.8%

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

      3. sqrt-div 71.6%

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

      4. metadata-eval 71.6%

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

      5. div-inv 71.5%

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

      6. clear-num 71.5%

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

   4. Applied egg-rr 71.5%

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

   if 0.0 < (*.f64 V l) < 1e266

   1. Initial program 78.0%

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

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

   4. Applied egg-rr 99.3%

      \[\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 1e266 < (*.f64 V l)

   1. Initial program 51.0%

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

      1. *-commutative 51.0%

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

      2. associate-/l/ 78.9%

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

   3. Simplified 78.9%

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

4. Final simplification 77.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -4 \cdot 10^{+51}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}}\\ \mathbf{elif}\;V \cdot \ell \leq -5 \cdot 10^{-204}:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\frac{V \cdot \ell}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 0:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+266}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 85.5% 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 -4 \cdot 10^{+51}:\\ \;\;\;\;c0 \cdot \left(\sqrt{\frac{A}{V}} \cdot \sqrt{\frac{1}{\ell}}\right)\\ \mathbf{elif}\;V \cdot \ell \leq -5 \cdot 10^{-204}:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\frac{V \cdot \ell}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 0:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+266}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \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
 (if (<= (* V l) -4e+51)
   (* c0 (* (sqrt (/ A V)) (sqrt (/ 1.0 l))))
   (if (<= (* V l) -5e-204)
     (* c0 (/ 1.0 (sqrt (/ (* V l) A))))
     (if (<= (* V l) 0.0)
       (* c0 (/ 1.0 (sqrt (* l (/ V A)))))
       (if (<= (* V l) 1e+266)
         (* c0 (/ (sqrt A) (sqrt (* V l))))
         (* c0 (sqrt (/ (/ A 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) <= -4e+51) {
		tmp = c0 * (sqrt((A / V)) * sqrt((1.0 / l)));
	} else if ((V * l) <= -5e-204) {
		tmp = c0 * (1.0 / sqrt(((V * l) / A)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	} 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) :: tmp
    if ((v * l) <= (-4d+51)) then
        tmp = c0 * (sqrt((a / v)) * sqrt((1.0d0 / l)))
    else if ((v * l) <= (-5d-204)) then
        tmp = c0 * (1.0d0 / sqrt(((v * l) / a)))
    else if ((v * l) <= 0.0d0) then
        tmp = c0 * (1.0d0 / sqrt((l * (v / a))))
    else if ((v * l) <= 1d+266) then
        tmp = c0 * (sqrt(a) / sqrt((v * l)))
    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 tmp;
	if ((V * l) <= -4e+51) {
		tmp = c0 * (Math.sqrt((A / V)) * Math.sqrt((1.0 / l)));
	} else if ((V * l) <= -5e-204) {
		tmp = c0 * (1.0 / Math.sqrt(((V * l) / A)));
	} else if ((V * l) <= 0.0) {
		tmp = c0 * (1.0 / Math.sqrt((l * (V / A))));
	} else if ((V * l) <= 1e+266) {
		tmp = c0 * (Math.sqrt(A) / Math.sqrt((V * l)));
	} 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):
	tmp = 0
	if (V * l) <= -4e+51:
		tmp = c0 * (math.sqrt((A / V)) * math.sqrt((1.0 / l)))
	elif (V * l) <= -5e-204:
		tmp = c0 * (1.0 / math.sqrt(((V * l) / A)))
	elif (V * l) <= 0.0:
		tmp = c0 * (1.0 / math.sqrt((l * (V / A))))
	elif (V * l) <= 1e+266:
		tmp = c0 * (math.sqrt(A) / math.sqrt((V * l)))
	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)
	tmp = 0.0
	if (Float64(V * l) <= -4e+51)
		tmp = Float64(c0 * Float64(sqrt(Float64(A / V)) * sqrt(Float64(1.0 / l))));
	elseif (Float64(V * l) <= -5e-204)
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(Float64(V * l) / A))));
	elseif (Float64(V * l) <= 0.0)
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(l * Float64(V / A)))));
	elseif (Float64(V * l) <= 1e+266)
		tmp = Float64(c0 * Float64(sqrt(A) / sqrt(Float64(V * l))));
	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)
	tmp = 0.0;
	if ((V * l) <= -4e+51)
		tmp = c0 * (sqrt((A / V)) * sqrt((1.0 / l)));
	elseif ((V * l) <= -5e-204)
		tmp = c0 * (1.0 / sqrt(((V * l) / A)));
	elseif ((V * l) <= 0.0)
		tmp = c0 * (1.0 / sqrt((l * (V / A))));
	elseif ((V * l) <= 1e+266)
		tmp = c0 * (sqrt(A) / sqrt((V * l)));
	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_] := If[LessEqual[N[(V * l), $MachinePrecision], -4e+51], N[(c0 * N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(1.0 / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], -5e-204], N[(c0 * N[(1.0 / N[Sqrt[N[(N[(V * l), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[(c0 * N[(1.0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(V * l), $MachinePrecision], 1e+266], N[(c0 * N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(V * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.f64 V l) < -4e51

   1. Initial program 56.8%

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

      1. pow1/2 56.8%

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

      2. associate-/r* 62.5%

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

      3. div-inv 62.4%

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

      4. unpow-prod-down 34.9%

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

      5. pow1/2 34.9%

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

   4. Applied egg-rr 34.9%

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

      1. unpow1/2 34.9%

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

   6. Simplified 34.9%

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

   if -4e51 < (*.f64 V l) < -5.0000000000000002e-204

   1. Initial program 94.9%

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

      1. associate-/r* 80.5%

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

      2. clear-num 80.5%

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

      3. sqrt-div 80.5%

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

      4. metadata-eval 80.5%

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

      5. div-inv 80.4%

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

      6. clear-num 81.8%

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

   4. Applied egg-rr 81.8%

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

      1. *-commutative 81.8%

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

      2. associate-*l/ 96.7%

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

   6. Simplified 96.7%

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

   if -5.0000000000000002e-204 < (*.f64 V l) < 0.0

   1. Initial program 47.5%

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

      1. associate-/r* 69.8%

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

      2. clear-num 69.8%

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

      3. sqrt-div 71.6%

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

      4. metadata-eval 71.6%

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

      5. div-inv 71.5%

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

      6. clear-num 71.5%

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

   4. Applied egg-rr 71.5%

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

   if 0.0 < (*.f64 V l) < 1e266

   1. Initial program 78.0%

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

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

   4. Applied egg-rr 99.3%

      \[\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 1e266 < (*.f64 V l)

   1. Initial program 51.0%

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

      1. *-commutative 51.0%

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

      2. associate-/l/ 78.9%

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

   3. Simplified 78.9%

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

4. Final simplification 77.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq -4 \cdot 10^{+51}:\\ \;\;\;\;c0 \cdot \left(\sqrt{\frac{A}{V}} \cdot \sqrt{\frac{1}{\ell}}\right)\\ \mathbf{elif}\;V \cdot \ell \leq -5 \cdot 10^{-204}:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\frac{V \cdot \ell}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 0:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \mathbf{elif}\;V \cdot \ell \leq 10^{+266}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A}}{\sqrt{V \cdot \ell}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 79.1% accurate, 0.8× 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 0:\\ \;\;\;\;c0 \cdot \sqrt{\frac{1}{V} \cdot \frac{A}{\ell}}\\ \mathbf{elif}\;t\_0 \leq 1.2 \cdot 10^{+275}:\\ \;\;\;\;c0 \cdot \sqrt{A \cdot \left(\frac{1}{\ell} \cdot \frac{1}{V}\right)}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{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 0.0)
     (* c0 (sqrt (* (/ 1.0 V) (/ A l))))
     (if (<= t_0 1.2e+275)
       (* c0 (sqrt (* A (* (/ 1.0 l) (/ 1.0 V)))))
       (* c0 (/ 1.0 (sqrt (* l (/ V 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 <= 0.0) {
		tmp = c0 * sqrt(((1.0 / V) * (A / l)));
	} else if (t_0 <= 1.2e+275) {
		tmp = c0 * sqrt((A * ((1.0 / l) * (1.0 / V))));
	} else {
		tmp = c0 * (1.0 / sqrt((l * (V / 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 <= 0.0d0) then
        tmp = c0 * sqrt(((1.0d0 / v) * (a / l)))
    else if (t_0 <= 1.2d+275) then
        tmp = c0 * sqrt((a * ((1.0d0 / l) * (1.0d0 / v))))
    else
        tmp = c0 * (1.0d0 / sqrt((l * (v / 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 <= 0.0) {
		tmp = c0 * Math.sqrt(((1.0 / V) * (A / l)));
	} else if (t_0 <= 1.2e+275) {
		tmp = c0 * Math.sqrt((A * ((1.0 / l) * (1.0 / V))));
	} else {
		tmp = c0 * (1.0 / Math.sqrt((l * (V / 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 <= 0.0:
		tmp = c0 * math.sqrt(((1.0 / V) * (A / l)))
	elif t_0 <= 1.2e+275:
		tmp = c0 * math.sqrt((A * ((1.0 / l) * (1.0 / V))))
	else:
		tmp = c0 * (1.0 / math.sqrt((l * (V / 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 <= 0.0)
		tmp = Float64(c0 * sqrt(Float64(Float64(1.0 / V) * Float64(A / l))));
	elseif (t_0 <= 1.2e+275)
		tmp = Float64(c0 * sqrt(Float64(A * Float64(Float64(1.0 / l) * Float64(1.0 / V)))));
	else
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(l * Float64(V / 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 <= 0.0)
		tmp = c0 * sqrt(((1.0 / V) * (A / l)));
	elseif (t_0 <= 1.2e+275)
		tmp = c0 * sqrt((A * ((1.0 / l) * (1.0 / V))));
	else
		tmp = c0 * (1.0 / sqrt((l * (V / 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, 0.0], N[(c0 * N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.2e+275], N[(c0 * N[Sqrt[N[(A * N[(N[(1.0 / l), $MachinePrecision] * N[(1.0 / V), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(1.0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 34.6%

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

      1. *-un-lft-identity 34.6%

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

      2. times-frac 53.2%

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

   4. Applied egg-rr 53.2%

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

   if 0.0 < (/.f64 A (*.f64 V l)) < 1.19999999999999998e275

   1. Initial program 98.8%

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

      1. associate-/r* 87.7%

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

      2. div-inv 87.7%

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

      3. div-inv 87.6%

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

      4. associate-*l* 98.9%

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

   4. Applied egg-rr 98.9%

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

   if 1.19999999999999998e275 < (/.f64 A (*.f64 V l))

   1. Initial program 41.8%

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

      1. associate-/r* 56.8%

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

      2. clear-num 56.8%

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

      3. sqrt-div 59.8%

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

      4. metadata-eval 59.8%

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

      5. div-inv 59.8%

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

      6. clear-num 59.8%

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

   4. Applied egg-rr 59.8%

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

4. Final simplification 77.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{A}{V \cdot \ell} \leq 0:\\ \;\;\;\;c0 \cdot \sqrt{\frac{1}{V} \cdot \frac{A}{\ell}}\\ \mathbf{elif}\;\frac{A}{V \cdot \ell} \leq 1.2 \cdot 10^{+275}:\\ \;\;\;\;c0 \cdot \sqrt{A \cdot \left(\frac{1}{\ell} \cdot \frac{1}{V}\right)}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{A}}}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 79.3% accurate, 0.8× 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 0:\\ \;\;\;\;c0 \cdot \sqrt{\frac{1}{V} \cdot \frac{A}{\ell}}\\ \mathbf{elif}\;t\_0 \leq 1.2 \cdot 10^{+275}:\\ \;\;\;\;c0 \cdot \sqrt{t\_0}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{1}{\sqrt{\ell \cdot \frac{V}{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 0.0)
     (* c0 (sqrt (* (/ 1.0 V) (/ A l))))
     (if (<= t_0 1.2e+275)
       (* c0 (sqrt t_0))
       (* c0 (/ 1.0 (sqrt (* l (/ V 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 <= 0.0) {
		tmp = c0 * sqrt(((1.0 / V) * (A / l)));
	} else if (t_0 <= 1.2e+275) {
		tmp = c0 * sqrt(t_0);
	} else {
		tmp = c0 * (1.0 / sqrt((l * (V / 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 <= 0.0d0) then
        tmp = c0 * sqrt(((1.0d0 / v) * (a / l)))
    else if (t_0 <= 1.2d+275) then
        tmp = c0 * sqrt(t_0)
    else
        tmp = c0 * (1.0d0 / sqrt((l * (v / 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 <= 0.0) {
		tmp = c0 * Math.sqrt(((1.0 / V) * (A / l)));
	} else if (t_0 <= 1.2e+275) {
		tmp = c0 * Math.sqrt(t_0);
	} else {
		tmp = c0 * (1.0 / Math.sqrt((l * (V / 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 <= 0.0:
		tmp = c0 * math.sqrt(((1.0 / V) * (A / l)))
	elif t_0 <= 1.2e+275:
		tmp = c0 * math.sqrt(t_0)
	else:
		tmp = c0 * (1.0 / math.sqrt((l * (V / 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 <= 0.0)
		tmp = Float64(c0 * sqrt(Float64(Float64(1.0 / V) * Float64(A / l))));
	elseif (t_0 <= 1.2e+275)
		tmp = Float64(c0 * sqrt(t_0));
	else
		tmp = Float64(c0 * Float64(1.0 / sqrt(Float64(l * Float64(V / 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 <= 0.0)
		tmp = c0 * sqrt(((1.0 / V) * (A / l)));
	elseif (t_0 <= 1.2e+275)
		tmp = c0 * sqrt(t_0);
	else
		tmp = c0 * (1.0 / sqrt((l * (V / 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, 0.0], N[(c0 * N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.2e+275], N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision], N[(c0 * N[(1.0 / N[Sqrt[N[(l * N[(V / A), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 34.6%

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

      1. *-un-lft-identity 34.6%

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

      2. times-frac 53.2%

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

   4. Applied egg-rr 53.2%

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

   if 0.0 < (/.f64 A (*.f64 V l)) < 1.19999999999999998e275

   1. Initial program 98.8%

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

   if 1.19999999999999998e275 < (/.f64 A (*.f64 V l))

   1. Initial program 41.8%

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

      1. associate-/r* 56.8%

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

      2. clear-num 56.8%

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

      3. sqrt-div 59.8%

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

      4. metadata-eval 59.8%

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

      5. div-inv 59.8%

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

      6. clear-num 59.8%

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

   4. Applied egg-rr 59.8%

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

4. Final simplification 77.2%

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

Alternative 8: 78.9% 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 0 \lor \neg \left(t\_0 \leq 1.2 \cdot 10^{+275}\right):\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{t\_0}\\ \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 (or (<= t_0 0.0) (not (<= t_0 1.2e+275)))
     (* c0 (sqrt (/ (/ A V) l)))
     (* c0 (sqrt t_0)))))

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 <= 0.0) || !(t_0 <= 1.2e+275)) {
		tmp = c0 * sqrt(((A / V) / l));
	} else {
		tmp = c0 * sqrt(t_0);
	}
	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 <= 0.0d0) .or. (.not. (t_0 <= 1.2d+275))) then
        tmp = c0 * sqrt(((a / v) / l))
    else
        tmp = c0 * sqrt(t_0)
    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 <= 0.0) || !(t_0 <= 1.2e+275)) {
		tmp = c0 * Math.sqrt(((A / V) / l));
	} else {
		tmp = c0 * Math.sqrt(t_0);
	}
	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 <= 0.0) or not (t_0 <= 1.2e+275):
		tmp = c0 * math.sqrt(((A / V) / l))
	else:
		tmp = c0 * math.sqrt(t_0)
	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 <= 0.0) || !(t_0 <= 1.2e+275))
		tmp = Float64(c0 * sqrt(Float64(Float64(A / V) / l)));
	else
		tmp = Float64(c0 * sqrt(t_0));
	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 <= 0.0) || ~((t_0 <= 1.2e+275)))
		tmp = c0 * sqrt(((A / V) / l));
	else
		tmp = c0 * sqrt(t_0);
	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[Or[LessEqual[t$95$0, 0.0], N[Not[LessEqual[t$95$0, 1.2e+275]], $MachinePrecision]], N[(c0 * N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[t$95$0], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 A (*.f64 V l)) < 0.0 or 1.19999999999999998e275 < (/.f64 A (*.f64 V l))

   1. Initial program 38.4%

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

      1. *-commutative 38.4%

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

      2. associate-/l/ 55.1%

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

   3. Simplified 55.1%

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

   if 0.0 < (/.f64 A (*.f64 V l)) < 1.19999999999999998e275

   1. Initial program 98.8%

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

4. Final simplification 76.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{A}{V \cdot \ell} \leq 0 \lor \neg \left(\frac{A}{V \cdot \ell} \leq 1.2 \cdot 10^{+275}\right):\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{V}}{\ell}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{A}{V \cdot \ell}}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 78.9% 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 0:\\ \;\;\;\;c0 \cdot \sqrt{\frac{1}{V} \cdot \frac{A}{\ell}}\\ \mathbf{elif}\;t\_0 \leq 1.2 \cdot 10^{+275}:\\ \;\;\;\;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 0.0)
     (* c0 (sqrt (* (/ 1.0 V) (/ A l))))
     (if (<= t_0 1.2e+275) (* 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 <= 0.0) {
		tmp = c0 * sqrt(((1.0 / V) * (A / l)));
	} else if (t_0 <= 1.2e+275) {
		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 <= 0.0d0) then
        tmp = c0 * sqrt(((1.0d0 / v) * (a / l)))
    else if (t_0 <= 1.2d+275) 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 <= 0.0) {
		tmp = c0 * Math.sqrt(((1.0 / V) * (A / l)));
	} else if (t_0 <= 1.2e+275) {
		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 <= 0.0:
		tmp = c0 * math.sqrt(((1.0 / V) * (A / l)))
	elif t_0 <= 1.2e+275:
		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 <= 0.0)
		tmp = Float64(c0 * sqrt(Float64(Float64(1.0 / V) * Float64(A / l))));
	elseif (t_0 <= 1.2e+275)
		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 <= 0.0)
		tmp = c0 * sqrt(((1.0 / V) * (A / l)));
	elseif (t_0 <= 1.2e+275)
		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, 0.0], N[(c0 * N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 1.2e+275], 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 3 regimes

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

   1. Initial program 34.6%

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

      1. *-un-lft-identity 34.6%

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

      2. times-frac 53.2%

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

   4. Applied egg-rr 53.2%

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

   if 0.0 < (/.f64 A (*.f64 V l)) < 1.19999999999999998e275

   1. Initial program 98.8%

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

   if 1.19999999999999998e275 < (/.f64 A (*.f64 V l))

   1. Initial program 41.8%

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

      1. *-commutative 41.8%

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

      2. associate-/l/ 56.8%

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

   3. Simplified 56.8%

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

4. Final simplification 76.4%

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

Alternative 10: 73.1% 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 67.9%

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

3. Final simplification 67.9%

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

Reproduce

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