Henrywood and Agarwal, Equation (3)

Percentage Accurate: 73.9% → 90.9%

Time: 5.9s

Alternatives: 11

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    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.1× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} t_0 := {\left(-A\right)}^{0.25}\\ \mathbf{if}\;A \leq -1 \cdot 10^{-309}:\\ \;\;\;\;c0 \cdot \left(\frac{t\_0}{\sqrt{-V}} \cdot \frac{t\_0}{\sqrt{\ell}}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c0}{\frac{\sqrt{V \cdot \ell}}{\sqrt{A}}}\\ \end{array} \end{array} \]

FPCore

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

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double t_0 = pow(-A, 0.25);
	double tmp;
	if (A <= -1e-309) {
		tmp = c0 * ((t_0 / sqrt(-V)) * (t_0 / sqrt(l)));
	} else {
		tmp = c0 / (sqrt((V * l)) / sqrt(A));
	}
	return tmp;
}

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: t_0
    real(8) :: tmp
    t_0 = -a ** 0.25d0
    if (a <= (-1d-309)) then
        tmp = c0 * ((t_0 / sqrt(-v)) * (t_0 / sqrt(l)))
    else
        tmp = c0 / (sqrt((v * l)) / sqrt(a))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	t_0 = Float64(-A) ^ 0.25
	tmp = 0.0
	if (A <= -1e-309)
		tmp = Float64(c0 * Float64(Float64(t_0 / sqrt(Float64(-V))) * Float64(t_0 / sqrt(l))));
	else
		tmp = Float64(c0 / Float64(sqrt(Float64(V * l)) / sqrt(A)));
	end
	return tmp
end

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if A < -1.000000000000002e-309

   1. Initial program 75.9%

      \[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. frac-2neg N/A

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

      4. sqrt-div N/A

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

      5. pow1/2 N/A

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

      6. sqr-pow N/A

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

      7. lift-*.f64 N/A

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

      8. distribute-lft-neg-in N/A

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

      9. sqrt-prod N/A

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

      10. pow1/2 N/A

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

      11. times-frac N/A

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

      12. lower-*.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. lower-pow.f64 N/A

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

      15. lower-neg.f64 N/A

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

      16. metadata-eval N/A

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

      17. pow1/2 N/A

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

      18. lower-sqrt.f64 N/A

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

      19. lower-neg.f64 N/A

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

      20. lower-/.f64 N/A

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

   4. Applied rewrites 56.6%

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

   if -1.000000000000002e-309 < A

   1. Initial program 74.7%

      \[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. pow1/2 N/A

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

      4. pow-to-exp N/A

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

      5. sinh-+-cosh-rev N/A

         \[\leadsto c0 \cdot \color{blue}{\left(\cosh \left(\log \left(\frac{A}{V \cdot \ell}\right) \cdot \frac{1}{2}\right) + \sinh \left(\log \left(\frac{A}{V \cdot \ell}\right) \cdot \frac{1}{2}\right)\right)} \]

      6. flip-+ N/A

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

      7. sinh-cosh N/A

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

      8. sinh---cosh-rev N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. exp-neg N/A

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

      13. pow-to-exp N/A

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

      14. pow1/2 N/A

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

      15. lift-sqrt.f64 N/A

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

   4. Applied rewrites 74.6%

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

      1. lift-pow.f64 N/A

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

      2. unpow-1 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. sqrt-div N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-sqrt.f64 N/A

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

      8. associate-/r/ N/A

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

      9. associate-*l/ N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 82.6

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 82.6

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

   6. Applied rewrites 82.6%

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

4. Final simplification 69.6%

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

Alternative 2: 87.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    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 <= (-2d-311)) then
        tmp = ((a ** 0.25d0) / sqrt(-l)) * (((a ** 0.25d0) * c0) / sqrt(-v))
    else
        tmp = c0 * (sqrt((a / v)) / sqrt(l))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < -1.9999999999999e-311

   1. Initial program 74.9%

      \[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. sqrt-div N/A

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

      5. associate-*r/ N/A

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

      6. *-commutative N/A

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

      7. pow1/2 N/A

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

      8. sqr-pow N/A

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

      9. associate-*l* N/A

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

      10. pow1/2 N/A

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

      11. remove-double-neg N/A

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. distribute-rgt-neg-in N/A

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

      15. distribute-lft-neg-in N/A

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

      16. unpow-prod-down N/A

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

      17. times-frac N/A

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

      18. *-commutative N/A

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

      19. lower-*.f64 N/A

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

   4. Applied rewrites 56.2%

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

   if -1.9999999999999e-311 < l

   1. Initial program 75.6%

      \[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. lift-*.f64 N/A

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

      4. associate-/r* N/A

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

      5. sqrt-div N/A

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

      6. lower-/.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 83.5

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

   4. Applied rewrites 83.5%

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

Alternative 3: 87.3% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    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 <= (-2d-311)) then
        tmp = ((a ** 0.25d0) / sqrt(-v)) * (((a ** 0.25d0) * c0) / sqrt(-l))
    else
        tmp = c0 * (sqrt((a / v)) / sqrt(l))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < -1.9999999999999e-311

   1. Initial program 74.9%

      \[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. sqrt-div N/A

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

      5. associate-*r/ N/A

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

      6. *-commutative N/A

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

      7. pow1/2 N/A

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

      8. sqr-pow N/A

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

      9. associate-*l* N/A

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

      10. pow1/2 N/A

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

      11. remove-double-neg N/A

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

      12. lift-*.f64 N/A

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

      13. distribute-rgt-neg-in N/A

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

      14. distribute-lft-neg-in N/A

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

      15. unpow-prod-down N/A

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

      16. times-frac N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 N/A

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

   4. Applied rewrites 54.4%

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

   if -1.9999999999999e-311 < l

   1. Initial program 75.6%

      \[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. lift-*.f64 N/A

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

      4. associate-/r* N/A

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

      5. sqrt-div N/A

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

      6. lower-/.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 83.5

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

   4. Applied rewrites 83.5%

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

Alternative 4: 77.1% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    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 / (v * l)))
    if (t_0 <= 5d-149) then
        tmp = c0 * sqrt(((a / l) / v))
    else
        tmp = c0 * t_0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (sqrt.f64 (/.f64 A (*.f64 V l))) < 4.99999999999999968e-149

   1. Initial program 31.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. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 52.1

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

   4. Applied rewrites 52.1%

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

   if 4.99999999999999968e-149 < (sqrt.f64 (/.f64 A (*.f64 V l)))

   1. Initial program 87.2%

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

Alternative 5: 77.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    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 / (v * l)))
    if (t_0 <= 0.0d0) then
        tmp = c0 * sqrt(((a / v) / l))
    else
        tmp = c0 * t_0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 28.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-/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 50.6

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

   4. Applied rewrites 50.6%

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

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

   1. Initial program 86.7%

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

