Linear.Quaternion:$ctan from linear-1.19.1.3

Percentage Accurate: 84.8% → 99.8%

Time: 9.0s

Alternatives: 13

Speedup: 1.0×

• 64.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \frac{\cosh x \cdot \frac{y}{x}}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (* (cosh x) (/ y x)) z))

C

double code(double x, double y, double z) {
	return (cosh(x) * (y / x)) / z;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (cosh(x) * (y / x)) / z
end function

Java

public static double code(double x, double y, double z) {
	return (Math.cosh(x) * (y / x)) / z;
}

Python

def code(x, y, z):
	return (math.cosh(x) * (y / x)) / z

Julia

function code(x, y, z)
	return Float64(Float64(cosh(x) * Float64(y / x)) / z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (cosh(x) * (y / x)) / z;
end

Wolfram

code[x_, y_, z_] := N[(N[(N[Cosh[x], $MachinePrecision] * N[(y / x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]

Initial Program: 84.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\cosh x \cdot \frac{y}{x}}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (* (cosh x) (/ y x)) z))

C

double code(double x, double y, double z) {
	return (cosh(x) * (y / x)) / z;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (cosh(x) * (y / x)) / z
end function

Java

public static double code(double x, double y, double z) {
	return (Math.cosh(x) * (y / x)) / z;
}

Python

def code(x, y, z):
	return (math.cosh(x) * (y / x)) / z

Julia

function code(x, y, z)
	return Float64(Float64(cosh(x) * Float64(y / x)) / z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (cosh(x) * (y / x)) / z;
end

Wolfram

code[x_, y_, z_] := N[(N[(N[Cosh[x], $MachinePrecision] * N[(y / x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ \begin{array}{l} t_0 := \cosh x_m \cdot \frac{y_m}{x_m}\\ y_s \cdot \left(x_s \cdot \begin{array}{l} \mathbf{if}\;t_0 \leq 10^{+242}:\\ \;\;\;\;\frac{t_0}{z}\\ \mathbf{else}:\\ \;\;\;\;y_m \cdot \frac{\frac{\cosh x_m}{z}}{x_m}\\ \end{array}\right) \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (cosh x_m) (/ y_m x_m))))
   (*
    y_s
    (* x_s (if (<= t_0 1e+242) (/ t_0 z) (* y_m (/ (/ (cosh x_m) z) x_m)))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = cosh(x_m) * (y_m / x_m);
	double tmp;
	if (t_0 <= 1e+242) {
		tmp = t_0 / z;
	} else {
		tmp = y_m * ((cosh(x_m) / z) / x_m);
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = cosh(x_m) * (y_m / x_m)
    if (t_0 <= 1d+242) then
        tmp = t_0 / z
    else
        tmp = y_m * ((cosh(x_m) / z) / x_m)
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = Math.cosh(x_m) * (y_m / x_m);
	double tmp;
	if (t_0 <= 1e+242) {
		tmp = t_0 / z;
	} else {
		tmp = y_m * ((Math.cosh(x_m) / z) / x_m);
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	t_0 = math.cosh(x_m) * (y_m / x_m)
	tmp = 0
	if t_0 <= 1e+242:
		tmp = t_0 / z
	else:
		tmp = y_m * ((math.cosh(x_m) / z) / x_m)
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(cosh(x_m) * Float64(y_m / x_m))
	tmp = 0.0
	if (t_0 <= 1e+242)
		tmp = Float64(t_0 / z);
	else
		tmp = Float64(y_m * Float64(Float64(cosh(x_m) / z) / x_m));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = cosh(x_m) * (y_m / x_m);
	tmp = 0.0;
	if (t_0 <= 1e+242)
		tmp = t_0 / z;
	else
		tmp = y_m * ((cosh(x_m) / z) / x_m);
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, 1e+242], N[(t$95$0 / z), $MachinePrecision], N[(y$95$m * N[(N[(N[Cosh[x$95$m], $MachinePrecision] / z), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cosh.f64 x) (/.f64 y x)) < 1.00000000000000005e242

   1. Initial program 96.2%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Add Preprocessing

   if 1.00000000000000005e242 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 74.9%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 74.9%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 74.9%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. expm1-log1p-u 40.9%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\cosh x}{z} \cdot \frac{y}{x}\right)\right)} \]

      2. expm1-udef 40.9%

         \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{\cosh x}{z} \cdot \frac{y}{x}\right)} - 1} \]

      3. associate-*l/ 40.9%

         \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\frac{\cosh x \cdot \frac{y}{x}}{z}}\right)} - 1 \]

      4. div-inv 40.9%

         \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\left(\cosh x \cdot \frac{y}{x}\right) \cdot \frac{1}{z}}\right)} - 1 \]

      5. associate-*l* 34.8%

         \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\cosh x \cdot \left(\frac{y}{x} \cdot \frac{1}{z}\right)}\right)} - 1 \]

      6. div-inv 34.8%

         \[\leadsto e^{\mathsf{log1p}\left(\cosh x \cdot \color{blue}{\frac{\frac{y}{x}}{z}}\right)} - 1 \]

   6. Applied egg-rr 34.8%

      \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\cosh x \cdot \frac{\frac{y}{x}}{z}\right)} - 1} \]
   7. Step-by-step derivation

      1. expm1-def 34.8%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cosh x \cdot \frac{\frac{y}{x}}{z}\right)\right)} \]

      2. expm1-log1p 64.6%

         \[\leadsto \color{blue}{\cosh x \cdot \frac{\frac{y}{x}}{z}} \]

      3. associate-*r/ 74.9%

         \[\leadsto \color{blue}{\frac{\cosh x \cdot \frac{y}{x}}{z}} \]

      4. associate-*l/ 74.9%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

      5. *-commutative 74.9%

         \[\leadsto \color{blue}{\frac{y}{x} \cdot \frac{\cosh x}{z}} \]

      6. associate-*l/ 100.0%

         \[\leadsto \color{blue}{\frac{y \cdot \frac{\cosh x}{z}}{x}} \]

      7. associate-*r/ 100.0%

         \[\leadsto \color{blue}{y \cdot \frac{\frac{\cosh x}{z}}{x}} \]

   8. Simplified 100.0%

      \[\leadsto \color{blue}{y \cdot \frac{\frac{\cosh x}{z}}{x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cosh x \cdot \frac{y}{x} \leq 10^{+242}:\\ \;\;\;\;\frac{\cosh x \cdot \frac{y}{x}}{z}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{\frac{\cosh x}{z}}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 97.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y_s \cdot \left(x_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 200000000:\\ \;\;\;\;\frac{y_m \cdot \frac{\cosh x_m}{x_m}}{z}\\ \mathbf{else}:\\ \;\;\;\;y_m \cdot \frac{\frac{\cosh x_m}{z}}{x_m}\\ \end{array}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= z 200000000.0)
     (/ (* y_m (/ (cosh x_m) x_m)) z)
     (* y_m (/ (/ (cosh x_m) z) x_m))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 200000000.0) {
		tmp = (y_m * (cosh(x_m) / x_m)) / z;
	} else {
		tmp = y_m * ((cosh(x_m) / z) / x_m);
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 200000000.0d0) then
        tmp = (y_m * (cosh(x_m) / x_m)) / z
    else
        tmp = y_m * ((cosh(x_m) / z) / x_m)
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 200000000.0) {
		tmp = (y_m * (Math.cosh(x_m) / x_m)) / z;
	} else {
		tmp = y_m * ((Math.cosh(x_m) / z) / x_m);
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if z <= 200000000.0:
		tmp = (y_m * (math.cosh(x_m) / x_m)) / z
	else:
		tmp = y_m * ((math.cosh(x_m) / z) / x_m)
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 200000000.0)
		tmp = Float64(Float64(y_m * Float64(cosh(x_m) / x_m)) / z);
	else
		tmp = Float64(y_m * Float64(Float64(cosh(x_m) / z) / x_m));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (z <= 200000000.0)
		tmp = (y_m * (cosh(x_m) / x_m)) / z;
	else
		tmp = y_m * ((cosh(x_m) / z) / x_m);
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 200000000.0], N[(N[(y$95$m * N[(N[Cosh[x$95$m], $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(y$95$m * N[(N[(N[Cosh[x$95$m], $MachinePrecision] / z), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 2e8

   1. Initial program 90.4%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. expm1-log1p-u 52.9%

         \[\leadsto \frac{\color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cosh x \cdot \frac{y}{x}\right)\right)}}{z} \]

      2. expm1-udef 42.2%

         \[\leadsto \frac{\color{blue}{e^{\mathsf{log1p}\left(\cosh x \cdot \frac{y}{x}\right)} - 1}}{z} \]

   4. Applied egg-rr 42.2%

      \[\leadsto \frac{\color{blue}{e^{\mathsf{log1p}\left(\cosh x \cdot \frac{y}{x}\right)} - 1}}{z} \]
   5. Step-by-step derivation

      1. expm1-def 52.9%

         \[\leadsto \frac{\color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cosh x \cdot \frac{y}{x}\right)\right)}}{z} \]

      2. expm1-log1p 90.4%

         \[\leadsto \frac{\color{blue}{\cosh x \cdot \frac{y}{x}}}{z} \]

      3. associate-*r/ 97.5%

         \[\leadsto \frac{\color{blue}{\frac{\cosh x \cdot y}{x}}}{z} \]

      4. associate-*l/ 97.5%

         \[\leadsto \frac{\color{blue}{\frac{\cosh x}{x} \cdot y}}{z} \]

      5. *-commutative 97.5%

         \[\leadsto \frac{\color{blue}{y \cdot \frac{\cosh x}{x}}}{z} \]

   6. Simplified 97.5%

      \[\leadsto \frac{\color{blue}{y \cdot \frac{\cosh x}{x}}}{z} \]

   if 2e8 < z

   1. Initial program 80.2%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 80.1%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 80.1%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. expm1-log1p-u 55.4%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\cosh x}{z} \cdot \frac{y}{x}\right)\right)} \]

      2. expm1-udef 35.5%

         \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{\cosh x}{z} \cdot \frac{y}{x}\right)} - 1} \]

      3. associate-*l/ 35.5%

         \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\frac{\cosh x \cdot \frac{y}{x}}{z}}\right)} - 1 \]

      4. div-inv 35.5%

         \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\left(\cosh x \cdot \frac{y}{x}\right) \cdot \frac{1}{z}}\right)} - 1 \]

      5. associate-*l* 25.4%

         \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\cosh x \cdot \left(\frac{y}{x} \cdot \frac{1}{z}\right)}\right)} - 1 \]

      6. div-inv 25.4%

         \[\leadsto e^{\mathsf{log1p}\left(\cosh x \cdot \color{blue}{\frac{\frac{y}{x}}{z}}\right)} - 1 \]

   6. Applied egg-rr 25.4%

      \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\cosh x \cdot \frac{\frac{y}{x}}{z}\right)} - 1} \]
   7. Step-by-step derivation

      1. expm1-def 45.3%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cosh x \cdot \frac{\frac{y}{x}}{z}\right)\right)} \]

      2. expm1-log1p 63.2%

         \[\leadsto \color{blue}{\cosh x \cdot \frac{\frac{y}{x}}{z}} \]

      3. associate-*r/ 80.2%

         \[\leadsto \color{blue}{\frac{\cosh x \cdot \frac{y}{x}}{z}} \]

      4. associate-*l/ 80.1%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

      5. *-commutative 80.1%

         \[\leadsto \color{blue}{\frac{y}{x} \cdot \frac{\cosh x}{z}} \]

      6. associate-*l/ 90.1%

         \[\leadsto \color{blue}{\frac{y \cdot \frac{\cosh x}{z}}{x}} \]

      7. associate-*r/ 99.8%

         \[\leadsto \color{blue}{y \cdot \frac{\frac{\cosh x}{z}}{x}} \]

   8. Simplified 99.8%

      \[\leadsto \color{blue}{y \cdot \frac{\frac{\cosh x}{z}}{x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 200000000:\\ \;\;\;\;\frac{y \cdot \frac{\cosh x}{x}}{z}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{\frac{\cosh x}{z}}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y_s \cdot \left(x_s \cdot \left(y_m \cdot \frac{\frac{\cosh x_m}{z}}{x_m}\right)\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (* y_m (/ (/ (cosh x_m) z) x_m)))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (y_m * ((cosh(x_m) / z) / x_m)));
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = y_s * (x_s * (y_m * ((cosh(x_m) / z) / x_m)))
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (y_m * ((Math.cosh(x_m) / z) / x_m)));
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * (y_m * ((math.cosh(x_m) / z) / x_m)))

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(y_m * Float64(Float64(cosh(x_m) / z) / x_m))))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * (y_m * ((cosh(x_m) / z) / x_m)));
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(y$95$m * N[(N[(N[Cosh[x$95$m], $MachinePrecision] / z), $MachinePrecision] / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 88.1%

   \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
2. Step-by-step derivation

   1. associate-*l/ 88.0%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

3. Simplified 88.0%

   \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. expm1-log1p-u 54.4%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\cosh x}{z} \cdot \frac{y}{x}\right)\right)} \]

   2. expm1-udef 43.1%

      \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{\cosh x}{z} \cdot \frac{y}{x}\right)} - 1} \]

   3. associate-*l/ 43.1%

      \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\frac{\cosh x \cdot \frac{y}{x}}{z}}\right)} - 1 \]

   4. div-inv 43.1%

      \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\left(\cosh x \cdot \frac{y}{x}\right) \cdot \frac{1}{z}}\right)} - 1 \]

   5. associate-*l* 39.2%

      \[\leadsto e^{\mathsf{log1p}\left(\color{blue}{\cosh x \cdot \left(\frac{y}{x} \cdot \frac{1}{z}\right)}\right)} - 1 \]

   6. div-inv 39.2%

      \[\leadsto e^{\mathsf{log1p}\left(\cosh x \cdot \color{blue}{\frac{\frac{y}{x}}{z}}\right)} - 1 \]

