Henrywood and Agarwal, Equation (3)

Percentage Accurate: 72.5% → 89.9%

Time: 3.8s

Alternatives: 8

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: 72.5% 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: 89.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} A_m = \left|A\right| \\ V_m = \left|V\right| \\ l_m = \left|\ell\right| \\ [c0, A_m, V_m, l_m] = \mathsf{sort}([c0, A_m, V_m, l_m])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{A\_m}{V\_m \cdot l\_m}}\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;\frac{c0 \cdot \left(A\_m \cdot \sqrt{\frac{V\_m}{A\_m \cdot l\_m}}\right)}{V\_m}\\ \mathbf{elif}\;t\_0 \leq 6 \cdot 10^{+133}:\\ \;\;\;\;c0 \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \left(A\_m \cdot \sqrt{\frac{1}{\left(A\_m \cdot V\_m\right) \cdot l\_m}}\right)\\ \end{array} \end{array} \]

FPCore

A_m = (fabs.f64 A)
V_m = (fabs.f64 V)
l_m = (fabs.f64 l)
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
(FPCore (c0 A_m V_m l_m)
 :precision binary64
 (let* ((t_0 (sqrt (/ A_m (* V_m l_m)))))
   (if (<= t_0 0.0)
     (/ (* c0 (* A_m (sqrt (/ V_m (* A_m l_m))))) V_m)
     (if (<= t_0 6e+133)
       (* c0 t_0)
       (* c0 (* A_m (sqrt (/ 1.0 (* (* A_m V_m) l_m)))))))))

C

A_m = fabs(A);
V_m = fabs(V);
l_m = fabs(l);
assert(c0 < A_m && A_m < V_m && V_m < l_m);
double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = sqrt((A_m / (V_m * l_m)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = (c0 * (A_m * sqrt((V_m / (A_m * l_m))))) / V_m;
	} else if (t_0 <= 6e+133) {
		tmp = c0 * t_0;
	} else {
		tmp = c0 * (A_m * sqrt((1.0 / ((A_m * V_m) * l_m))));
	}
	return tmp;
}

Fortran

A_m =     private
V_m =     private
l_m =     private
NOTE: c0, A_m, V_m, and l_m 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_m, v_m, l_m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a_m
    real(8), intent (in) :: v_m
    real(8), intent (in) :: l_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((a_m / (v_m * l_m)))
    if (t_0 <= 0.0d0) then
        tmp = (c0 * (a_m * sqrt((v_m / (a_m * l_m))))) / v_m
    else if (t_0 <= 6d+133) then
        tmp = c0 * t_0
    else
        tmp = c0 * (a_m * sqrt((1.0d0 / ((a_m * v_m) * l_m))))
    end if
    code = tmp
end function

Java

A_m = Math.abs(A);
V_m = Math.abs(V);
l_m = Math.abs(l);
assert c0 < A_m && A_m < V_m && V_m < l_m;
public static double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = Math.sqrt((A_m / (V_m * l_m)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = (c0 * (A_m * Math.sqrt((V_m / (A_m * l_m))))) / V_m;
	} else if (t_0 <= 6e+133) {
		tmp = c0 * t_0;
	} else {
		tmp = c0 * (A_m * Math.sqrt((1.0 / ((A_m * V_m) * l_m))));
	}
	return tmp;
}

Python

A_m = math.fabs(A)
V_m = math.fabs(V)
l_m = math.fabs(l)
[c0, A_m, V_m, l_m] = sort([c0, A_m, V_m, l_m])
def code(c0, A_m, V_m, l_m):
	t_0 = math.sqrt((A_m / (V_m * l_m)))
	tmp = 0
	if t_0 <= 0.0:
		tmp = (c0 * (A_m * math.sqrt((V_m / (A_m * l_m))))) / V_m
	elif t_0 <= 6e+133:
		tmp = c0 * t_0
	else:
		tmp = c0 * (A_m * math.sqrt((1.0 / ((A_m * V_m) * l_m))))
	return tmp

Julia

A_m = abs(A)
V_m = abs(V)
l_m = abs(l)
c0, A_m, V_m, l_m = sort([c0, A_m, V_m, l_m])
function code(c0, A_m, V_m, l_m)
	t_0 = sqrt(Float64(A_m / Float64(V_m * l_m)))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(Float64(c0 * Float64(A_m * sqrt(Float64(V_m / Float64(A_m * l_m))))) / V_m);
	elseif (t_0 <= 6e+133)
		tmp = Float64(c0 * t_0);
	else
		tmp = Float64(c0 * Float64(A_m * sqrt(Float64(1.0 / Float64(Float64(A_m * V_m) * l_m)))));
	end
	return tmp