Alternative 6: 86.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    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 <= (-2d-311)) then
        tmp = ((c0 / sqrt(-l)) * sqrt(a)) / sqrt(-v)
    else
        tmp = c0 * (sqrt((a / v)) / sqrt(l))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if l < -1.9999999999999e-311

   1. Initial program 74.9%

      \[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. frac-2neg N/A

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

      7. sqrt-div N/A

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

      8. pow1/2 N/A

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

      9. associate-*r/ N/A

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

      10. associate-*l/ N/A

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

      11. distribute-neg-frac2 N/A

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

      12. sqrt-div N/A

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

      13. pow1/2 N/A

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

      14. associate-*r/ N/A

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

      15. lower-/.f64 N/A

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

   4. Applied rewrites 51.8%

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

   if -1.9999999999999e-311 < l

   1. Initial program 75.6%

      \[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. lift-*.f64 N/A

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

      4. associate-/r* N/A

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

      5. sqrt-div N/A

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

      6. lower-/.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 83.5

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

   4. Applied rewrites 83.5%

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

Alternative 7: 81.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq 10^{-302} \lor \neg \left(V \cdot \ell \leq 5 \cdot 10^{+288}\right):\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sqrt{A} \cdot c0}{\sqrt{\ell \cdot V}}\\ \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 (or (<= (* V l) 1e-302) (not (<= (* V l) 5e+288)))
   (* c0 (sqrt (/ (/ A l) V)))
   (/ (* (sqrt A) c0) (sqrt (* l V)))))

C

assert(c0 < A && A < V && V < l);
double code(double c0, double A, double V, double l) {
	double tmp;
	if (((V * l) <= 1e-302) || !((V * l) <= 5e+288)) {
		tmp = c0 * sqrt(((A / l) / V));
	} else {
		tmp = (sqrt(A) * c0) / sqrt((l * V));
	}
	return tmp;
}

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if (((v * l) <= 1d-302) .or. (.not. ((v * l) <= 5d+288))) then
        tmp = c0 * sqrt(((a / l) / v))
    else
        tmp = (sqrt(a) * c0) / sqrt((l * v))
    end if
    code = tmp
end function

Java

assert c0 < A && A < V && V < l;
public static double code(double c0, double A, double V, double l) {
	double tmp;
	if (((V * l) <= 1e-302) || !((V * l) <= 5e+288)) {
		tmp = c0 * Math.sqrt(((A / l) / V));
	} else {
		tmp = (Math.sqrt(A) * c0) / Math.sqrt((l * V));
	}
	return tmp;
}