6. Applied egg-rr 39.2%

   \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\cosh x \cdot \frac{\frac{y}{x}}{z}\right)} - 1} \]
7. Step-by-step derivation

   1. expm1-def 50.5%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cosh x \cdot \frac{\frac{y}{x}}{z}\right)\right)} \]

   2. expm1-log1p 81.0%

      \[\leadsto \color{blue}{\cosh x \cdot \frac{\frac{y}{x}}{z}} \]

   3. associate-*r/ 88.1%

      \[\leadsto \color{blue}{\frac{\cosh x \cdot \frac{y}{x}}{z}} \]

   4. associate-*l/ 88.0%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   5. *-commutative 88.0%

      \[\leadsto \color{blue}{\frac{y}{x} \cdot \frac{\cosh x}{z}} \]

   6. associate-*l/ 95.9%

      \[\leadsto \color{blue}{\frac{y \cdot \frac{\cosh x}{z}}{x}} \]

   7. associate-*r/ 95.8%

      \[\leadsto \color{blue}{y \cdot \frac{\frac{\cosh x}{z}}{x}} \]

8. Simplified 95.8%

   \[\leadsto \color{blue}{y \cdot \frac{\frac{\cosh x}{z}}{x}} \]

9. Final simplification 95.8%

   \[\leadsto y \cdot \frac{\frac{\cosh x}{z}}{x} \]