end

MATLAB

A_m = abs(A);
V_m = abs(V);
l_m = abs(l);
c0, A_m, V_m, l_m = num2cell(sort([c0, A_m, V_m, l_m])){:}
function tmp_2 = code(c0, A_m, V_m, l_m)
	t_0 = sqrt((A_m / (V_m * l_m)));
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = (c0 * (A_m * sqrt((V_m / (A_m * l_m))))) / V_m;
	elseif (t_0 <= 6e+133)
		tmp = c0 * t_0;
	else
		tmp = c0 * (A_m * sqrt((1.0 / ((A_m * V_m) * l_m))));
	end
	tmp_2 = tmp;
end

Wolfram

A_m = N[Abs[A], $MachinePrecision]
V_m = N[Abs[V], $MachinePrecision]
l_m = N[Abs[l], $MachinePrecision]
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
code[c0_, A$95$m_, V$95$m_, l$95$m_] := Block[{t$95$0 = N[Sqrt[N[(A$95$m / N[(V$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(N[(c0 * N[(A$95$m * N[Sqrt[N[(V$95$m / N[(A$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / V$95$m), $MachinePrecision], If[LessEqual[t$95$0, 6e+133], N[(c0 * t$95$0), $MachinePrecision], N[(c0 * N[(A$95$m * N[Sqrt[N[(1.0 / N[(N[(A$95$m * V$95$m), $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.5%

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

   3. Applied rewrites 72.6%

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

   4. Taylor expanded in V around 0

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

   6. Applied rewrites 64.4%

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

   7. Taylor expanded in A around inf

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

   9. Applied rewrites 56.5%

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

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

   1. Initial program 72.5%

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

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

   1. Initial program 72.5%

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

   2. Taylor expanded in A around inf

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

   4. Applied rewrites 68.2%

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

   6. Applied rewrites 64.1%

      \[\leadsto c0 \cdot \left(A \cdot \sqrt{\frac{1}{\left(A \cdot V\right) \cdot \ell}}\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 89.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} A_m = \left|A\right| \\ V_m = \left|V\right| \\ l_m = \left|\ell\right| \\ [c0, A_m, V_m, l_m] = \mathsf{sort}([c0, A_m, V_m, l_m])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{A\_m}{V\_m \cdot l\_m}}\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A\_m \cdot \frac{l\_m}{V\_m}}}{l\_m}\\ \mathbf{elif}\;t\_0 \leq 6 \cdot 10^{+133}:\\ \;\;\;\;c0 \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \left(A\_m \cdot \sqrt{\frac{1}{\left(A\_m \cdot V\_m\right) \cdot l\_m}}\right)\\ \end{array} \end{array} \]

FPCore

A_m = (fabs.f64 A)
V_m = (fabs.f64 V)
l_m = (fabs.f64 l)
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
(FPCore (c0 A_m V_m l_m)
 :precision binary64
 (let* ((t_0 (sqrt (/ A_m (* V_m l_m)))))
   (if (<= t_0 0.0)
     (* c0 (/ (sqrt (* A_m (/ l_m V_m))) l_m))
     (if (<= t_0 6e+133)
       (* c0 t_0)
       (* c0 (* A_m (sqrt (/ 1.0 (* (* A_m V_m) l_m)))))))))

C

A_m = fabs(A);
V_m = fabs(V);
l_m = fabs(l);
assert(c0 < A_m && A_m < V_m && V_m < l_m);
double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = sqrt((A_m / (V_m * l_m)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * (sqrt((A_m * (l_m / V_m))) / l_m);
	} else if (t_0 <= 6e+133) {
		tmp = c0 * t_0;
	} else {
		tmp = c0 * (A_m * sqrt((1.0 / ((A_m * V_m) * l_m))));
	}
	return tmp;
}

Fortran

A_m =     private
V_m =     private
l_m =     private
NOTE: c0, A_m, V_m, and l_m 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_m, v_m, l_m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a_m
    real(8), intent (in) :: v_m
    real(8), intent (in) :: l_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((a_m / (v_m * l_m)))
    if (t_0 <= 0.0d0) then
        tmp = c0 * (sqrt((a_m * (l_m / v_m))) / l_m)
    else if (t_0 <= 6d+133) then
        tmp = c0 * t_0
    else
        tmp = c0 * (a_m * sqrt((1.0d0 / ((a_m * v_m) * l_m))))
    end if
    code = tmp
end function

Java

A_m = Math.abs(A);
V_m = Math.abs(V);
l_m = Math.abs(l);
assert c0 < A_m && A_m < V_m && V_m < l_m;
public static double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = Math.sqrt((A_m / (V_m * l_m)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * (Math.sqrt((A_m * (l_m / V_m))) / l_m);
	} else if (t_0 <= 6e+133) {
		tmp = c0 * t_0;
	} else {
		tmp = c0 * (A_m * Math.sqrt((1.0 / ((A_m * V_m) * l_m))));
	}
	return tmp;
}

Python

A_m = math.fabs(A)
V_m = math.fabs(V)
l_m = math.fabs(l)
[c0, A_m, V_m, l_m] = sort([c0, A_m, V_m, l_m])
def code(c0, A_m, V_m, l_m):
	t_0 = math.sqrt((A_m / (V_m * l_m)))
	tmp = 0
	if t_0 <= 0.0:
		tmp = c0 * (math.sqrt((A_m * (l_m / V_m))) / l_m)
	elif t_0 <= 6e+133:
		tmp = c0 * t_0
	else:
		tmp = c0 * (A_m * math.sqrt((1.0 / ((A_m * V_m) * l_m))))
	return tmp

Julia

A_m = abs(A)
V_m = abs(V)
l_m = abs(l)
c0, A_m, V_m, l_m = sort([c0, A_m, V_m, l_m])
function code(c0, A_m, V_m, l_m)
	t_0 = sqrt(Float64(A_m / Float64(V_m * l_m)))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(c0 * Float64(sqrt(Float64(A_m * Float64(l_m / V_m))) / l_m));
	elseif (t_0 <= 6e+133)
		tmp = Float64(c0 * t_0);
	else
		tmp = Float64(c0 * Float64(A_m * sqrt(Float64(1.0 / Float64(Float64(A_m * V_m) * l_m)))));
	end
	return tmp
end

MATLAB

A_m = abs(A);
V_m = abs(V);
l_m = abs(l);
c0, A_m, V_m, l_m = num2cell(sort([c0, A_m, V_m, l_m])){:}
function tmp_2 = code(c0, A_m, V_m, l_m)
	t_0 = sqrt((A_m / (V_m * l_m)));
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = c0 * (sqrt((A_m * (l_m / V_m))) / l_m);
	elseif (t_0 <= 6e+133)
		tmp = c0 * t_0;
	else
		tmp = c0 * (A_m * sqrt((1.0 / ((A_m * V_m) * l_m))));
	end
	tmp_2 = tmp;
end

Wolfram

A_m = N[Abs[A], $MachinePrecision]
V_m = N[Abs[V], $MachinePrecision]
l_m = N[Abs[l], $MachinePrecision]
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
code[c0_, A$95$m_, V$95$m_, l$95$m_] := Block[{t$95$0 = N[Sqrt[N[(A$95$m / N[(V$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[(N[Sqrt[N[(A$95$m * N[(l$95$m / V$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 6e+133], N[(c0 * t$95$0), $MachinePrecision], N[(c0 * N[(A$95$m * N[Sqrt[N[(1.0 / N[(N[(A$95$m * V$95$m), $MachinePrecision] * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.5%

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

   2. Taylor expanded in l around 0

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

   4. Applied rewrites 64.2%

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

   6. Applied rewrites 64.5%

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

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

   1. Initial program 72.5%

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

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

   1. Initial program 72.5%

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

   2. Taylor expanded in A around inf

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

   4. Applied rewrites 68.2%

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

   6. Applied rewrites 64.1%

      \[\leadsto c0 \cdot \left(A \cdot \sqrt{\frac{1}{\left(A \cdot V\right) \cdot \ell}}\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 88.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} A_m = \left|A\right| \\ V_m = \left|V\right| \\ l_m = \left|\ell\right| \\ [c0, A_m, V_m, l_m] = \mathsf{sort}([c0, A_m, V_m, l_m])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{A\_m}{V\_m \cdot l\_m}}\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A\_m \cdot \frac{l\_m}{V\_m}}}{l\_m}\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+138}:\\ \;\;\;\;c0 \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \frac{\sqrt{\frac{A\_m \cdot V\_m}{l\_m}}}{V\_m}\\ \end{array} \end{array} \]

FPCore

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

C

A_m = fabs(A);
V_m = fabs(V);
l_m = fabs(l);
assert(c0 < A_m && A_m < V_m && V_m < l_m);
double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = sqrt((A_m / (V_m * l_m)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * (sqrt((A_m * (l_m / V_m))) / l_m);
	} else if (t_0 <= 5e+138) {
		tmp = c0 * t_0;
	} else {
		tmp = c0 * (sqrt(((A_m * V_m) / l_m)) / V_m);
	}
	return tmp;
}

Fortran

A_m =     private
V_m =     private
l_m =     private
NOTE: c0, A_m, V_m, and l_m 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_m, v_m, l_m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a_m
    real(8), intent (in) :: v_m
    real(8), intent (in) :: l_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((a_m / (v_m * l_m)))
    if (t_0 <= 0.0d0) then
        tmp = c0 * (sqrt((a_m * (l_m / v_m))) / l_m)
    else if (t_0 <= 5d+138) then
        tmp = c0 * t_0
    else
        tmp = c0 * (sqrt(((a_m * v_m) / l_m)) / v_m)
    end if
    code = tmp
end function

Java

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

Python

A_m = math.fabs(A)
V_m = math.fabs(V)
l_m = math.fabs(l)
[c0, A_m, V_m, l_m] = sort([c0, A_m, V_m, l_m])
def code(c0, A_m, V_m, l_m):
	t_0 = math.sqrt((A_m / (V_m * l_m)))
	tmp = 0
	if t_0 <= 0.0:
		tmp = c0 * (math.sqrt((A_m * (l_m / V_m))) / l_m)
	elif t_0 <= 5e+138:
		tmp = c0 * t_0
	else:
		tmp = c0 * (math.sqrt(((A_m * V_m) / l_m)) / V_m)
	return tmp

Julia

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

MATLAB

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

Wolfram

A_m = N[Abs[A], $MachinePrecision]
V_m = N[Abs[V], $MachinePrecision]
l_m = N[Abs[l], $MachinePrecision]
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
code[c0_, A$95$m_, V$95$m_, l$95$m_] := Block[{t$95$0 = N[Sqrt[N[(A$95$m / N[(V$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[(N[Sqrt[N[(A$95$m * N[(l$95$m / V$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+138], N[(c0 * t$95$0), $MachinePrecision], N[(c0 * N[(N[Sqrt[N[(N[(A$95$m * V$95$m), $MachinePrecision] / l$95$m), $MachinePrecision]], $MachinePrecision] / V$95$m), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.5%

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

   2. Taylor expanded in l around 0

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

   4. Applied rewrites 64.2%

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

   6. Applied rewrites 64.5%

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

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

   1. Initial program 72.5%

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

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

   1. Initial program 72.5%

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

   2. Taylor expanded in V around 0

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

   4. Applied rewrites 65.9%

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

Alternative 4: 88.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} A_m = \left|A\right| \\ V_m = \left|V\right| \\ l_m = \left|\ell\right| \\ [c0, A_m, V_m, l_m] = \mathsf{sort}([c0, A_m, V_m, l_m])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{A\_m}{V\_m \cdot l\_m}}\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;c0 \cdot \frac{\sqrt{A\_m \cdot \frac{l\_m}{V\_m}}}{l\_m}\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+118}:\\ \;\;\;\;c0 \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{c0 \cdot \sqrt{\frac{A\_m \cdot V\_m}{l\_m}}}{V\_m}\\ \end{array} \end{array} \]

FPCore

A_m = (fabs.f64 A)
V_m = (fabs.f64 V)
l_m = (fabs.f64 l)
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
(FPCore (c0 A_m V_m l_m)
 :precision binary64
 (let* ((t_0 (sqrt (/ A_m (* V_m l_m)))))
   (if (<= t_0 0.0)
     (* c0 (/ (sqrt (* A_m (/ l_m V_m))) l_m))
     (if (<= t_0 2e+118)
       (* c0 t_0)
       (/ (* c0 (sqrt (/ (* A_m V_m) l_m))) V_m)))))

C

A_m = fabs(A);
V_m = fabs(V);
l_m = fabs(l);
assert(c0 < A_m && A_m < V_m && V_m < l_m);
double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = sqrt((A_m / (V_m * l_m)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * (sqrt((A_m * (l_m / V_m))) / l_m);
	} else if (t_0 <= 2e+118) {
		tmp = c0 * t_0;
	} else {
		tmp = (c0 * sqrt(((A_m * V_m) / l_m))) / V_m;
	}
	return tmp;
}

Fortran

A_m =     private
V_m =     private
l_m =     private
NOTE: c0, A_m, V_m, and l_m 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_m, v_m, l_m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a_m
    real(8), intent (in) :: v_m
    real(8), intent (in) :: l_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((a_m / (v_m * l_m)))
    if (t_0 <= 0.0d0) then
        tmp = c0 * (sqrt((a_m * (l_m / v_m))) / l_m)
    else if (t_0 <= 2d+118) then
        tmp = c0 * t_0
    else
        tmp = (c0 * sqrt(((a_m * v_m) / l_m))) / v_m
    end if
    code = tmp
end function

Java

A_m = Math.abs(A);
V_m = Math.abs(V);
l_m = Math.abs(l);
assert c0 < A_m && A_m < V_m && V_m < l_m;
public static double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = Math.sqrt((A_m / (V_m * l_m)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = c0 * (Math.sqrt((A_m * (l_m / V_m))) / l_m);
	} else if (t_0 <= 2e+118) {
		tmp = c0 * t_0;
	} else {
		tmp = (c0 * Math.sqrt(((A_m * V_m) / l_m))) / V_m;
	}
	return tmp;
}

Python

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

Julia

A_m = abs(A)
V_m = abs(V)
l_m = abs(l)
c0, A_m, V_m, l_m = sort([c0, A_m, V_m, l_m])
function code(c0, A_m, V_m, l_m)
	t_0 = sqrt(Float64(A_m / Float64(V_m * l_m)))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(c0 * Float64(sqrt(Float64(A_m * Float64(l_m / V_m))) / l_m));
	elseif (t_0 <= 2e+118)
		tmp = Float64(c0 * t_0);
	else
		tmp = Float64(Float64(c0 * sqrt(Float64(Float64(A_m * V_m) / l_m))) / V_m);
	end
	return tmp
end

MATLAB

A_m = abs(A);
V_m = abs(V);
l_m = abs(l);
c0, A_m, V_m, l_m = num2cell(sort([c0, A_m, V_m, l_m])){:}
function tmp_2 = code(c0, A_m, V_m, l_m)
	t_0 = sqrt((A_m / (V_m * l_m)));
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = c0 * (sqrt((A_m * (l_m / V_m))) / l_m);
	elseif (t_0 <= 2e+118)
		tmp = c0 * t_0;
	else
		tmp = (c0 * sqrt(((A_m * V_m) / l_m))) / V_m;
	end
	tmp_2 = tmp;
end

Wolfram

A_m = N[Abs[A], $MachinePrecision]
V_m = N[Abs[V], $MachinePrecision]
l_m = N[Abs[l], $MachinePrecision]
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
code[c0_, A$95$m_, V$95$m_, l$95$m_] := Block[{t$95$0 = N[Sqrt[N[(A$95$m / N[(V$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(c0 * N[(N[Sqrt[N[(A$95$m * N[(l$95$m / V$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / l$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+118], N[(c0 * t$95$0), $MachinePrecision], N[(N[(c0 * N[Sqrt[N[(N[(A$95$m * V$95$m), $MachinePrecision] / l$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / V$95$m), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.5%

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

   2. Taylor expanded in l around 0

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

   4. Applied rewrites 64.2%

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

   6. Applied rewrites 64.5%

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

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

   1. Initial program 72.5%

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

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

   1. Initial program 72.5%

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

   2. Taylor expanded in V around 0

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

   4. Applied rewrites 64.4%

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

Alternative 5: 88.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} A_m = \left|A\right| \\ V_m = \left|V\right| \\ l_m = \left|\ell\right| \\ [c0, A_m, V_m, l_m] = \mathsf{sort}([c0, A_m, V_m, l_m])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{A\_m}{V\_m \cdot l\_m}}\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;\frac{c0 \cdot \sqrt{\frac{A\_m \cdot l\_m}{V\_m}}}{l\_m}\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+118}:\\ \;\;\;\;c0 \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{c0 \cdot \sqrt{\frac{A\_m \cdot V\_m}{l\_m}}}{V\_m}\\ \end{array} \end{array} \]

FPCore

A_m = (fabs.f64 A)
V_m = (fabs.f64 V)
l_m = (fabs.f64 l)
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
(FPCore (c0 A_m V_m l_m)
 :precision binary64
 (let* ((t_0 (sqrt (/ A_m (* V_m l_m)))))
   (if (<= t_0 0.0)
     (/ (* c0 (sqrt (/ (* A_m l_m) V_m))) l_m)
     (if (<= t_0 2e+118)
       (* c0 t_0)
       (/ (* c0 (sqrt (/ (* A_m V_m) l_m))) V_m)))))

C

A_m = fabs(A);
V_m = fabs(V);
l_m = fabs(l);
assert(c0 < A_m && A_m < V_m && V_m < l_m);
double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = sqrt((A_m / (V_m * l_m)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = (c0 * sqrt(((A_m * l_m) / V_m))) / l_m;
	} else if (t_0 <= 2e+118) {
		tmp = c0 * t_0;
	} else {
		tmp = (c0 * sqrt(((A_m * V_m) / l_m))) / V_m;
	}
	return tmp;
}

Fortran

A_m =     private
V_m =     private
l_m =     private
NOTE: c0, A_m, V_m, and l_m 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_m, v_m, l_m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a_m
    real(8), intent (in) :: v_m
    real(8), intent (in) :: l_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((a_m / (v_m * l_m)))
    if (t_0 <= 0.0d0) then
        tmp = (c0 * sqrt(((a_m * l_m) / v_m))) / l_m
    else if (t_0 <= 2d+118) then
        tmp = c0 * t_0
    else
        tmp = (c0 * sqrt(((a_m * v_m) / l_m))) / v_m
    end if
    code = tmp
end function

Java

A_m = Math.abs(A);
V_m = Math.abs(V);
l_m = Math.abs(l);
assert c0 < A_m && A_m < V_m && V_m < l_m;
public static double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = Math.sqrt((A_m / (V_m * l_m)));
	double tmp;
	if (t_0 <= 0.0) {
		tmp = (c0 * Math.sqrt(((A_m * l_m) / V_m))) / l_m;
	} else if (t_0 <= 2e+118) {
		tmp = c0 * t_0;
	} else {
		tmp = (c0 * Math.sqrt(((A_m * V_m) / l_m))) / V_m;
	}
	return tmp;
}

Python

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

Julia

A_m = abs(A)
V_m = abs(V)
l_m = abs(l)
c0, A_m, V_m, l_m = sort([c0, A_m, V_m, l_m])
function code(c0, A_m, V_m, l_m)
	t_0 = sqrt(Float64(A_m / Float64(V_m * l_m)))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(Float64(c0 * sqrt(Float64(Float64(A_m * l_m) / V_m))) / l_m);
	elseif (t_0 <= 2e+118)
		tmp = Float64(c0 * t_0);
	else
		tmp = Float64(Float64(c0 * sqrt(Float64(Float64(A_m * V_m) / l_m))) / V_m);
	end
	return tmp
end

MATLAB

A_m = abs(A);
V_m = abs(V);
l_m = abs(l);
c0, A_m, V_m, l_m = num2cell(sort([c0, A_m, V_m, l_m])){:}
function tmp_2 = code(c0, A_m, V_m, l_m)
	t_0 = sqrt((A_m / (V_m * l_m)));
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = (c0 * sqrt(((A_m * l_m) / V_m))) / l_m;
	elseif (t_0 <= 2e+118)
		tmp = c0 * t_0;
	else
		tmp = (c0 * sqrt(((A_m * V_m) / l_m))) / V_m;
	end
	tmp_2 = tmp;
end

Wolfram

A_m = N[Abs[A], $MachinePrecision]
V_m = N[Abs[V], $MachinePrecision]
l_m = N[Abs[l], $MachinePrecision]
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
code[c0_, A$95$m_, V$95$m_, l$95$m_] := Block[{t$95$0 = N[Sqrt[N[(A$95$m / N[(V$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(N[(c0 * N[Sqrt[N[(N[(A$95$m * l$95$m), $MachinePrecision] / V$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / l$95$m), $MachinePrecision], If[LessEqual[t$95$0, 2e+118], N[(c0 * t$95$0), $MachinePrecision], N[(N[(c0 * N[Sqrt[N[(N[(A$95$m * V$95$m), $MachinePrecision] / l$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / V$95$m), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 72.5%

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

   2. Taylor expanded in l around 0

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

   4. Applied rewrites 62.5%

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

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

   1. Initial program 72.5%

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

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

   1. Initial program 72.5%

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

   2. Taylor expanded in V around 0

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

   4. Applied rewrites 64.4%

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

Alternative 6: 86.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} A_m = \left|A\right| \\ V_m = \left|V\right| \\ l_m = \left|\ell\right| \\ [c0, A_m, V_m, l_m] = \mathsf{sort}([c0, A_m, V_m, l_m])\\ \\ \begin{array}{l} t_0 := \sqrt{\frac{A\_m}{V\_m \cdot l\_m}}\\ t_1 := \frac{c0 \cdot \sqrt{\frac{A\_m \cdot V\_m}{l\_m}}}{V\_m}\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+118}:\\ \;\;\;\;c0 \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

A_m = (fabs.f64 A)
V_m = (fabs.f64 V)
l_m = (fabs.f64 l)
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
(FPCore (c0 A_m V_m l_m)
 :precision binary64
 (let* ((t_0 (sqrt (/ A_m (* V_m l_m))))
        (t_1 (/ (* c0 (sqrt (/ (* A_m V_m) l_m))) V_m)))
   (if (<= t_0 0.0) t_1 (if (<= t_0 2e+118) (* c0 t_0) t_1))))

C

A_m = fabs(A);
V_m = fabs(V);
l_m = fabs(l);
assert(c0 < A_m && A_m < V_m && V_m < l_m);
double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = sqrt((A_m / (V_m * l_m)));
	double t_1 = (c0 * sqrt(((A_m * V_m) / l_m))) / V_m;
	double tmp;
	if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 2e+118) {
		tmp = c0 * t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

A_m =     private
V_m =     private
l_m =     private
NOTE: c0, A_m, V_m, and l_m 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_m, v_m, l_m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a_m
    real(8), intent (in) :: v_m
    real(8), intent (in) :: l_m
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = sqrt((a_m / (v_m * l_m)))
    t_1 = (c0 * sqrt(((a_m * v_m) / l_m))) / v_m
    if (t_0 <= 0.0d0) then
        tmp = t_1
    else if (t_0 <= 2d+118) then
        tmp = c0 * t_0
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

A_m = Math.abs(A);
V_m = Math.abs(V);
l_m = Math.abs(l);
assert c0 < A_m && A_m < V_m && V_m < l_m;
public static double code(double c0, double A_m, double V_m, double l_m) {
	double t_0 = Math.sqrt((A_m / (V_m * l_m)));
	double t_1 = (c0 * Math.sqrt(((A_m * V_m) / l_m))) / V_m;
	double tmp;
	if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 2e+118) {
		tmp = c0 * t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

A_m = abs(A)
V_m = abs(V)
l_m = abs(l)
c0, A_m, V_m, l_m = sort([c0, A_m, V_m, l_m])
function code(c0, A_m, V_m, l_m)
	t_0 = sqrt(Float64(A_m / Float64(V_m * l_m)))
	t_1 = Float64(Float64(c0 * sqrt(Float64(Float64(A_m * V_m) / l_m))) / V_m)
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 2e+118)
		tmp = Float64(c0 * t_0);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

A_m = abs(A);
V_m = abs(V);
l_m = abs(l);
c0, A_m, V_m, l_m = num2cell(sort([c0, A_m, V_m, l_m])){:}
function tmp_2 = code(c0, A_m, V_m, l_m)
	t_0 = sqrt((A_m / (V_m * l_m)));
	t_1 = (c0 * sqrt(((A_m * V_m) / l_m))) / V_m;
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 2e+118)
		tmp = c0 * t_0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

A_m = N[Abs[A], $MachinePrecision]
V_m = N[Abs[V], $MachinePrecision]
l_m = N[Abs[l], $MachinePrecision]
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
code[c0_, A$95$m_, V$95$m_, l$95$m_] := Block[{t$95$0 = N[Sqrt[N[(A$95$m / N[(V$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[(c0 * N[Sqrt[N[(N[(A$95$m * V$95$m), $MachinePrecision] / l$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / V$95$m), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], t$95$1, If[LessEqual[t$95$0, 2e+118], N[(c0 * t$95$0), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 72.5%

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

   2. Taylor expanded in V around 0

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

   4. Applied rewrites 64.4%

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

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

   1. Initial program 72.5%

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

Alternative 7: 75.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} A_m = \left|A\right| \\ V_m = \left|V\right| \\ l_m = \left|\ell\right| \\ [c0, A_m, V_m, l_m] = \mathsf{sort}([c0, A_m, V_m, l_m])\\ \\ \begin{array}{l} \mathbf{if}\;A\_m \leq 2 \cdot 10^{+35}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{\frac{A\_m}{V\_m}}{l\_m}}\\ \mathbf{else}:\\ \;\;\;\;c0 \cdot \sqrt{\frac{A\_m}{V\_m \cdot l\_m}}\\ \end{array} \end{array} \]

FPCore

A_m = (fabs.f64 A)
V_m = (fabs.f64 V)
l_m = (fabs.f64 l)
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
(FPCore (c0 A_m V_m l_m)
 :precision binary64
 (if (<= A_m 2e+35)
   (* c0 (sqrt (/ (/ A_m V_m) l_m)))
   (* c0 (sqrt (/ A_m (* V_m l_m))))))

C

A_m = fabs(A);
V_m = fabs(V);
l_m = fabs(l);
assert(c0 < A_m && A_m < V_m && V_m < l_m);
double code(double c0, double A_m, double V_m, double l_m) {
	double tmp;
	if (A_m <= 2e+35) {
		tmp = c0 * sqrt(((A_m / V_m) / l_m));
	} else {
		tmp = c0 * sqrt((A_m / (V_m * l_m)));
	}
	return tmp;
}

Fortran

A_m =     private
V_m =     private
l_m =     private
NOTE: c0, A_m, V_m, and l_m 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_m, v_m, l_m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a_m
    real(8), intent (in) :: v_m
    real(8), intent (in) :: l_m
    real(8) :: tmp
    if (a_m <= 2d+35) then
        tmp = c0 * sqrt(((a_m / v_m) / l_m))
    else
        tmp = c0 * sqrt((a_m / (v_m * l_m)))
    end if
    code = tmp
end function

Java

A_m = Math.abs(A);
V_m = Math.abs(V);
l_m = Math.abs(l);
assert c0 < A_m && A_m < V_m && V_m < l_m;
public static double code(double c0, double A_m, double V_m, double l_m) {
	double tmp;
	if (A_m <= 2e+35) {
		tmp = c0 * Math.sqrt(((A_m / V_m) / l_m));
	} else {
		tmp = c0 * Math.sqrt((A_m / (V_m * l_m)));
	}
	return tmp;
}

Python

A_m = math.fabs(A)
V_m = math.fabs(V)
l_m = math.fabs(l)
[c0, A_m, V_m, l_m] = sort([c0, A_m, V_m, l_m])
def code(c0, A_m, V_m, l_m):
	tmp = 0
	if A_m <= 2e+35:
		tmp = c0 * math.sqrt(((A_m / V_m) / l_m))
	else:
		tmp = c0 * math.sqrt((A_m / (V_m * l_m)))
	return tmp

Julia

A_m = abs(A)
V_m = abs(V)
l_m = abs(l)
c0, A_m, V_m, l_m = sort([c0, A_m, V_m, l_m])
function code(c0, A_m, V_m, l_m)
	tmp = 0.0
	if (A_m <= 2e+35)
		tmp = Float64(c0 * sqrt(Float64(Float64(A_m / V_m) / l_m)));
	else
		tmp = Float64(c0 * sqrt(Float64(A_m / Float64(V_m * l_m))));
	end
	return tmp
end

MATLAB

A_m = abs(A);
V_m = abs(V);
l_m = abs(l);
c0, A_m, V_m, l_m = num2cell(sort([c0, A_m, V_m, l_m])){:}
function tmp_2 = code(c0, A_m, V_m, l_m)
	tmp = 0.0;
	if (A_m <= 2e+35)
		tmp = c0 * sqrt(((A_m / V_m) / l_m));
	else
		tmp = c0 * sqrt((A_m / (V_m * l_m)));
	end
	tmp_2 = tmp;
end

Wolfram

A_m = N[Abs[A], $MachinePrecision]
V_m = N[Abs[V], $MachinePrecision]
l_m = N[Abs[l], $MachinePrecision]
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
code[c0_, A$95$m_, V$95$m_, l$95$m_] := If[LessEqual[A$95$m, 2e+35], N[(c0 * N[Sqrt[N[(N[(A$95$m / V$95$m), $MachinePrecision] / l$95$m), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(c0 * N[Sqrt[N[(A$95$m / N[(V$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if A < 1.9999999999999999e35

   1. Initial program 72.5%

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

   3. Applied rewrites 72.6%

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

   if 1.9999999999999999e35 < A

   1. Initial program 72.5%

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

Alternative 8: 72.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} A_m = \left|A\right| \\ V_m = \left|V\right| \\ l_m = \left|\ell\right| \\ [c0, A_m, V_m, l_m] = \mathsf{sort}([c0, A_m, V_m, l_m])\\ \\ c0 \cdot \sqrt{\frac{A\_m}{V\_m \cdot l\_m}} \end{array} \]

FPCore

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

C

A_m = fabs(A);
V_m = fabs(V);
l_m = fabs(l);
assert(c0 < A_m && A_m < V_m && V_m < l_m);
double code(double c0, double A_m, double V_m, double l_m) {
	return c0 * sqrt((A_m / (V_m * l_m)));
}

Fortran

A_m =     private
V_m =     private
l_m =     private
NOTE: c0, A_m, V_m, and l_m 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_m, v_m, l_m)
use fmin_fmax_functions
    real(8), intent (in) :: c0
    real(8), intent (in) :: a_m
    real(8), intent (in) :: v_m
    real(8), intent (in) :: l_m
    code = c0 * sqrt((a_m / (v_m * l_m)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

A_m = N[Abs[A], $MachinePrecision]
V_m = N[Abs[V], $MachinePrecision]
l_m = N[Abs[l], $MachinePrecision]
NOTE: c0, A_m, V_m, and l_m should be sorted in increasing order before calling this function.
code[c0_, A$95$m_, V$95$m_, l$95$m_] := N[(c0 * N[Sqrt[N[(A$95$m / N[(V$95$m * l$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 72.5%

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

Reproduce

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