Python

[c0, A, V, l] = sort([c0, A, V, l])
def code(c0, A, V, l):
	tmp = 0
	if ((V * l) <= 1e-302) or not ((V * l) <= 5e+288):
		tmp = c0 * math.sqrt(((A / l) / V))
	else:
		tmp = (math.sqrt(A) * c0) / math.sqrt((l * V))
	return tmp

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if ((Float64(V * l) <= 1e-302) || !(Float64(V * l) <= 5e+288))
		tmp = Float64(c0 * sqrt(Float64(Float64(A / l) / V)));
	else
		tmp = Float64(Float64(sqrt(A) * c0) / sqrt(Float64(l * V)));
	end
	return tmp
end

MATLAB

c0, A, V, l = num2cell(sort([c0, A, V, l])){:}
function tmp_2 = code(c0, A, V, l)
	tmp = 0.0;
	if (((V * l) <= 1e-302) || ~(((V * l) <= 5e+288)))
		tmp = c0 * sqrt(((A / l) / V));
	else
		tmp = (sqrt(A) * c0) / sqrt((l * V));
	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[Or[LessEqual[N[(V * l), $MachinePrecision], 1e-302], N[Not[LessEqual[N[(V * l), $MachinePrecision], 5e+288]], $MachinePrecision]], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 V l) < 9.9999999999999996e-303 or 5.0000000000000003e288 < (*.f64 V l)

   1. Initial program 68.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. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 71.7

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

   4. Applied rewrites 71.7%

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

   if 9.9999999999999996e-303 < (*.f64 V l) < 5.0000000000000003e288

   1. Initial program 88.3%

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

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

      3. lift-sqrt.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. sqrt-div N/A

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

      6. associate-*l/ N/A

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

      7. frac-2neg N/A

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

      8. frac-2neg N/A

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

      9. remove-double-neg N/A

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

      10. lower-/.f64 N/A

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

      11. distribute-lft-neg-in N/A

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

      12. distribute-lft-neg-in N/A

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

      13. remove-double-neg N/A

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

      14. lower-*.f64 N/A

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

      15. lower-sqrt.f64 N/A

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

      16. lower-sqrt.f64 98.4

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

      17. lift-*.f64 N/A

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

      18. *-commutative N/A

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

      19. lower-*.f64 98.4

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

   4. Applied rewrites 98.4%

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

4. Final simplification 81.1%

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

Alternative 8: 80.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;V \cdot \ell \leq 0 \lor \neg \left(V \cdot \ell \leq 5 \cdot 10^{+288}\right):\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A}{\ell}}{V}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c0}{\sqrt{\ell \cdot V}} \cdot \sqrt{A}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if (((v * l) <= 0.0d0) .or. (.not. ((v * l) <= 5d+288))) then
        tmp = c0 * sqrt(((a / l) / v))
    else
        tmp = (c0 / sqrt((l * v))) * sqrt(a)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