10. Add Preprocessing

Alternative 4: 67.8% accurate, 3.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ \begin{array}{l} t_0 := 0.5 \cdot \left(x_m \cdot y_m\right)\\ y_s \cdot \left(x_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 4.2 \cdot 10^{-50}:\\ \;\;\;\;\frac{\frac{y_m}{x_m} + t_0}{z}\\ \mathbf{elif}\;z \leq 2.7 \cdot 10^{+69}:\\ \;\;\;\;\frac{t_0 \cdot \left(x_m \cdot z\right) + y_m \cdot z}{z \cdot \left(x_m \cdot z\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{x_m \cdot y_m}{z} + \frac{y_m}{x_m \cdot z}\\ \end{array}\right) \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* 0.5 (* x_m y_m))))
   (*
    y_s
    (*
     x_s
     (if (<= z 4.2e-50)
       (/ (+ (/ y_m x_m) t_0) z)
       (if (<= z 2.7e+69)
         (/ (+ (* t_0 (* x_m z)) (* y_m z)) (* z (* x_m z)))
         (+ (* 0.5 (/ (* x_m y_m) z)) (/ y_m (* x_m z)))))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = 0.5 * (x_m * y_m);
	double tmp;
	if (z <= 4.2e-50) {
		tmp = ((y_m / x_m) + t_0) / z;
	} else if (z <= 2.7e+69) {
		tmp = ((t_0 * (x_m * z)) + (y_m * z)) / (z * (x_m * z));
	} else {
		tmp = (0.5 * ((x_m * y_m) / z)) + (y_m / (x_m * z));
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 0.5d0 * (x_m * y_m)
    if (z <= 4.2d-50) then
        tmp = ((y_m / x_m) + t_0) / z
    else if (z <= 2.7d+69) then
        tmp = ((t_0 * (x_m * z)) + (y_m * z)) / (z * (x_m * z))
    else
        tmp = (0.5d0 * ((x_m * y_m) / z)) + (y_m / (x_m * z))
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = 0.5 * (x_m * y_m);
	double tmp;
	if (z <= 4.2e-50) {
		tmp = ((y_m / x_m) + t_0) / z;
	} else if (z <= 2.7e+69) {
		tmp = ((t_0 * (x_m * z)) + (y_m * z)) / (z * (x_m * z));
	} else {
		tmp = (0.5 * ((x_m * y_m) / z)) + (y_m / (x_m * z));
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	t_0 = 0.5 * (x_m * y_m)
	tmp = 0
	if z <= 4.2e-50:
		tmp = ((y_m / x_m) + t_0) / z
	elif z <= 2.7e+69:
		tmp = ((t_0 * (x_m * z)) + (y_m * z)) / (z * (x_m * z))
	else:
		tmp = (0.5 * ((x_m * y_m) / z)) + (y_m / (x_m * z))
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(0.5 * Float64(x_m * y_m))
	tmp = 0.0
	if (z <= 4.2e-50)
		tmp = Float64(Float64(Float64(y_m / x_m) + t_0) / z);
	elseif (z <= 2.7e+69)
		tmp = Float64(Float64(Float64(t_0 * Float64(x_m * z)) + Float64(y_m * z)) / Float64(z * Float64(x_m * z)));
	else
		tmp = Float64(Float64(0.5 * Float64(Float64(x_m * y_m) / z)) + Float64(y_m / Float64(x_m * z)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = 0.5 * (x_m * y_m);
	tmp = 0.0;
	if (z <= 4.2e-50)
		tmp = ((y_m / x_m) + t_0) / z;
	elseif (z <= 2.7e+69)
		tmp = ((t_0 * (x_m * z)) + (y_m * z)) / (z * (x_m * z));
	else
		tmp = (0.5 * ((x_m * y_m) / z)) + (y_m / (x_m * z));
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(0.5 * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[z, 4.2e-50], N[(N[(N[(y$95$m / x$95$m), $MachinePrecision] + t$95$0), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 2.7e+69], N[(N[(N[(t$95$0 * N[(x$95$m * z), $MachinePrecision]), $MachinePrecision] + N[(y$95$m * z), $MachinePrecision]), $MachinePrecision] / N[(z * N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(0.5 * N[(N[(x$95$m * y$95$m), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if z < 4.2000000000000002e-50

   1. Initial program 90.3%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 75.1%

      \[\leadsto \frac{\color{blue}{0.5 \cdot \left(x \cdot y\right) + \frac{y}{x}}}{z} \]

   if 4.2000000000000002e-50 < z < 2.6999999999999998e69

   1. Initial program 89.1%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 88.8%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 88.8%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 72.5%

      \[\leadsto \color{blue}{0.5 \cdot \frac{x \cdot y}{z} + \frac{y}{x \cdot z}} \]
   6. Step-by-step derivation

      1. associate-*r/ 72.5%

         \[\leadsto \color{blue}{\frac{0.5 \cdot \left(x \cdot y\right)}{z}} + \frac{y}{x \cdot z} \]

      2. frac-add 78.6%

         \[\leadsto \color{blue}{\frac{\left(0.5 \cdot \left(x \cdot y\right)\right) \cdot \left(x \cdot z\right) + z \cdot y}{z \cdot \left(x \cdot z\right)}} \]

      3. *-commutative 78.6%

         \[\leadsto \frac{\color{blue}{\left(\left(x \cdot y\right) \cdot 0.5\right)} \cdot \left(x \cdot z\right) + z \cdot y}{z \cdot \left(x \cdot z\right)} \]

      4. *-commutative 78.6%

         \[\leadsto \frac{\left(\color{blue}{\left(y \cdot x\right)} \cdot 0.5\right) \cdot \left(x \cdot z\right) + z \cdot y}{z \cdot \left(x \cdot z\right)} \]

   7. Applied egg-rr 78.6%

      \[\leadsto \color{blue}{\frac{\left(\left(y \cdot x\right) \cdot 0.5\right) \cdot \left(x \cdot z\right) + z \cdot y}{z \cdot \left(x \cdot z\right)}} \]

   if 2.6999999999999998e69 < z

   1. Initial program 77.5%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 77.5%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 77.5%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 70.5%

      \[\leadsto \color{blue}{0.5 \cdot \frac{x \cdot y}{z} + \frac{y}{x \cdot z}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 74.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 4.2 \cdot 10^{-50}:\\ \;\;\;\;\frac{\frac{y}{x} + 0.5 \cdot \left(x \cdot y\right)}{z}\\ \mathbf{elif}\;z \leq 2.7 \cdot 10^{+69}:\\ \;\;\;\;\frac{\left(0.5 \cdot \left(x \cdot y\right)\right) \cdot \left(x \cdot z\right) + y \cdot z}{z \cdot \left(x \cdot z\right)}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{x \cdot y}{z} + \frac{y}{x \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 62.3% accurate, 4.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ \begin{array}{l} t_0 := \frac{y_m}{x_m \cdot z}\\ y_s \cdot \left(x_s \cdot \begin{array}{l} \mathbf{if}\;x_m \leq 7 \cdot 10^{-208}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x_m \leq 1.65 \cdot 10^{-65}:\\ \;\;\;\;\frac{\frac{y_m}{z}}{x_m}\\ \mathbf{elif}\;x_m \leq 1.3:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(x_m \cdot \frac{y_m}{z}\right)\\ \end{array}\right) \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (/ y_m (* x_m z))))
   (*
    y_s
    (*
     x_s
     (if (<= x_m 7e-208)
       t_0
       (if (<= x_m 1.65e-65)
         (/ (/ y_m z) x_m)
         (if (<= x_m 1.3) t_0 (* 0.5 (* x_m (/ y_m z))))))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = y_m / (x_m * z);
	double tmp;
	if (x_m <= 7e-208) {
		tmp = t_0;
	} else if (x_m <= 1.65e-65) {
		tmp = (y_m / z) / x_m;
	} else if (x_m <= 1.3) {
		tmp = t_0;
	} else {
		tmp = 0.5 * (x_m * (y_m / z));
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = y_m / (x_m * z)
    if (x_m <= 7d-208) then
        tmp = t_0
    else if (x_m <= 1.65d-65) then
        tmp = (y_m / z) / x_m
    else if (x_m <= 1.3d0) then
        tmp = t_0
    else
        tmp = 0.5d0 * (x_m * (y_m / z))
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = y_m / (x_m * z);
	double tmp;
	if (x_m <= 7e-208) {
		tmp = t_0;
	} else if (x_m <= 1.65e-65) {
		tmp = (y_m / z) / x_m;
	} else if (x_m <= 1.3) {
		tmp = t_0;
	} else {
		tmp = 0.5 * (x_m * (y_m / z));
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	t_0 = y_m / (x_m * z)
	tmp = 0
	if x_m <= 7e-208:
		tmp = t_0
	elif x_m <= 1.65e-65:
		tmp = (y_m / z) / x_m
	elif x_m <= 1.3:
		tmp = t_0
	else:
		tmp = 0.5 * (x_m * (y_m / z))
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(y_m / Float64(x_m * z))
	tmp = 0.0
	if (x_m <= 7e-208)
		tmp = t_0;
	elseif (x_m <= 1.65e-65)
		tmp = Float64(Float64(y_m / z) / x_m);
	elseif (x_m <= 1.3)
		tmp = t_0;
	else
		tmp = Float64(0.5 * Float64(x_m * Float64(y_m / z)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = y_m / (x_m * z);
	tmp = 0.0;
	if (x_m <= 7e-208)
		tmp = t_0;
	elseif (x_m <= 1.65e-65)
		tmp = (y_m / z) / x_m;
	elseif (x_m <= 1.3)
		tmp = t_0;
	else
		tmp = 0.5 * (x_m * (y_m / z));
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 7e-208], t$95$0, If[LessEqual[x$95$m, 1.65e-65], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], If[LessEqual[x$95$m, 1.3], t$95$0, N[(0.5 * N[(x$95$m * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if x < 6.99999999999999982e-208 or 1.6500000000000001e-65 < x < 1.30000000000000004

   1. Initial program 88.3%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 88.3%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 88.3%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 59.5%

      \[\leadsto \color{blue}{\frac{y}{x \cdot z}} \]

   if 6.99999999999999982e-208 < x < 1.6500000000000001e-65

   1. Initial program 90.8%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 90.6%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 90.6%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. associate-/r/ 90.7%

         \[\leadsto \color{blue}{\frac{\cosh x}{\frac{z}{\frac{y}{x}}}} \]

      2. associate-/r/ 96.6%

         \[\leadsto \frac{\cosh x}{\color{blue}{\frac{z}{y} \cdot x}} \]

      3. associate-/r* 96.9%

         \[\leadsto \color{blue}{\frac{\frac{\cosh x}{\frac{z}{y}}}{x}} \]

   6. Applied egg-rr 96.9%

      \[\leadsto \color{blue}{\frac{\frac{\cosh x}{\frac{z}{y}}}{x}} \]

   7. Taylor expanded in x around 0 96.8%

      \[\leadsto \frac{\color{blue}{\frac{y}{z}}}{x} \]

   if 1.30000000000000004 < x

   1. Initial program 86.2%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 86.2%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 86.2%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 52.9%

      \[\leadsto \color{blue}{0.5 \cdot \frac{x \cdot y}{z} + \frac{y}{x \cdot z}} \]

   6. Taylor expanded in x around inf 52.9%

      \[\leadsto \color{blue}{0.5 \cdot \frac{x \cdot y}{z}} \]
   7. Step-by-step derivation

      1. associate-/l* 44.0%

         \[\leadsto 0.5 \cdot \color{blue}{\frac{x}{\frac{z}{y}}} \]

      2. div-inv 44.0%

         \[\leadsto 0.5 \cdot \color{blue}{\left(x \cdot \frac{1}{\frac{z}{y}}\right)} \]

      3. clear-num 44.0%

         \[\leadsto 0.5 \cdot \left(x \cdot \color{blue}{\frac{y}{z}}\right) \]

   8. Applied egg-rr 44.0%

      \[\leadsto 0.5 \cdot \color{blue}{\left(x \cdot \frac{y}{z}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 60.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 7 \cdot 10^{-208}:\\ \;\;\;\;\frac{y}{x \cdot z}\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{-65}:\\ \;\;\;\;\frac{\frac{y}{z}}{x}\\ \mathbf{elif}\;x \leq 1.3:\\ \;\;\;\;\frac{y}{x \cdot z}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 66.0% accurate, 4.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ \begin{array}{l} t_0 := \frac{y_m}{x_m \cdot z}\\ y_s \cdot \left(x_s \cdot \begin{array}{l} \mathbf{if}\;x_m \leq 6.2 \cdot 10^{-208}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x_m \leq 1.45 \cdot 10^{-65}:\\ \;\;\;\;\frac{\frac{y_m}{z}}{x_m}\\ \mathbf{elif}\;x_m \leq 1.3:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(y_m \cdot \frac{x_m}{z}\right)\\ \end{array}\right) \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (/ y_m (* x_m z))))
   (*
    y_s
    (*
     x_s
     (if (<= x_m 6.2e-208)
       t_0
       (if (<= x_m 1.45e-65)
         (/ (/ y_m z) x_m)
         (if (<= x_m 1.3) t_0 (* 0.5 (* y_m (/ x_m z))))))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = y_m / (x_m * z);
	double tmp;
	if (x_m <= 6.2e-208) {
		tmp = t_0;
	} else if (x_m <= 1.45e-65) {
		tmp = (y_m / z) / x_m;
	} else if (x_m <= 1.3) {
		tmp = t_0;
	} else {
		tmp = 0.5 * (y_m * (x_m / z));
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = y_m / (x_m * z)
    if (x_m <= 6.2d-208) then
        tmp = t_0
    else if (x_m <= 1.45d-65) then
        tmp = (y_m / z) / x_m
    else if (x_m <= 1.3d0) then
        tmp = t_0
    else
        tmp = 0.5d0 * (y_m * (x_m / z))
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = y_m / (x_m * z);
	double tmp;
	if (x_m <= 6.2e-208) {
		tmp = t_0;
	} else if (x_m <= 1.45e-65) {
		tmp = (y_m / z) / x_m;
	} else if (x_m <= 1.3) {
		tmp = t_0;
	} else {
		tmp = 0.5 * (y_m * (x_m / z));
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	t_0 = y_m / (x_m * z)
	tmp = 0
	if x_m <= 6.2e-208:
		tmp = t_0
	elif x_m <= 1.45e-65:
		tmp = (y_m / z) / x_m
	elif x_m <= 1.3:
		tmp = t_0
	else:
		tmp = 0.5 * (y_m * (x_m / z))
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(y_m / Float64(x_m * z))
	tmp = 0.0
	if (x_m <= 6.2e-208)
		tmp = t_0;
	elseif (x_m <= 1.45e-65)
		tmp = Float64(Float64(y_m / z) / x_m);
	elseif (x_m <= 1.3)
		tmp = t_0;
	else
		tmp = Float64(0.5 * Float64(y_m * Float64(x_m / z)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = y_m / (x_m * z);
	tmp = 0.0;
	if (x_m <= 6.2e-208)
		tmp = t_0;
	elseif (x_m <= 1.45e-65)
		tmp = (y_m / z) / x_m;
	elseif (x_m <= 1.3)
		tmp = t_0;
	else
		tmp = 0.5 * (y_m * (x_m / z));
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 6.2e-208], t$95$0, If[LessEqual[x$95$m, 1.45e-65], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], If[LessEqual[x$95$m, 1.3], t$95$0, N[(0.5 * N[(y$95$m * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if x < 6.1999999999999996e-208 or 1.4499999999999999e-65 < x < 1.30000000000000004

   1. Initial program 88.3%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 88.3%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 88.3%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 59.5%

      \[\leadsto \color{blue}{\frac{y}{x \cdot z}} \]

   if 6.1999999999999996e-208 < x < 1.4499999999999999e-65

   1. Initial program 90.8%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 90.6%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 90.6%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. associate-/r/ 90.7%

         \[\leadsto \color{blue}{\frac{\cosh x}{\frac{z}{\frac{y}{x}}}} \]

      2. associate-/r/ 96.6%

         \[\leadsto \frac{\cosh x}{\color{blue}{\frac{z}{y} \cdot x}} \]

      3. associate-/r* 96.9%

         \[\leadsto \color{blue}{\frac{\frac{\cosh x}{\frac{z}{y}}}{x}} \]

   6. Applied egg-rr 96.9%

      \[\leadsto \color{blue}{\frac{\frac{\cosh x}{\frac{z}{y}}}{x}} \]

   7. Taylor expanded in x around 0 96.8%

      \[\leadsto \frac{\color{blue}{\frac{y}{z}}}{x} \]

   if 1.30000000000000004 < x

   1. Initial program 86.2%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 86.2%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 86.2%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 52.9%

      \[\leadsto \color{blue}{0.5 \cdot \frac{x \cdot y}{z} + \frac{y}{x \cdot z}} \]

   6. Taylor expanded in x around inf 52.9%

      \[\leadsto \color{blue}{0.5 \cdot \frac{x \cdot y}{z}} \]
   7. Step-by-step derivation

      1. associate-*l/ 49.8%

         \[\leadsto 0.5 \cdot \color{blue}{\left(\frac{x}{z} \cdot y\right)} \]

      2. *-commutative 49.8%

         \[\leadsto 0.5 \cdot \color{blue}{\left(y \cdot \frac{x}{z}\right)} \]

   8. Simplified 49.8%

      \[\leadsto \color{blue}{0.5 \cdot \left(y \cdot \frac{x}{z}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 61.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 6.2 \cdot 10^{-208}:\\ \;\;\;\;\frac{y}{x \cdot z}\\ \mathbf{elif}\;x \leq 1.45 \cdot 10^{-65}:\\ \;\;\;\;\frac{\frac{y}{z}}{x}\\ \mathbf{elif}\;x \leq 1.3:\\ \;\;\;\;\frac{y}{x \cdot z}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(y \cdot \frac{x}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 65.9% accurate, 4.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ \begin{array}{l} t_0 := \frac{y_m}{x_m \cdot z}\\ y_s \cdot \left(x_s \cdot \begin{array}{l} \mathbf{if}\;x_m \leq 7 \cdot 10^{-208}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x_m \leq 4 \cdot 10^{-65}:\\ \;\;\;\;\frac{\frac{y_m}{z}}{x_m}\\ \mathbf{elif}\;x_m \leq 1.3:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{x_m \cdot y_m}{z}\\ \end{array}\right) \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (/ y_m (* x_m z))))
   (*
    y_s
    (*
     x_s
     (if (<= x_m 7e-208)
       t_0
       (if (<= x_m 4e-65)
         (/ (/ y_m z) x_m)
         (if (<= x_m 1.3) t_0 (* 0.5 (/ (* x_m y_m) z)))))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = y_m / (x_m * z);
	double tmp;
	if (x_m <= 7e-208) {
		tmp = t_0;
	} else if (x_m <= 4e-65) {
		tmp = (y_m / z) / x_m;
	} else if (x_m <= 1.3) {
		tmp = t_0;
	} else {
		tmp = 0.5 * ((x_m * y_m) / z);
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = y_m / (x_m * z)
    if (x_m <= 7d-208) then
        tmp = t_0
    else if (x_m <= 4d-65) then
        tmp = (y_m / z) / x_m
    else if (x_m <= 1.3d0) then
        tmp = t_0
    else
        tmp = 0.5d0 * ((x_m * y_m) / z)
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = y_m / (x_m * z);
	double tmp;
	if (x_m <= 7e-208) {
		tmp = t_0;
	} else if (x_m <= 4e-65) {
		tmp = (y_m / z) / x_m;
	} else if (x_m <= 1.3) {
		tmp = t_0;
	} else {
		tmp = 0.5 * ((x_m * y_m) / z);
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	t_0 = y_m / (x_m * z)
	tmp = 0
	if x_m <= 7e-208:
		tmp = t_0
	elif x_m <= 4e-65:
		tmp = (y_m / z) / x_m
	elif x_m <= 1.3:
		tmp = t_0
	else:
		tmp = 0.5 * ((x_m * y_m) / z)
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(y_m / Float64(x_m * z))
	tmp = 0.0
	if (x_m <= 7e-208)
		tmp = t_0;
	elseif (x_m <= 4e-65)
		tmp = Float64(Float64(y_m / z) / x_m);
	elseif (x_m <= 1.3)
		tmp = t_0;
	else
		tmp = Float64(0.5 * Float64(Float64(x_m * y_m) / z));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = y_m / (x_m * z);
	tmp = 0.0;
	if (x_m <= 7e-208)
		tmp = t_0;
	elseif (x_m <= 4e-65)
		tmp = (y_m / z) / x_m;
	elseif (x_m <= 1.3)
		tmp = t_0;
	else
		tmp = 0.5 * ((x_m * y_m) / z);
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 7e-208], t$95$0, If[LessEqual[x$95$m, 4e-65], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], If[LessEqual[x$95$m, 1.3], t$95$0, N[(0.5 * N[(N[(x$95$m * y$95$m), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if x < 6.99999999999999982e-208 or 3.99999999999999969e-65 < x < 1.30000000000000004

   1. Initial program 88.3%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 88.3%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 88.3%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 59.5%

      \[\leadsto \color{blue}{\frac{y}{x \cdot z}} \]

   if 6.99999999999999982e-208 < x < 3.99999999999999969e-65

   1. Initial program 90.8%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 90.6%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 90.6%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. associate-/r/ 90.7%

         \[\leadsto \color{blue}{\frac{\cosh x}{\frac{z}{\frac{y}{x}}}} \]

      2. associate-/r/ 96.6%

         \[\leadsto \frac{\cosh x}{\color{blue}{\frac{z}{y} \cdot x}} \]

      3. associate-/r* 96.9%

         \[\leadsto \color{blue}{\frac{\frac{\cosh x}{\frac{z}{y}}}{x}} \]

   6. Applied egg-rr 96.9%

      \[\leadsto \color{blue}{\frac{\frac{\cosh x}{\frac{z}{y}}}{x}} \]

   7. Taylor expanded in x around 0 96.8%

      \[\leadsto \frac{\color{blue}{\frac{y}{z}}}{x} \]

   if 1.30000000000000004 < x

   1. Initial program 86.2%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 86.2%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 86.2%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 52.9%

      \[\leadsto \color{blue}{0.5 \cdot \frac{x \cdot y}{z} + \frac{y}{x \cdot z}} \]

   6. Taylor expanded in x around inf 52.9%

      \[\leadsto \color{blue}{0.5 \cdot \frac{x \cdot y}{z}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 62.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 7 \cdot 10^{-208}:\\ \;\;\;\;\frac{y}{x \cdot z}\\ \mathbf{elif}\;x \leq 4 \cdot 10^{-65}:\\ \;\;\;\;\frac{\frac{y}{z}}{x}\\ \mathbf{elif}\;x \leq 1.3:\\ \;\;\;\;\frac{y}{x \cdot z}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{x \cdot y}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 67.4% accurate, 5.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y_s \cdot \left(x_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 10^{-57}:\\ \;\;\;\;\frac{\frac{y_m}{x_m} + 0.5 \cdot \left(x_m \cdot y_m\right)}{z}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{x_m \cdot y_m}{z} + \frac{y_m}{x_m \cdot z}\\ \end{array}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= z 1e-57)
     (/ (+ (/ y_m x_m) (* 0.5 (* x_m y_m))) z)
     (+ (* 0.5 (/ (* x_m y_m) z)) (/ y_m (* x_m z)))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1e-57) {
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z;
	} else {
		tmp = (0.5 * ((x_m * y_m) / z)) + (y_m / (x_m * z));
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 1d-57) then
        tmp = ((y_m / x_m) + (0.5d0 * (x_m * y_m))) / z
    else
        tmp = (0.5d0 * ((x_m * y_m) / z)) + (y_m / (x_m * z))
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1e-57) {
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z;
	} else {
		tmp = (0.5 * ((x_m * y_m) / z)) + (y_m / (x_m * z));
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if z <= 1e-57:
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z
	else:
		tmp = (0.5 * ((x_m * y_m) / z)) + (y_m / (x_m * z))
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 1e-57)
		tmp = Float64(Float64(Float64(y_m / x_m) + Float64(0.5 * Float64(x_m * y_m))) / z);
	else
		tmp = Float64(Float64(0.5 * Float64(Float64(x_m * y_m) / z)) + Float64(y_m / Float64(x_m * z)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (z <= 1e-57)
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z;
	else
		tmp = (0.5 * ((x_m * y_m) / z)) + (y_m / (x_m * z));
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 1e-57], N[(N[(N[(y$95$m / x$95$m), $MachinePrecision] + N[(0.5 * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(0.5 * N[(N[(x$95$m * y$95$m), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 9.99999999999999955e-58

   1. Initial program 90.3%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 75.0%

      \[\leadsto \frac{\color{blue}{0.5 \cdot \left(x \cdot y\right) + \frac{y}{x}}}{z} \]

   if 9.99999999999999955e-58 < z

   1. Initial program 82.3%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 82.2%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 82.2%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 71.7%

      \[\leadsto \color{blue}{0.5 \cdot \frac{x \cdot y}{z} + \frac{y}{x \cdot z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 74.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 10^{-57}:\\ \;\;\;\;\frac{\frac{y}{x} + 0.5 \cdot \left(x \cdot y\right)}{z}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{x \cdot y}{z} + \frac{y}{x \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 65.6% accurate, 9.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y_s \cdot \left(x_s \cdot \frac{y_m \cdot \left(x_m \cdot 0.5 + \frac{1}{x_m}\right)}{z}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (/ (* y_m (+ (* x_m 0.5) (/ 1.0 x_m))) z))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * ((y_m * ((x_m * 0.5) + (1.0 / x_m))) / z));
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = y_s * (x_s * ((y_m * ((x_m * 0.5d0) + (1.0d0 / x_m))) / z))
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * ((y_m * ((x_m * 0.5) + (1.0 / x_m))) / z));
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * ((y_m * ((x_m * 0.5) + (1.0 / x_m))) / z))

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(Float64(y_m * Float64(Float64(x_m * 0.5) + Float64(1.0 / x_m))) / z)))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * ((y_m * ((x_m * 0.5) + (1.0 / x_m))) / z));
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(y$95$m * N[(N[(x$95$m * 0.5), $MachinePrecision] + N[(1.0 / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 88.1%

   \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. expm1-log1p-u 51.4%

      \[\leadsto \frac{\color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cosh x \cdot \frac{y}{x}\right)\right)}}{z} \]

   2. expm1-udef 40.8%

      \[\leadsto \frac{\color{blue}{e^{\mathsf{log1p}\left(\cosh x \cdot \frac{y}{x}\right)} - 1}}{z} \]

4. Applied egg-rr 40.8%

   \[\leadsto \frac{\color{blue}{e^{\mathsf{log1p}\left(\cosh x \cdot \frac{y}{x}\right)} - 1}}{z} \]
5. Step-by-step derivation

   1. expm1-def 51.4%

      \[\leadsto \frac{\color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\cosh x \cdot \frac{y}{x}\right)\right)}}{z} \]

   2. expm1-log1p 88.1%

      \[\leadsto \frac{\color{blue}{\cosh x \cdot \frac{y}{x}}}{z} \]

   3. associate-*r/ 95.9%

      \[\leadsto \frac{\color{blue}{\frac{\cosh x \cdot y}{x}}}{z} \]

   4. associate-*l/ 95.8%

      \[\leadsto \frac{\color{blue}{\frac{\cosh x}{x} \cdot y}}{z} \]

   5. *-commutative 95.8%

      \[\leadsto \frac{\color{blue}{y \cdot \frac{\cosh x}{x}}}{z} \]

6. Simplified 95.8%

   \[\leadsto \frac{\color{blue}{y \cdot \frac{\cosh x}{x}}}{z} \]

7. Taylor expanded in x around 0 71.8%

   \[\leadsto \frac{y \cdot \color{blue}{\left(0.5 \cdot x + \frac{1}{x}\right)}}{z} \]

8. Final simplification 71.8%

   \[\leadsto \frac{y \cdot \left(x \cdot 0.5 + \frac{1}{x}\right)}{z} \]
9. Add Preprocessing

Alternative 10: 65.7% accurate, 9.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y_s \cdot \left(x_s \cdot \frac{\frac{y_m}{x_m} + 0.5 \cdot \left(x_m \cdot y_m\right)}{z}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (/ (+ (/ y_m x_m) (* 0.5 (* x_m y_m))) z))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (((y_m / x_m) + (0.5 * (x_m * y_m))) / z));
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = y_s * (x_s * (((y_m / x_m) + (0.5d0 * (x_m * y_m))) / z))
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (((y_m / x_m) + (0.5 * (x_m * y_m))) / z));
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * (((y_m / x_m) + (0.5 * (x_m * y_m))) / z))

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(Float64(Float64(y_m / x_m) + Float64(0.5 * Float64(x_m * y_m))) / z)))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * (((y_m / x_m) + (0.5 * (x_m * y_m))) / z));
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[(y$95$m / x$95$m), $MachinePrecision] + N[(0.5 * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 88.1%

   \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 71.8%

   \[\leadsto \frac{\color{blue}{0.5 \cdot \left(x \cdot y\right) + \frac{y}{x}}}{z} \]

4. Final simplification 71.8%

   \[\leadsto \frac{\frac{y}{x} + 0.5 \cdot \left(x \cdot y\right)}{z} \]
5. Add Preprocessing

Alternative 11: 50.7% accurate, 10.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y_s \cdot \left(x_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 5 \cdot 10^{-67}:\\ \;\;\;\;\frac{\frac{y_m}{x_m}}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y_m}{x_m \cdot z}\\ \end{array}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (if (<= z 5e-67) (/ (/ y_m x_m) z) (/ y_m (* x_m z))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 5e-67) {
		tmp = (y_m / x_m) / z;
	} else {
		tmp = y_m / (x_m * z);
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 5d-67) then
        tmp = (y_m / x_m) / z
    else
        tmp = y_m / (x_m * z)
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 5e-67) {
		tmp = (y_m / x_m) / z;
	} else {
		tmp = y_m / (x_m * z);
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if z <= 5e-67:
		tmp = (y_m / x_m) / z
	else:
		tmp = y_m / (x_m * z)
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 5e-67)
		tmp = Float64(Float64(y_m / x_m) / z);
	else
		tmp = Float64(y_m / Float64(x_m * z));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (z <= 5e-67)
		tmp = (y_m / x_m) / z;
	else
		tmp = y_m / (x_m * z);
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 5e-67], N[(N[(y$95$m / x$95$m), $MachinePrecision] / z), $MachinePrecision], N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 4.9999999999999999e-67

   1. Initial program 90.3%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 52.2%

      \[\leadsto \frac{\color{blue}{\frac{y}{x}}}{z} \]

   if 4.9999999999999999e-67 < z

   1. Initial program 82.3%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 82.2%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 82.2%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 53.2%

      \[\leadsto \color{blue}{\frac{y}{x \cdot z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 52.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 5 \cdot 10^{-67}:\\ \;\;\;\;\frac{\frac{y}{x}}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{x \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 54.9% accurate, 10.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y_s \cdot \left(x_s \cdot \begin{array}{l} \mathbf{if}\;z \leq 10^{-12}:\\ \;\;\;\;\frac{\frac{y_m}{z}}{x_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{y_m}{x_m \cdot z}\\ \end{array}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (if (<= z 1e-12) (/ (/ y_m z) x_m) (/ y_m (* x_m z))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1e-12) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = y_m / (x_m * z);
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 1d-12) then
        tmp = (y_m / z) / x_m
    else
        tmp = y_m / (x_m * z)
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (z <= 1e-12) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = y_m / (x_m * z);
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if z <= 1e-12:
		tmp = (y_m / z) / x_m
	else:
		tmp = y_m / (x_m * z)
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 1e-12)
		tmp = Float64(Float64(y_m / z) / x_m);
	else
		tmp = Float64(y_m / Float64(x_m * z));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (z <= 1e-12)
		tmp = (y_m / z) / x_m;
	else
		tmp = y_m / (x_m * z);
	end
	tmp_2 = y_s * (x_s * tmp);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 1e-12], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 9.9999999999999998e-13

   1. Initial program 90.2%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 90.2%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 90.2%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. associate-/r/ 85.7%

         \[\leadsto \color{blue}{\frac{\cosh x}{\frac{z}{\frac{y}{x}}}} \]

      2. associate-/r/ 89.9%

         \[\leadsto \frac{\cosh x}{\color{blue}{\frac{z}{y} \cdot x}} \]

      3. associate-/r* 93.5%

         \[\leadsto \color{blue}{\frac{\frac{\cosh x}{\frac{z}{y}}}{x}} \]

   6. Applied egg-rr 93.5%

      \[\leadsto \color{blue}{\frac{\frac{\cosh x}{\frac{z}{y}}}{x}} \]

   7. Taylor expanded in x around 0 60.8%

      \[\leadsto \frac{\color{blue}{\frac{y}{z}}}{x} \]

   if 9.9999999999999998e-13 < z

   1. Initial program 81.4%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. Step-by-step derivation

      1. associate-*l/ 81.4%

         \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

   3. Simplified 81.4%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 55.8%

      \[\leadsto \color{blue}{\frac{y}{x \cdot z}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 59.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 10^{-12}:\\ \;\;\;\;\frac{\frac{y}{z}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{x \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 49.4% accurate, 21.4× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y_s \cdot \left(x_s \cdot \frac{y_m}{x_m \cdot z}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (/ y_m (* x_m z)))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (y_m / (x_m * z)));
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = y_s * (x_s * (y_m / (x_m * z)))
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (y_m / (x_m * z)));
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * (y_m / (x_m * z)))

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(y_m / Float64(x_m * z))))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * (y_m / (x_m * z)));
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 88.1%

   \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
2. Step-by-step derivation

   1. associate-*l/ 88.0%

      \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]

3. Simplified 88.0%

   \[\leadsto \color{blue}{\frac{\cosh x}{z} \cdot \frac{y}{x}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 50.9%

   \[\leadsto \color{blue}{\frac{y}{x \cdot z}} \]

6. Final simplification 50.9%

   \[\leadsto \frac{y}{x \cdot z} \]
7. Add Preprocessing

Developer target: 97.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\frac{y}{z}}{x} \cdot \cosh x\\ \mathbf{if}\;y < -4.618902267687042 \cdot 10^{-52}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y < 1.038530535935153 \cdot 10^{-39}:\\ \;\;\;\;\frac{\frac{\cosh x \cdot y}{x}}{z}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (/ (/ y z) x) (cosh x))))
   (if (< y -4.618902267687042e-52)
     t_0
     (if (< y 1.038530535935153e-39) (/ (/ (* (cosh x) y) x) z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((y / z) / x) * cosh(x);
	double tmp;
	if (y < -4.618902267687042e-52) {
		tmp = t_0;
	} else if (y < 1.038530535935153e-39) {
		tmp = ((cosh(x) * y) / x) / z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((y / z) / x) * cosh(x)
    if (y < (-4.618902267687042d-52)) then
        tmp = t_0
    else if (y < 1.038530535935153d-39) then
        tmp = ((cosh(x) * y) / x) / z
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = ((y / z) / x) * Math.cosh(x);
	double tmp;
	if (y < -4.618902267687042e-52) {
		tmp = t_0;
	} else if (y < 1.038530535935153e-39) {
		tmp = ((Math.cosh(x) * y) / x) / z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = ((y / z) / x) * math.cosh(x)
	tmp = 0
	if y < -4.618902267687042e-52:
		tmp = t_0
	elif y < 1.038530535935153e-39:
		tmp = ((math.cosh(x) * y) / x) / z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(y / z) / x) * cosh(x))
	tmp = 0.0
	if (y < -4.618902267687042e-52)
		tmp = t_0;
	elseif (y < 1.038530535935153e-39)
		tmp = Float64(Float64(Float64(cosh(x) * y) / x) / z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = ((y / z) / x) * cosh(x);
	tmp = 0.0;
	if (y < -4.618902267687042e-52)
		tmp = t_0;
	elseif (y < 1.038530535935153e-39)
		tmp = ((cosh(x) * y) / x) / z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(y / z), $MachinePrecision] / x), $MachinePrecision] * N[Cosh[x], $MachinePrecision]), $MachinePrecision]}, If[Less[y, -4.618902267687042e-52], t$95$0, If[Less[y, 1.038530535935153e-39], N[(N[(N[(N[Cosh[x], $MachinePrecision] * y), $MachinePrecision] / x), $MachinePrecision] / z), $MachinePrecision], t$95$0]]]

Reproduce

herbie shell --seed 2024011 
(FPCore (x y z)
  :name "Linear.Quaternion:$ctan from linear-1.19.1.3"
  :precision binary64

  :herbie-target
  (if (< y -4.618902267687042e-52) (* (/ (/ y z) x) (cosh x)) (if (< y 1.038530535935153e-39) (/ (/ (* (cosh x) y) x) z) (* (/ (/ y z) x) (cosh x))))

  (/ (* (cosh x) (/ y x)) z))