Henrywood and Agarwal, Equation (3)

Percentage Accurate: 73.9% → 90.9%

Time: 7.2s

Alternatives: 13

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.9% 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.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -\infty:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\ \mathbf{elif}\;\ell \cdot V \leq -1 \cdot 10^{-266}:\\ \;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-V\right) \cdot \ell}} \cdot c0\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;\frac{c0}{\sqrt{-V} \cdot \sqrt{\frac{-\ell}{A}}}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\left(\sqrt{A} \cdot \frac{1}{\sqrt{\ell \cdot V}}\right) \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \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 (<= (* l V) (- INFINITY))
   (/ c0 (* (sqrt (/ V A)) (sqrt l)))
   (if (<= (* l V) -1e-266)
     (* (/ (sqrt (- A)) (sqrt (* (- V) l))) c0)
     (if (<= (* l V) 0.0)
       (/ c0 (* (sqrt (- V)) (sqrt (/ (- l) A))))
       (if (<= (* l V) 2e+269)
         (* (* (sqrt A) (/ 1.0 (sqrt (* l V)))) c0)
         (* (sqrt (* (/ 1.0 V) (/ A l))) c0))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -((double) INFINITY)) {
		tmp = c0 / (sqrt((V / A)) * sqrt(l));
	} else if ((l * V) <= -1e-266) {
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / (sqrt(-V) * sqrt((-l / A)));
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	} else {
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	}
	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 ((l * V) <= -Double.POSITIVE_INFINITY) {
		tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
	} else if ((l * V) <= -1e-266) {
		tmp = (Math.sqrt(-A) / Math.sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / (Math.sqrt(-V) * Math.sqrt((-l / A)));
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt(A) * (1.0 / Math.sqrt((l * V)))) * c0;
	} else {
		tmp = Math.sqrt(((1.0 / V) * (A / l))) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -math.inf:
		tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l))
	elif (l * V) <= -1e-266:
		tmp = (math.sqrt(-A) / math.sqrt((-V * l))) * c0
	elif (l * V) <= 0.0:
		tmp = c0 / (math.sqrt(-V) * math.sqrt((-l / A)))
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt(A) * (1.0 / math.sqrt((l * V)))) * c0
	else:
		tmp = math.sqrt(((1.0 / V) * (A / l))) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= Float64(-Inf))
		tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l)));
	elseif (Float64(l * V) <= -1e-266)
		tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-V) * l))) * c0);
	elseif (Float64(l * V) <= 0.0)
		tmp = Float64(c0 / Float64(sqrt(Float64(-V)) * sqrt(Float64(Float64(-l) / A))));
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(A) * Float64(1.0 / sqrt(Float64(l * V)))) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(1.0 / V) * Float64(A / l))) * c0);
	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 ((l * V) <= -Inf)
		tmp = c0 / (sqrt((V / A)) * sqrt(l));
	elseif ((l * V) <= -1e-266)
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	elseif ((l * V) <= 0.0)
		tmp = c0 / (sqrt(-V) * sqrt((-l / A)));
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	else
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	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[(l * V), $MachinePrecision], (-Infinity)], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -1e-266], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-V) * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[(N[Sqrt[(-V)], $MachinePrecision] * N[Sqrt[N[((-l) / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[A], $MachinePrecision] * N[(1.0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

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

   1. Initial program 14.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 14.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 14.0

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

   4. Applied rewrites 14.0%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. lift-/.f64 N/A

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

      6. sqrt-prod N/A

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

      7. lift-sqrt.f64 N/A

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

      8. lift-sqrt.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 54.1

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

   6. Applied rewrites 54.1%

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

   if -inf.0 < (*.f64 V l) < -9.9999999999999998e-267

   1. Initial program 82.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 73.1

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

   4. Applied rewrites 73.1%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. associate-/l/ N/A

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

      6. sqrt-div N/A

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

      7. lower-/.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 99.5

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

   6. Applied rewrites 99.5%

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

   if -9.9999999999999998e-267 < (*.f64 V l) < -0.0

   1. Initial program 51.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 51.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 51.0

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

   4. Applied rewrites 51.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 74.1

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

   6. Applied rewrites 74.1%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. associate-/r/ N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. distribute-frac-neg2 N/A

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

      11. distribute-neg-frac N/A

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

      12. lower-/.f64 N/A

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

      13. lower-neg.f64 N/A

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

      14. pow1/2 N/A

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

      15. lower-sqrt.f64 N/A

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

      16. lower-neg.f64 54.1

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

   8. Applied rewrites 54.1%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. associate-/r/ N/A

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

      5. sqrt-prod N/A

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

      6. pow1/2 N/A

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

      7. lower-*.f64 N/A

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

      8. pow1/2 N/A

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

      9. sqrt-div N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. lower-sqrt.f64 99.3

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

   4. Applied rewrites 99.3%

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

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. div-inv N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 82.8

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

   4. Applied rewrites 82.8%

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

4. Final simplification 90.2%

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

Alternative 2: 77.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{A}{\ell \cdot V}} \cdot c0\\ \mathbf{if}\;t\_0 \leq 10^{-309}:\\ \;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\ \mathbf{elif}\;t\_0 \leq 10^{+292}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{V}{A} \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
 (let* ((t_0 (* (sqrt (/ A (* l V))) c0)))
   (if (<= t_0 1e-309)
     (* (sqrt (/ (/ A V) l)) c0)
     (if (<= t_0 1e+292) t_0 (/ c0 (sqrt (* (/ V A) l)))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double t_0 = sqrt((A / (l * V))) * c0;
	double tmp;
	if (t_0 <= 1e-309) {
		tmp = sqrt(((A / V) / l)) * c0;
	} else if (t_0 <= 1e+292) {
		tmp = t_0;
	} else {
		tmp = c0 / sqrt(((V / A) * 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 = sqrt((a / (l * v))) * c0
    if (t_0 <= 1d-309) then
        tmp = sqrt(((a / v) / l)) * c0
    else if (t_0 <= 1d+292) then
        tmp = t_0
    else
        tmp = c0 / sqrt(((v / a) * 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 = Math.sqrt((A / (l * V))) * c0;
	double tmp;
	if (t_0 <= 1e-309) {
		tmp = Math.sqrt(((A / V) / l)) * c0;
	} else if (t_0 <= 1e+292) {
		tmp = t_0;
	} else {
		tmp = c0 / Math.sqrt(((V / A) * l));
	}
	return tmp;
}

Python

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

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	t_0 = Float64(sqrt(Float64(A / Float64(l * V))) * c0)
	tmp = 0.0
	if (t_0 <= 1e-309)
		tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0);
	elseif (t_0 <= 1e+292)
		tmp = t_0;
	else
		tmp = Float64(c0 / sqrt(Float64(Float64(V / A) * 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 = sqrt((A / (l * V))) * c0;
	tmp = 0.0;
	if (t_0 <= 1e-309)
		tmp = sqrt(((A / V) / l)) * c0;
	elseif (t_0 <= 1e+292)
		tmp = t_0;
	else
		tmp = c0 / sqrt(((V / A) * 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[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 1e-309], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[t$95$0, 1e+292], t$95$0, N[(c0 / N[Sqrt[N[(N[(V / A), $MachinePrecision] * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 1.000000000000002e-309

   1. Initial program 68.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 76.3

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

   4. Applied rewrites 76.3%

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

   if 1.000000000000002e-309 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l)))) < 1e292

   1. Initial program 97.7%

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

   if 1e292 < (*.f64 c0 (sqrt.f64 (/.f64 A (*.f64 V l))))

   1. Initial program 46.4%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 49.1

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 49.1

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

   4. Applied rewrites 49.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 54.7

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

   6. Applied rewrites 54.7%

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

4. Final simplification 79.6%

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

Alternative 3: 90.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -\infty:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{V}{A}} \cdot \sqrt{\ell}}\\ \mathbf{elif}\;\ell \cdot V \leq -1 \cdot 10^{-266}:\\ \;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-V\right) \cdot \ell}} \cdot c0\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{\frac{A}{V}}}}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\left(\sqrt{A} \cdot \frac{1}{\sqrt{\ell \cdot V}}\right) \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \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 (<= (* l V) (- INFINITY))
   (/ c0 (* (sqrt (/ V A)) (sqrt l)))
   (if (<= (* l V) -1e-266)
     (* (/ (sqrt (- A)) (sqrt (* (- V) l))) c0)
     (if (<= (* l V) 0.0)
       (/ c0 (sqrt (/ l (/ A V))))
       (if (<= (* l V) 2e+269)
         (* (* (sqrt A) (/ 1.0 (sqrt (* l V)))) c0)
         (* (sqrt (* (/ 1.0 V) (/ A l))) c0))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -((double) INFINITY)) {
		tmp = c0 / (sqrt((V / A)) * sqrt(l));
	} else if ((l * V) <= -1e-266) {
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	} else {
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	}
	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 ((l * V) <= -Double.POSITIVE_INFINITY) {
		tmp = c0 / (Math.sqrt((V / A)) * Math.sqrt(l));
	} else if ((l * V) <= -1e-266) {
		tmp = (Math.sqrt(-A) / Math.sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / Math.sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt(A) * (1.0 / Math.sqrt((l * V)))) * c0;
	} else {
		tmp = Math.sqrt(((1.0 / V) * (A / l))) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -math.inf:
		tmp = c0 / (math.sqrt((V / A)) * math.sqrt(l))
	elif (l * V) <= -1e-266:
		tmp = (math.sqrt(-A) / math.sqrt((-V * l))) * c0
	elif (l * V) <= 0.0:
		tmp = c0 / math.sqrt((l / (A / V)))
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt(A) * (1.0 / math.sqrt((l * V)))) * c0
	else:
		tmp = math.sqrt(((1.0 / V) * (A / l))) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= Float64(-Inf))
		tmp = Float64(c0 / Float64(sqrt(Float64(V / A)) * sqrt(l)));
	elseif (Float64(l * V) <= -1e-266)
		tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-V) * l))) * c0);
	elseif (Float64(l * V) <= 0.0)
		tmp = Float64(c0 / sqrt(Float64(l / Float64(A / V))));
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(A) * Float64(1.0 / sqrt(Float64(l * V)))) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(1.0 / V) * Float64(A / l))) * c0);
	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 ((l * V) <= -Inf)
		tmp = c0 / (sqrt((V / A)) * sqrt(l));
	elseif ((l * V) <= -1e-266)
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	elseif ((l * V) <= 0.0)
		tmp = c0 / sqrt((l / (A / V)));
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	else
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	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[(l * V), $MachinePrecision], (-Infinity)], N[(c0 / N[(N[Sqrt[N[(V / A), $MachinePrecision]], $MachinePrecision] * N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -1e-266], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-V) * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[Sqrt[N[(l / N[(A / V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[A], $MachinePrecision] * N[(1.0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

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

   1. Initial program 14.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 14.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 14.0

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

   4. Applied rewrites 14.0%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. lift-/.f64 N/A

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

      6. sqrt-prod N/A

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

      7. lift-sqrt.f64 N/A

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

      8. lift-sqrt.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 54.1

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

   6. Applied rewrites 54.1%

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

   if -inf.0 < (*.f64 V l) < -9.9999999999999998e-267

   1. Initial program 82.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 73.1

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

   4. Applied rewrites 73.1%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. associate-/l/ N/A

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

      6. sqrt-div N/A

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

      7. lower-/.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 99.5

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

   6. Applied rewrites 99.5%

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

   if -9.9999999999999998e-267 < (*.f64 V l) < -0.0

   1. Initial program 51.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 51.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 51.0

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

   4. Applied rewrites 51.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 74.1

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

   6. Applied rewrites 74.1%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. associate-/r/ N/A

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

      5. sqrt-prod N/A

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

      6. pow1/2 N/A

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

      7. lower-*.f64 N/A

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

      8. pow1/2 N/A

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

      9. sqrt-div N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. lower-sqrt.f64 99.3

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

   4. Applied rewrites 99.3%

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

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. div-inv N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 82.8

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

   4. Applied rewrites 82.8%

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

4. Final simplification 92.8%

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

Alternative 4: 90.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -\infty:\\ \;\;\;\;\sqrt{\frac{A}{V}} \cdot \frac{c0}{\sqrt{\ell}}\\ \mathbf{elif}\;\ell \cdot V \leq -1 \cdot 10^{-266}:\\ \;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-V\right) \cdot \ell}} \cdot c0\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{\frac{A}{V}}}}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\left(\sqrt{A} \cdot \frac{1}{\sqrt{\ell \cdot V}}\right) \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \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 (<= (* l V) (- INFINITY))
   (* (sqrt (/ A V)) (/ c0 (sqrt l)))
   (if (<= (* l V) -1e-266)
     (* (/ (sqrt (- A)) (sqrt (* (- V) l))) c0)
     (if (<= (* l V) 0.0)
       (/ c0 (sqrt (/ l (/ A V))))
       (if (<= (* l V) 2e+269)
         (* (* (sqrt A) (/ 1.0 (sqrt (* l V)))) c0)
         (* (sqrt (* (/ 1.0 V) (/ A l))) c0))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -((double) INFINITY)) {
		tmp = sqrt((A / V)) * (c0 / sqrt(l));
	} else if ((l * V) <= -1e-266) {
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	} else {
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	}
	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 ((l * V) <= -Double.POSITIVE_INFINITY) {
		tmp = Math.sqrt((A / V)) * (c0 / Math.sqrt(l));
	} else if ((l * V) <= -1e-266) {
		tmp = (Math.sqrt(-A) / Math.sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / Math.sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt(A) * (1.0 / Math.sqrt((l * V)))) * c0;
	} else {
		tmp = Math.sqrt(((1.0 / V) * (A / l))) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -math.inf:
		tmp = math.sqrt((A / V)) * (c0 / math.sqrt(l))
	elif (l * V) <= -1e-266:
		tmp = (math.sqrt(-A) / math.sqrt((-V * l))) * c0
	elif (l * V) <= 0.0:
		tmp = c0 / math.sqrt((l / (A / V)))
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt(A) * (1.0 / math.sqrt((l * V)))) * c0
	else:
		tmp = math.sqrt(((1.0 / V) * (A / l))) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= Float64(-Inf))
		tmp = Float64(sqrt(Float64(A / V)) * Float64(c0 / sqrt(l)));
	elseif (Float64(l * V) <= -1e-266)
		tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-V) * l))) * c0);
	elseif (Float64(l * V) <= 0.0)
		tmp = Float64(c0 / sqrt(Float64(l / Float64(A / V))));
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(A) * Float64(1.0 / sqrt(Float64(l * V)))) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(1.0 / V) * Float64(A / l))) * c0);
	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 ((l * V) <= -Inf)
		tmp = sqrt((A / V)) * (c0 / sqrt(l));
	elseif ((l * V) <= -1e-266)
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	elseif ((l * V) <= 0.0)
		tmp = c0 / sqrt((l / (A / V)));
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	else
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	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[(l * V), $MachinePrecision], (-Infinity)], N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] * N[(c0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -1e-266], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-V) * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[Sqrt[N[(l / N[(A / V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[A], $MachinePrecision] * N[(1.0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

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

   1. Initial program 14.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/r* N/A

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

      6. sqrt-div N/A

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

      7. associate-*r/ N/A

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

      8. associate-*l/ N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lower-/.f64 53.8

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

   4. Applied rewrites 53.8%

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

   if -inf.0 < (*.f64 V l) < -9.9999999999999998e-267

   1. Initial program 82.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 73.1

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

   4. Applied rewrites 73.1%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. associate-/l/ N/A

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

      6. sqrt-div N/A

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

      7. lower-/.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 99.5

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

   6. Applied rewrites 99.5%

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

   if -9.9999999999999998e-267 < (*.f64 V l) < -0.0

   1. Initial program 51.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 51.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 51.0

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

   4. Applied rewrites 51.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 74.1

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

   6. Applied rewrites 74.1%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. associate-/r/ N/A

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

      5. sqrt-prod N/A

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

      6. pow1/2 N/A

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

      7. lower-*.f64 N/A

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

      8. pow1/2 N/A

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

      9. sqrt-div N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. lower-sqrt.f64 99.3

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

   4. Applied rewrites 99.3%

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

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. div-inv N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 82.8

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

   4. Applied rewrites 82.8%

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

4. Final simplification 92.8%

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

Alternative 5: 89.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -\infty:\\ \;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\ \mathbf{elif}\;\ell \cdot V \leq -1 \cdot 10^{-266}:\\ \;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-V\right) \cdot \ell}} \cdot c0\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{\frac{A}{V}}}}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\left(\sqrt{A} \cdot \frac{1}{\sqrt{\ell \cdot V}}\right) \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \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 (<= (* l V) (- INFINITY))
   (* (sqrt (/ (/ A V) l)) c0)
   (if (<= (* l V) -1e-266)
     (* (/ (sqrt (- A)) (sqrt (* (- V) l))) c0)
     (if (<= (* l V) 0.0)
       (/ c0 (sqrt (/ l (/ A V))))
       (if (<= (* l V) 2e+269)
         (* (* (sqrt A) (/ 1.0 (sqrt (* l V)))) c0)
         (* (sqrt (* (/ 1.0 V) (/ A l))) c0))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -((double) INFINITY)) {
		tmp = sqrt(((A / V) / l)) * c0;
	} else if ((l * V) <= -1e-266) {
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	} else {
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	}
	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 ((l * V) <= -Double.POSITIVE_INFINITY) {
		tmp = Math.sqrt(((A / V) / l)) * c0;
	} else if ((l * V) <= -1e-266) {
		tmp = (Math.sqrt(-A) / Math.sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / Math.sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt(A) * (1.0 / Math.sqrt((l * V)))) * c0;
	} else {
		tmp = Math.sqrt(((1.0 / V) * (A / l))) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -math.inf:
		tmp = math.sqrt(((A / V) / l)) * c0
	elif (l * V) <= -1e-266:
		tmp = (math.sqrt(-A) / math.sqrt((-V * l))) * c0
	elif (l * V) <= 0.0:
		tmp = c0 / math.sqrt((l / (A / V)))
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt(A) * (1.0 / math.sqrt((l * V)))) * c0
	else:
		tmp = math.sqrt(((1.0 / V) * (A / l))) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= Float64(-Inf))
		tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0);
	elseif (Float64(l * V) <= -1e-266)
		tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-V) * l))) * c0);
	elseif (Float64(l * V) <= 0.0)
		tmp = Float64(c0 / sqrt(Float64(l / Float64(A / V))));
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(A) * Float64(1.0 / sqrt(Float64(l * V)))) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(1.0 / V) * Float64(A / l))) * c0);
	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 ((l * V) <= -Inf)
		tmp = sqrt(((A / V) / l)) * c0;
	elseif ((l * V) <= -1e-266)
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	elseif ((l * V) <= 0.0)
		tmp = c0 / sqrt((l / (A / V)));
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	else
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	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[(l * V), $MachinePrecision], (-Infinity)], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -1e-266], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-V) * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[Sqrt[N[(l / N[(A / V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[A], $MachinePrecision] * N[(1.0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

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

   1. Initial program 14.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 70.0

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

   4. Applied rewrites 70.0%

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

   if -inf.0 < (*.f64 V l) < -9.9999999999999998e-267

   1. Initial program 82.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 73.1

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

   4. Applied rewrites 73.1%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. associate-/l/ N/A

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

      6. sqrt-div N/A

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

      7. lower-/.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 99.5

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

   6. Applied rewrites 99.5%

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

   if -9.9999999999999998e-267 < (*.f64 V l) < -0.0

   1. Initial program 51.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 51.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 51.0

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

   4. Applied rewrites 51.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 74.1

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

   6. Applied rewrites 74.1%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. associate-/r/ N/A

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

      5. sqrt-prod N/A

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

      6. pow1/2 N/A

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

      7. lower-*.f64 N/A

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

      8. pow1/2 N/A

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

      9. sqrt-div N/A

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

      10. metadata-eval N/A

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

      11. lower-/.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lift-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 N/A

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

      16. lower-sqrt.f64 99.3

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

   4. Applied rewrites 99.3%

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

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. div-inv N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 82.8

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

   4. Applied rewrites 82.8%

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

4. Final simplification 93.5%

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

Alternative 6: 89.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -\infty:\\ \;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\ \mathbf{elif}\;\ell \cdot V \leq -1 \cdot 10^{-266}:\\ \;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-V\right) \cdot \ell}} \cdot c0\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{\frac{A}{V}}}}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\left(\sqrt{\frac{1}{\ell \cdot V}} \cdot \sqrt{A}\right) \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \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 (<= (* l V) (- INFINITY))
   (* (sqrt (/ (/ A V) l)) c0)
   (if (<= (* l V) -1e-266)
     (* (/ (sqrt (- A)) (sqrt (* (- V) l))) c0)
     (if (<= (* l V) 0.0)
       (/ c0 (sqrt (/ l (/ A V))))
       (if (<= (* l V) 2e+269)
         (* (* (sqrt (/ 1.0 (* l V))) (sqrt A)) c0)
         (* (sqrt (* (/ 1.0 V) (/ A l))) c0))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -((double) INFINITY)) {
		tmp = sqrt(((A / V) / l)) * c0;
	} else if ((l * V) <= -1e-266) {
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt((1.0 / (l * V))) * sqrt(A)) * c0;
	} else {
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	}
	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 ((l * V) <= -Double.POSITIVE_INFINITY) {
		tmp = Math.sqrt(((A / V) / l)) * c0;
	} else if ((l * V) <= -1e-266) {
		tmp = (Math.sqrt(-A) / Math.sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / Math.sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt((1.0 / (l * V))) * Math.sqrt(A)) * c0;
	} else {
		tmp = Math.sqrt(((1.0 / V) * (A / l))) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -math.inf:
		tmp = math.sqrt(((A / V) / l)) * c0
	elif (l * V) <= -1e-266:
		tmp = (math.sqrt(-A) / math.sqrt((-V * l))) * c0
	elif (l * V) <= 0.0:
		tmp = c0 / math.sqrt((l / (A / V)))
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt((1.0 / (l * V))) * math.sqrt(A)) * c0
	else:
		tmp = math.sqrt(((1.0 / V) * (A / l))) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= Float64(-Inf))
		tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0);
	elseif (Float64(l * V) <= -1e-266)
		tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-V) * l))) * c0);
	elseif (Float64(l * V) <= 0.0)
		tmp = Float64(c0 / sqrt(Float64(l / Float64(A / V))));
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(Float64(1.0 / Float64(l * V))) * sqrt(A)) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(1.0 / V) * Float64(A / l))) * c0);
	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 ((l * V) <= -Inf)
		tmp = sqrt(((A / V) / l)) * c0;
	elseif ((l * V) <= -1e-266)
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	elseif ((l * V) <= 0.0)
		tmp = c0 / sqrt((l / (A / V)));
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt((1.0 / (l * V))) * sqrt(A)) * c0;
	else
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	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[(l * V), $MachinePrecision], (-Infinity)], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -1e-266], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-V) * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[Sqrt[N[(l / N[(A / V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[N[(1.0 / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

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

   1. Initial program 14.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 70.0

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

   4. Applied rewrites 70.0%

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

   if -inf.0 < (*.f64 V l) < -9.9999999999999998e-267

   1. Initial program 82.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 73.1

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

   4. Applied rewrites 73.1%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. associate-/l/ N/A

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

      6. sqrt-div N/A

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

      7. lower-/.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 99.5

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

   6. Applied rewrites 99.5%

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

   if -9.9999999999999998e-267 < (*.f64 V l) < -0.0

   1. Initial program 51.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 51.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 51.0

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

   4. Applied rewrites 51.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 74.1

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

   6. Applied rewrites 74.1%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 78.2

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

   4. Applied rewrites 78.2%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-/l/ N/A

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

      5. sqrt-div N/A

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

      6. *-commutative N/A

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

      7. sqrt-div N/A

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

      8. div-inv N/A

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

      9. sqrt-prod N/A

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

      10. lower-*.f64 N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-/.f64 N/A

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

      15. lower-*.f64 99.3

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

   6. Applied rewrites 99.3%

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

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. div-inv N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 82.8

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

   4. Applied rewrites 82.8%

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

4. Final simplification 93.4%

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

Alternative 7: 89.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -\infty:\\ \;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\ \mathbf{elif}\;\ell \cdot V \leq -1 \cdot 10^{-266}:\\ \;\;\;\;\frac{\sqrt{-A}}{\sqrt{\left(-V\right) \cdot \ell}} \cdot c0\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{\ell}{\frac{A}{V}}}}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \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 (<= (* l V) (- INFINITY))
   (* (sqrt (/ (/ A V) l)) c0)
   (if (<= (* l V) -1e-266)
     (* (/ (sqrt (- A)) (sqrt (* (- V) l))) c0)
     (if (<= (* l V) 0.0)
       (/ c0 (sqrt (/ l (/ A V))))
       (if (<= (* l V) 2e+269)
         (* (/ (sqrt A) (sqrt (* l V))) c0)
         (* (sqrt (* (/ 1.0 V) (/ A l))) c0))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -((double) INFINITY)) {
		tmp = sqrt(((A / V) / l)) * c0;
	} else if ((l * V) <= -1e-266) {
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt(A) / sqrt((l * V))) * c0;
	} else {
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	}
	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 ((l * V) <= -Double.POSITIVE_INFINITY) {
		tmp = Math.sqrt(((A / V) / l)) * c0;
	} else if ((l * V) <= -1e-266) {
		tmp = (Math.sqrt(-A) / Math.sqrt((-V * l))) * c0;
	} else if ((l * V) <= 0.0) {
		tmp = c0 / Math.sqrt((l / (A / V)));
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
	} else {
		tmp = Math.sqrt(((1.0 / V) * (A / l))) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -math.inf:
		tmp = math.sqrt(((A / V) / l)) * c0
	elif (l * V) <= -1e-266:
		tmp = (math.sqrt(-A) / math.sqrt((-V * l))) * c0
	elif (l * V) <= 0.0:
		tmp = c0 / math.sqrt((l / (A / V)))
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0
	else:
		tmp = math.sqrt(((1.0 / V) * (A / l))) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= Float64(-Inf))
		tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0);
	elseif (Float64(l * V) <= -1e-266)
		tmp = Float64(Float64(sqrt(Float64(-A)) / sqrt(Float64(Float64(-V) * l))) * c0);
	elseif (Float64(l * V) <= 0.0)
		tmp = Float64(c0 / sqrt(Float64(l / Float64(A / V))));
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(1.0 / V) * Float64(A / l))) * c0);
	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 ((l * V) <= -Inf)
		tmp = sqrt(((A / V) / l)) * c0;
	elseif ((l * V) <= -1e-266)
		tmp = (sqrt(-A) / sqrt((-V * l))) * c0;
	elseif ((l * V) <= 0.0)
		tmp = c0 / sqrt((l / (A / V)));
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt(A) / sqrt((l * V))) * c0;
	else
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	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[(l * V), $MachinePrecision], (-Infinity)], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], -1e-266], N[(N[(N[Sqrt[(-A)], $MachinePrecision] / N[Sqrt[N[((-V) * l), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[Sqrt[N[(l / N[(A / V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

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

   1. Initial program 14.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 70.0

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

   4. Applied rewrites 70.0%

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

   if -inf.0 < (*.f64 V l) < -9.9999999999999998e-267

   1. Initial program 82.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 73.1

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

   4. Applied rewrites 73.1%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. associate-/l/ N/A

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

      6. sqrt-div N/A

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

      7. lower-/.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 99.5

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

   6. Applied rewrites 99.5%

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

   if -9.9999999999999998e-267 < (*.f64 V l) < -0.0

   1. Initial program 51.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 51.0

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 51.0

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

   4. Applied rewrites 51.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 74.1

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

   6. Applied rewrites 74.1%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. sqrt-div N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 99.2

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 99.2

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

   4. Applied rewrites 99.2%

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

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. div-inv N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 82.8

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

   4. Applied rewrites 82.8%

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

4. Final simplification 93.4%

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

Alternative 8: 84.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\ \mathbf{if}\;\ell \cdot V \leq -5 \cdot 10^{+153}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-156}:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{1}{A} \cdot \left(\ell \cdot V\right)}}\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \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 (* (sqrt (/ (/ A l) V)) c0)))
   (if (<= (* l V) -5e+153)
     t_0
     (if (<= (* l V) -2e-156)
       (/ c0 (sqrt (* (/ 1.0 A) (* l V))))
       (if (<= (* l V) 0.0)
         t_0
         (if (<= (* l V) 2e+269)
           (* (/ (sqrt A) (sqrt (* l V))) c0)
           (* (sqrt (* (/ 1.0 V) (/ A l))) c0)))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double t_0 = sqrt(((A / l) / V)) * c0;
	double tmp;
	if ((l * V) <= -5e+153) {
		tmp = t_0;
	} else if ((l * V) <= -2e-156) {
		tmp = c0 / sqrt(((1.0 / A) * (l * V)));
	} else if ((l * V) <= 0.0) {
		tmp = t_0;
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt(A) / sqrt((l * V))) * c0;
	} else {
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	}
	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 = sqrt(((a / l) / v)) * c0
    if ((l * v) <= (-5d+153)) then
        tmp = t_0
    else if ((l * v) <= (-2d-156)) then
        tmp = c0 / sqrt(((1.0d0 / a) * (l * v)))
    else if ((l * v) <= 0.0d0) then
        tmp = t_0
    else if ((l * v) <= 2d+269) then
        tmp = (sqrt(a) / sqrt((l * v))) * c0
    else
        tmp = sqrt(((1.0d0 / v) * (a / l))) * c0
    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 = Math.sqrt(((A / l) / V)) * c0;
	double tmp;
	if ((l * V) <= -5e+153) {
		tmp = t_0;
	} else if ((l * V) <= -2e-156) {
		tmp = c0 / Math.sqrt(((1.0 / A) * (l * V)));
	} else if ((l * V) <= 0.0) {
		tmp = t_0;
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
	} else {
		tmp = Math.sqrt(((1.0 / V) * (A / l))) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	t_0 = math.sqrt(((A / l) / V)) * c0
	tmp = 0
	if (l * V) <= -5e+153:
		tmp = t_0
	elif (l * V) <= -2e-156:
		tmp = c0 / math.sqrt(((1.0 / A) * (l * V)))
	elif (l * V) <= 0.0:
		tmp = t_0
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0
	else:
		tmp = math.sqrt(((1.0 / V) * (A / l))) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	t_0 = Float64(sqrt(Float64(Float64(A / l) / V)) * c0)
	tmp = 0.0
	if (Float64(l * V) <= -5e+153)
		tmp = t_0;
	elseif (Float64(l * V) <= -2e-156)
		tmp = Float64(c0 / sqrt(Float64(Float64(1.0 / A) * Float64(l * V))));
	elseif (Float64(l * V) <= 0.0)
		tmp = t_0;
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(1.0 / V) * Float64(A / l))) * c0);
	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 = sqrt(((A / l) / V)) * c0;
	tmp = 0.0;
	if ((l * V) <= -5e+153)
		tmp = t_0;
	elseif ((l * V) <= -2e-156)
		tmp = c0 / sqrt(((1.0 / A) * (l * V)));
	elseif ((l * V) <= 0.0)
		tmp = t_0;
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt(A) / sqrt((l * V))) * c0;
	else
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	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[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], -5e+153], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -2e-156], N[(c0 / N[Sqrt[N[(N[(1.0 / A), $MachinePrecision] * N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 V l) < -5.00000000000000018e153 or -2.00000000000000008e-156 < (*.f64 V l) < -0.0

   1. Initial program 52.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 69.0

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

   4. Applied rewrites 69.0%

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

   if -5.00000000000000018e153 < (*.f64 V l) < -2.00000000000000008e-156

   1. Initial program 89.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 91.7

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 91.7

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

   4. Applied rewrites 91.7%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 91.7

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 91.7

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

   6. Applied rewrites 91.7%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. sqrt-div N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 99.2

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 99.2

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

   4. Applied rewrites 99.2%

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

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. div-inv N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 82.8

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

   4. Applied rewrites 82.8%

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

4. Final simplification 87.3%

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

Alternative 9: 84.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\ \mathbf{if}\;\ell \cdot V \leq -5 \cdot 10^{+153}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-156}:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{\ell \cdot V}{A}}}\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \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 (* (sqrt (/ (/ A l) V)) c0)))
   (if (<= (* l V) -5e+153)
     t_0
     (if (<= (* l V) -2e-156)
       (/ c0 (sqrt (/ (* l V) A)))
       (if (<= (* l V) 0.0)
         t_0
         (if (<= (* l V) 2e+269)
           (* (/ (sqrt A) (sqrt (* l V))) c0)
           (* (sqrt (* (/ 1.0 V) (/ A l))) c0)))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double t_0 = sqrt(((A / l) / V)) * c0;
	double tmp;
	if ((l * V) <= -5e+153) {
		tmp = t_0;
	} else if ((l * V) <= -2e-156) {
		tmp = c0 / sqrt(((l * V) / A));
	} else if ((l * V) <= 0.0) {
		tmp = t_0;
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt(A) / sqrt((l * V))) * c0;
	} else {
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	}
	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 = sqrt(((a / l) / v)) * c0
    if ((l * v) <= (-5d+153)) then
        tmp = t_0
    else if ((l * v) <= (-2d-156)) then
        tmp = c0 / sqrt(((l * v) / a))
    else if ((l * v) <= 0.0d0) then
        tmp = t_0
    else if ((l * v) <= 2d+269) then
        tmp = (sqrt(a) / sqrt((l * v))) * c0
    else
        tmp = sqrt(((1.0d0 / v) * (a / l))) * c0
    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 = Math.sqrt(((A / l) / V)) * c0;
	double tmp;
	if ((l * V) <= -5e+153) {
		tmp = t_0;
	} else if ((l * V) <= -2e-156) {
		tmp = c0 / Math.sqrt(((l * V) / A));
	} else if ((l * V) <= 0.0) {
		tmp = t_0;
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
	} else {
		tmp = Math.sqrt(((1.0 / V) * (A / l))) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	t_0 = math.sqrt(((A / l) / V)) * c0
	tmp = 0
	if (l * V) <= -5e+153:
		tmp = t_0
	elif (l * V) <= -2e-156:
		tmp = c0 / math.sqrt(((l * V) / A))
	elif (l * V) <= 0.0:
		tmp = t_0
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0
	else:
		tmp = math.sqrt(((1.0 / V) * (A / l))) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	t_0 = Float64(sqrt(Float64(Float64(A / l) / V)) * c0)
	tmp = 0.0
	if (Float64(l * V) <= -5e+153)
		tmp = t_0;
	elseif (Float64(l * V) <= -2e-156)
		tmp = Float64(c0 / sqrt(Float64(Float64(l * V) / A)));
	elseif (Float64(l * V) <= 0.0)
		tmp = t_0;
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(1.0 / V) * Float64(A / l))) * c0);
	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 = sqrt(((A / l) / V)) * c0;
	tmp = 0.0;
	if ((l * V) <= -5e+153)
		tmp = t_0;
	elseif ((l * V) <= -2e-156)
		tmp = c0 / sqrt(((l * V) / A));
	elseif ((l * V) <= 0.0)
		tmp = t_0;
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt(A) / sqrt((l * V))) * c0;
	else
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	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[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], -5e+153], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -2e-156], N[(c0 / N[Sqrt[N[(N[(l * V), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 V l) < -5.00000000000000018e153 or -2.00000000000000008e-156 < (*.f64 V l) < -0.0

   1. Initial program 52.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 69.0

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

   4. Applied rewrites 69.0%

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

   if -5.00000000000000018e153 < (*.f64 V l) < -2.00000000000000008e-156

   1. Initial program 89.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 91.7

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 91.7

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

   4. Applied rewrites 91.7%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. sqrt-div N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 99.2

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 99.2

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

   4. Applied rewrites 99.2%

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

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. div-inv N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 82.8

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

   4. Applied rewrites 82.8%

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

4. Final simplification 87.2%

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

Alternative 10: 84.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{\frac{A}{\ell}}{V}} \cdot c0\\ \mathbf{if}\;\ell \cdot V \leq -5 \cdot 10^{+153}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\ell \cdot V \leq -2 \cdot 10^{-156}:\\ \;\;\;\;\frac{c0}{\sqrt{\frac{\ell \cdot V}{A}}}\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\frac{\sqrt{A}}{\sqrt{\ell \cdot V}} \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\ \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 (* (sqrt (/ (/ A l) V)) c0)))
   (if (<= (* l V) -5e+153)
     t_0
     (if (<= (* l V) -2e-156)
       (/ c0 (sqrt (/ (* l V) A)))
       (if (<= (* l V) 0.0)
         t_0
         (if (<= (* l V) 2e+269)
           (* (/ (sqrt A) (sqrt (* l V))) c0)
           (* (sqrt (/ (/ A V) l)) c0)))))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double t_0 = sqrt(((A / l) / V)) * c0;
	double tmp;
	if ((l * V) <= -5e+153) {
		tmp = t_0;
	} else if ((l * V) <= -2e-156) {
		tmp = c0 / sqrt(((l * V) / A));
	} else if ((l * V) <= 0.0) {
		tmp = t_0;
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt(A) / sqrt((l * V))) * c0;
	} else {
		tmp = sqrt(((A / V) / l)) * c0;
	}
	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 = sqrt(((a / l) / v)) * c0
    if ((l * v) <= (-5d+153)) then
        tmp = t_0
    else if ((l * v) <= (-2d-156)) then
        tmp = c0 / sqrt(((l * v) / a))
    else if ((l * v) <= 0.0d0) then
        tmp = t_0
    else if ((l * v) <= 2d+269) then
        tmp = (sqrt(a) / sqrt((l * v))) * c0
    else
        tmp = sqrt(((a / v) / l)) * c0
    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 = Math.sqrt(((A / l) / V)) * c0;
	double tmp;
	if ((l * V) <= -5e+153) {
		tmp = t_0;
	} else if ((l * V) <= -2e-156) {
		tmp = c0 / Math.sqrt(((l * V) / A));
	} else if ((l * V) <= 0.0) {
		tmp = t_0;
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt(A) / Math.sqrt((l * V))) * c0;
	} else {
		tmp = Math.sqrt(((A / V) / l)) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	t_0 = math.sqrt(((A / l) / V)) * c0
	tmp = 0
	if (l * V) <= -5e+153:
		tmp = t_0
	elif (l * V) <= -2e-156:
		tmp = c0 / math.sqrt(((l * V) / A))
	elif (l * V) <= 0.0:
		tmp = t_0
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt(A) / math.sqrt((l * V))) * c0
	else:
		tmp = math.sqrt(((A / V) / l)) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	t_0 = Float64(sqrt(Float64(Float64(A / l) / V)) * c0)
	tmp = 0.0
	if (Float64(l * V) <= -5e+153)
		tmp = t_0;
	elseif (Float64(l * V) <= -2e-156)
		tmp = Float64(c0 / sqrt(Float64(Float64(l * V) / A)));
	elseif (Float64(l * V) <= 0.0)
		tmp = t_0;
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(A) / sqrt(Float64(l * V))) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(A / V) / l)) * c0);
	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 = sqrt(((A / l) / V)) * c0;
	tmp = 0.0;
	if ((l * V) <= -5e+153)
		tmp = t_0;
	elseif ((l * V) <= -2e-156)
		tmp = c0 / sqrt(((l * V) / A));
	elseif ((l * V) <= 0.0)
		tmp = t_0;
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt(A) / sqrt((l * V))) * c0;
	else
		tmp = sqrt(((A / V) / l)) * c0;
	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[(N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[N[(l * V), $MachinePrecision], -5e+153], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], -2e-156], N[(c0 / N[Sqrt[N[(N[(l * V), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], t$95$0, If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[A], $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 V l) < -5.00000000000000018e153 or -2.00000000000000008e-156 < (*.f64 V l) < -0.0

   1. Initial program 52.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 69.0

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

   4. Applied rewrites 69.0%

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

   if -5.00000000000000018e153 < (*.f64 V l) < -2.00000000000000008e-156

   1. Initial program 89.0%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 91.7

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 91.7

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

   4. Applied rewrites 91.7%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. sqrt-div N/A

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

      4. lower-/.f64 N/A

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

      5. lower-sqrt.f64 N/A

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

      6. lower-sqrt.f64 99.2

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 99.2

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

   4. Applied rewrites 99.2%

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

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 82.7

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

   4. Applied rewrites 82.7%

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

4. Final simplification 87.2%

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

Alternative 11: 80.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} t_0 := \frac{A}{\ell \cdot V}\\ t_1 := \sqrt{\frac{\frac{A}{V}}{\ell}} \cdot c0\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+298}:\\ \;\;\;\;\sqrt{t\_0} \cdot c0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \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 (* l V))) (t_1 (* (sqrt (/ (/ A V) l)) c0)))
   (if (<= t_0 0.0) t_1 (if (<= t_0 2e+298) (* (sqrt t_0) c0) t_1))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double t_0 = A / (l * V);
	double t_1 = sqrt(((A / V) / l)) * c0;
	double tmp;
	if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 2e+298) {
		tmp = sqrt(t_0) * c0;
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_0 = a / (l * v)
    t_1 = sqrt(((a / v) / l)) * c0
    if (t_0 <= 0.0d0) then
        tmp = t_1
    else if (t_0 <= 2d+298) then
        tmp = sqrt(t_0) * c0
    else
        tmp = t_1
    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 / (l * V);
	double t_1 = Math.sqrt(((A / V) / l)) * c0;
	double tmp;
	if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 2e+298) {
		tmp = Math.sqrt(t_0) * c0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	t_0 = Float64(A / Float64(l * V))
	t_1 = Float64(sqrt(Float64(Float64(A / V) / l)) * c0)
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 2e+298)
		tmp = Float64(sqrt(t_0) * c0);
	else
		tmp = t_1;
	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 / (l * V);
	t_1 = sqrt(((A / V) / l)) * c0;
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 2e+298)
		tmp = sqrt(t_0) * c0;
	else
		tmp = t_1;
	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[(l * V), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[(N[(A / V), $MachinePrecision] / l), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], t$95$1, If[LessEqual[t$95$0, 2e+298], N[(N[Sqrt[t$95$0], $MachinePrecision] * c0), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 34.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 52.5

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

   4. Applied rewrites 52.5%

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

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

   1. Initial program 98.4%

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

4. Final simplification 81.0%

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

Alternative 12: 90.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{-315}:\\ \;\;\;\;\left(\sqrt{-A} \cdot \sqrt{\frac{-1}{V}}\right) \cdot \frac{c0}{\sqrt{\ell}}\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;\frac{c0}{\sqrt{-V} \cdot \sqrt{\frac{-\ell}{A}}}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\left(\sqrt{A} \cdot \frac{1}{\sqrt{\ell \cdot V}}\right) \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \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 (<= (* l V) -2e-315)
   (* (* (sqrt (- A)) (sqrt (/ -1.0 V))) (/ c0 (sqrt l)))
   (if (<= (* l V) 0.0)
     (/ c0 (* (sqrt (- V)) (sqrt (/ (- l) A))))
     (if (<= (* l V) 2e+269)
       (* (* (sqrt A) (/ 1.0 (sqrt (* l V)))) c0)
       (* (sqrt (* (/ 1.0 V) (/ A l))) c0)))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if ((l * V) <= -2e-315) {
		tmp = (sqrt(-A) * sqrt((-1.0 / V))) * (c0 / sqrt(l));
	} else if ((l * V) <= 0.0) {
		tmp = c0 / (sqrt(-V) * sqrt((-l / A)));
	} else if ((l * V) <= 2e+269) {
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	} else {
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	}
	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 ((l * v) <= (-2d-315)) then
        tmp = (sqrt(-a) * sqrt(((-1.0d0) / v))) * (c0 / sqrt(l))
    else if ((l * v) <= 0.0d0) then
        tmp = c0 / (sqrt(-v) * sqrt((-l / a)))
    else if ((l * v) <= 2d+269) then
        tmp = (sqrt(a) * (1.0d0 / sqrt((l * v)))) * c0
    else
        tmp = sqrt(((1.0d0 / v) * (a / l))) * c0
    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 ((l * V) <= -2e-315) {
		tmp = (Math.sqrt(-A) * Math.sqrt((-1.0 / V))) * (c0 / Math.sqrt(l));
	} else if ((l * V) <= 0.0) {
		tmp = c0 / (Math.sqrt(-V) * Math.sqrt((-l / A)));
	} else if ((l * V) <= 2e+269) {
		tmp = (Math.sqrt(A) * (1.0 / Math.sqrt((l * V)))) * c0;
	} else {
		tmp = Math.sqrt(((1.0 / V) * (A / l))) * c0;
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if (l * V) <= -2e-315:
		tmp = (math.sqrt(-A) * math.sqrt((-1.0 / V))) * (c0 / math.sqrt(l))
	elif (l * V) <= 0.0:
		tmp = c0 / (math.sqrt(-V) * math.sqrt((-l / A)))
	elif (l * V) <= 2e+269:
		tmp = (math.sqrt(A) * (1.0 / math.sqrt((l * V)))) * c0
	else:
		tmp = math.sqrt(((1.0 / V) * (A / l))) * c0
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (Float64(l * V) <= -2e-315)
		tmp = Float64(Float64(sqrt(Float64(-A)) * sqrt(Float64(-1.0 / V))) * Float64(c0 / sqrt(l)));
	elseif (Float64(l * V) <= 0.0)
		tmp = Float64(c0 / Float64(sqrt(Float64(-V)) * sqrt(Float64(Float64(-l) / A))));
	elseif (Float64(l * V) <= 2e+269)
		tmp = Float64(Float64(sqrt(A) * Float64(1.0 / sqrt(Float64(l * V)))) * c0);
	else
		tmp = Float64(sqrt(Float64(Float64(1.0 / V) * Float64(A / l))) * c0);
	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 ((l * V) <= -2e-315)
		tmp = (sqrt(-A) * sqrt((-1.0 / V))) * (c0 / sqrt(l));
	elseif ((l * V) <= 0.0)
		tmp = c0 / (sqrt(-V) * sqrt((-l / A)));
	elseif ((l * V) <= 2e+269)
		tmp = (sqrt(A) * (1.0 / sqrt((l * V)))) * c0;
	else
		tmp = sqrt(((1.0 / V) * (A / l))) * c0;
	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[(l * V), $MachinePrecision], -2e-315], N[(N[(N[Sqrt[(-A)], $MachinePrecision] * N[Sqrt[N[(-1.0 / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(c0 / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 0.0], N[(c0 / N[(N[Sqrt[(-V)], $MachinePrecision] * N[Sqrt[N[((-l) / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(l * V), $MachinePrecision], 2e+269], N[(N[(N[Sqrt[A], $MachinePrecision] * N[(1.0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * c0), $MachinePrecision], N[(N[Sqrt[N[(N[(1.0 / V), $MachinePrecision] * N[(A / l), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 V l) < -2.0000000019e-315

   1. Initial program 76.1%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/r* N/A

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

      6. sqrt-div N/A

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

      7. associate-*r/ N/A

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

      8. associate-*l/ N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-sqrt.f64 N/A

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

      13. lower-/.f64 39.0

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

   4. Applied rewrites 39.0%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. frac-2neg N/A

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

      5. associate-/r/ N/A

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

      6. sqrt-prod N/A

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

      7. lower-*.f64 N/A

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

      8. lower-sqrt.f64 N/A

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

      9. distribute-frac-neg2 N/A

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

      10. distribute-neg-frac N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. lower-sqrt.f64 N/A

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

      14. lower-neg.f64 40.8

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

   6. Applied rewrites 40.8%

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

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

   1. Initial program 41.5%

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

      1. lift-*.f64 N/A

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

      2. lift-sqrt.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. sqrt-div N/A

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

      6. metadata-eval N/A

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

      7. un-div-inv N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lower-/.f64 41.5

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 41.5

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

   4. Applied rewrites 41.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 68.4

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

   6. Applied rewrites 68.4%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. associate-/r/ N/A

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

      6. sqrt-prod N/A

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

      7. pow1/2 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. distribute-frac-neg2 N/A

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

      11. distribute-neg-frac N/A

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

      12. lower-/.f64 N/A

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

      13. lower-neg.f64 N/A

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

      14. pow1/2 N/A

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

      15. lower-sqrt.f64 N/A

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

      16. lower-neg.f64 51.4

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

   8. Applied rewrites 51.4%

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

   if -0.0 < (*.f64 V l) < 2.0000000000000001e269

   1. Initial program 83.8%

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

      1. lift-sqrt.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. associate-/r/ N/A

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

      5. sqrt-prod N/A

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

      6. pow1/2 N/A

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

      7. lower-*.f64 N/A

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

      8. pow1/2 N/A

         \[\leadsto c0 \cdot \left(\color{blue}{\sqrt{\frac{1}{V \cdot \ell}}} \cdot \sqrt{A}\right) \]

      9. sqrt-div N/A

         \[\leadsto c0 \cdot \left(\color{blue}{\frac{\sqrt{1}}{\sqrt{V \cdot \ell}}} \cdot \sqrt{A}\right) \]

      10. metadata-eval N/A

          \[\leadsto c0 \cdot \left(\frac{\color{blue}{1}}{\sqrt{V \cdot \ell}} \cdot \sqrt{A}\right) \]

      11. lower-/.f64 N/A

          \[\leadsto c0 \cdot \left(\color{blue}{\frac{1}{\sqrt{V \cdot \ell}}} \cdot \sqrt{A}\right) \]

      12. lower-sqrt.f64 N/A

          \[\leadsto c0 \cdot \left(\frac{1}{\color{blue}{\sqrt{V \cdot \ell}}} \cdot \sqrt{A}\right) \]

      13. lift-*.f64 N/A

          \[\leadsto c0 \cdot \left(\frac{1}{\sqrt{\color{blue}{V \cdot \ell}}} \cdot \sqrt{A}\right) \]

      14. *-commutative N/A

          \[\leadsto c0 \cdot \left(\frac{1}{\sqrt{\color{blue}{\ell \cdot V}}} \cdot \sqrt{A}\right) \]

      15. lower-*.f64 N/A

          \[\leadsto c0 \cdot \left(\frac{1}{\sqrt{\color{blue}{\ell \cdot V}}} \cdot \sqrt{A}\right) \]

      16. lower-sqrt.f64 99.3

          \[\leadsto c0 \cdot \left(\frac{1}{\sqrt{\ell \cdot V}} \cdot \color{blue}{\sqrt{A}}\right) \]

   4. Applied rewrites 99.3%

      \[\leadsto c0 \cdot \color{blue}{\left(\frac{1}{\sqrt{\ell \cdot V}} \cdot \sqrt{A}\right)} \]

   if 2.0000000000000001e269 < (*.f64 V l)

   1. Initial program 61.2%

      \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{A}{V \cdot \ell}}} \]

      2. lift-*.f64 N/A

         \[\leadsto c0 \cdot \sqrt{\frac{A}{\color{blue}{V \cdot \ell}}} \]

      3. associate-/l/ N/A

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{\frac{A}{\ell}}{V}}} \]

      4. div-inv N/A

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{A}{\ell} \cdot \frac{1}{V}}} \]

      5. lower-*.f64 N/A

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{A}{\ell} \cdot \frac{1}{V}}} \]

      6. lower-/.f64 N/A

         \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{A}{\ell}} \cdot \frac{1}{V}} \]

      7. lower-/.f64 82.8

         \[\leadsto c0 \cdot \sqrt{\frac{A}{\ell} \cdot \color{blue}{\frac{1}{V}}} \]

   4. Applied rewrites 82.8%

      \[\leadsto c0 \cdot \sqrt{\color{blue}{\frac{A}{\ell} \cdot \frac{1}{V}}} \]
3. Recombined 4 regimes into one program.

4. Final simplification 67.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\ell \cdot V \leq -2 \cdot 10^{-315}:\\ \;\;\;\;\left(\sqrt{-A} \cdot \sqrt{\frac{-1}{V}}\right) \cdot \frac{c0}{\sqrt{\ell}}\\ \mathbf{elif}\;\ell \cdot V \leq 0:\\ \;\;\;\;\frac{c0}{\sqrt{-V} \cdot \sqrt{\frac{-\ell}{A}}}\\ \mathbf{elif}\;\ell \cdot V \leq 2 \cdot 10^{+269}:\\ \;\;\;\;\left(\sqrt{A} \cdot \frac{1}{\sqrt{\ell \cdot V}}\right) \cdot c0\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\frac{1}{V} \cdot \frac{A}{\ell}} \cdot c0\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 73.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \sqrt{\frac{A}{\ell \cdot V}} \cdot c0 \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 (* (sqrt (/ A (* l V))) c0))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	return sqrt((A / (l * V))) * c0;
}

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 = sqrt((a / (l * v))) * c0
end function

Java

assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
	return Math.sqrt((A / (l * V))) * c0;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	return math.sqrt((A / (l * V))) * c0

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	return Float64(sqrt(Float64(A / Float64(l * V))) * c0)
end

MATLAB

c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp = code(c0, A, V, l)
	tmp = sqrt((A / (l * V))) * c0;
end

Wolfram

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := N[(N[Sqrt[N[(A / N[(l * V), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c0), $MachinePrecision]

Derivation

1. Initial program 74.1%

   \[c0 \cdot \sqrt{\frac{A}{V \cdot \ell}} \]
2. Add Preprocessing

3. Final simplification 74.1%

   \[\leadsto \sqrt{\frac{A}{\ell \cdot V}} \cdot c0 \]
4. Add Preprocessing

Reproduce

herbie shell --seed 2024237 
(FPCore (c0 A V l)
  :name "Henrywood and Agarwal, Equation (3)"
  :precision binary64
  (* c0 (sqrt (/ A (* V l)))))