code[c0_, A_, V_, l_] := If[Or[LessEqual[N[(V * l), $MachinePrecision], 0.0], N[Not[LessEqual[N[(V * l), $MachinePrecision], 5e+288]], $MachinePrecision]], N[(c0 * N[Sqrt[N[(N[(A / l), $MachinePrecision] / V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(c0 / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[Sqrt[A], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 V l) < 0.0 or 5.0000000000000003e288 < (*.f64 V l)

   1. Initial program 68.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. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 71.5

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

   4. Applied rewrites 71.5%

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

   if 0.0 < (*.f64 V l) < 5.0000000000000003e288

   1. Initial program 88.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. sqrt-div N/A

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

      5. associate-*r/ N/A

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

      6. associate-*l/ N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. lower-sqrt.f64 97.4

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

   4. Applied rewrites 97.4%

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

4. Final simplification 80.7%

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

Alternative 9: 84.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} [c0, A, V, l] = \mathsf{sort}([c0, A, V, l])\\ \\ \begin{array}{l} \mathbf{if}\;A \leq -1 \cdot 10^{-309}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{\frac{A}{V}}}{\sqrt{\ell}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c0}{\frac{\sqrt{V \cdot \ell}}{\sqrt{A}}}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if (a <= (-1d-309)) then
        tmp = c0 * (sqrt((a / v)) / sqrt(l))
    else
        tmp = c0 / (sqrt((v * l)) / sqrt(a))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (A <= -1e-309)
		tmp = Float64(c0 * Float64(sqrt(Float64(A / V)) / sqrt(l)));
	else
		tmp = Float64(c0 / Float64(sqrt(Float64(V * l)) / sqrt(A)));
	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 (A <= -1e-309)
		tmp = c0 * (sqrt((A / V)) / sqrt(l));
	else
		tmp = c0 / (sqrt((V * l)) / sqrt(A));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if A < -1.000000000000002e-309

   1. Initial program 75.9%

      \[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. lift-*.f64 N/A

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

      4. associate-/r* N/A

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

      5. sqrt-div N/A

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

      6. lower-/.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 48.7

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

   4. Applied rewrites 48.7%

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

   if -1.000000000000002e-309 < A

   1. Initial program 74.7%

      \[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. pow1/2 N/A

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

      4. pow-to-exp N/A

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

      5. sinh-+-cosh-rev N/A

         \[\leadsto c0 \cdot \color{blue}{\left(\cosh \left(\log \left(\frac{A}{V \cdot \ell}\right) \cdot \frac{1}{2}\right) + \sinh \left(\log \left(\frac{A}{V \cdot \ell}\right) \cdot \frac{1}{2}\right)\right)} \]

      6. flip-+ N/A

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

      7. sinh-cosh N/A

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

      8. sinh---cosh-rev N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. exp-neg N/A

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

      13. pow-to-exp N/A

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

      14. pow1/2 N/A

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

      15. lift-sqrt.f64 N/A

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

   4. Applied rewrites 74.6%

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

      1. lift-pow.f64 N/A

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

      2. unpow-1 N/A

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

      3. lift-sqrt.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. sqrt-div N/A

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

      6. lift-sqrt.f64 N/A

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

      7. lift-sqrt.f64 N/A

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

      8. associate-/r/ N/A

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

      9. associate-*l/ N/A

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

      10. lower-/.f64 N/A

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

      11. lower-*.f64 82.6

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 82.6

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

   6. Applied rewrites 82.6%

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

4. Final simplification 65.6%

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

Alternative 10: 83.4% accurate, 0.6× speedup

Math

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

C

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

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(c0, a, v, l)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a
    real(8), intent (in) :: v
    real(8), intent (in) :: l
    real(8) :: tmp
    if (a <= (-1d-309)) then
        tmp = c0 * (sqrt((a / v)) / sqrt(l))
    else
        tmp = (sqrt(a) * c0) / sqrt((l * v))
    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 (A <= -1e-309) {
		tmp = c0 * (Math.sqrt((A / V)) / Math.sqrt(l));
	} else {
		tmp = (Math.sqrt(A) * c0) / Math.sqrt((l * V));
	}
	return tmp;
}

Python

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

Julia

c0, A, V, l = sort([c0, A, V, l])
function code(c0, A, V, l)
	tmp = 0.0
	if (A <= -1e-309)
		tmp = Float64(c0 * Float64(sqrt(Float64(A / V)) / sqrt(l)));
	else
		tmp = Float64(Float64(sqrt(A) * c0) / sqrt(Float64(l * V)));
	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 (A <= -1e-309)
		tmp = c0 * (sqrt((A / V)) / sqrt(l));
	else
		tmp = (sqrt(A) * c0) / sqrt((l * V));
	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[A, -1e-309], N[(c0 * N[(N[Sqrt[N[(A / V), $MachinePrecision]], $MachinePrecision] / N[Sqrt[l], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[A], $MachinePrecision] * c0), $MachinePrecision] / N[Sqrt[N[(l * V), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if A < -1.000000000000002e-309

   1. Initial program 75.9%

      \[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. lift-*.f64 N/A

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

      4. associate-/r* N/A

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

      5. sqrt-div N/A

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

      6. lower-/.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-sqrt.f64 48.7

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

   4. Applied rewrites 48.7%

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

   if -1.000000000000002e-309 < A

   1. Initial program 74.7%

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

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

      3. lift-sqrt.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. sqrt-div N/A

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

      6. associate-*l/ N/A

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

      7. frac-2neg N/A

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

      8. frac-2neg N/A

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

      9. remove-double-neg N/A

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

      10. lower-/.f64 N/A

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

      11. distribute-lft-neg-in N/A

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

      12. distribute-lft-neg-in N/A

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

      13. remove-double-neg N/A

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

      14. lower-*.f64 N/A

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

      15. lower-sqrt.f64 N/A

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

      16. lower-sqrt.f64 81.8

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

      17. lift-*.f64 N/A

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

      18. *-commutative N/A

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

      19. lower-*.f64 81.8

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

   4. Applied rewrites 81.8%

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

Alternative 11: 73.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: c0, A, V, and l should be sorted in increasing order before calling this function.
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.3%

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

Reproduce

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