Linear.Quaternion:$ctan from linear-1.19.1.3

Percentage Accurate: 84.1% → 99.5%

Time: 8.5s

Alternatives: 7

Speedup: 0.5×

• 64.0% 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.1% 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.5% 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) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;\frac{\cosh x\_m \cdot \frac{y\_m}{x\_m}}{z\_m} \leq 5 \cdot 10^{-40}:\\ \;\;\;\;\frac{y\_m}{x\_m \cdot z\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{y\_m}{\frac{z\_m}{\cosh x\_m}}}{x\_m}\\ \end{array}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (*
    x_s
    (if (<= (/ (* (cosh x_m) (/ y_m x_m)) z_m) 5e-40)
      (/ y_m (* x_m z_m))
      (/ (/ y_m (/ z_m (cosh x_m))) x_m))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (((cosh(x_m) * (y_m / x_m)) / z_m) <= 5e-40) {
		tmp = y_m / (x_m * z_m);
	} else {
		tmp = (y_m / (z_m / cosh(x_m))) / x_m;
	}
	return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m)
    real(8), intent (in) :: z_s
    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_m
    real(8) :: tmp
    if (((cosh(x_m) * (y_m / x_m)) / z_m) <= 5d-40) then
        tmp = y_m / (x_m * z_m)
    else
        tmp = (y_m / (z_m / cosh(x_m))) / x_m
    end if
    code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (((Math.cosh(x_m) * (y_m / x_m)) / z_m) <= 5e-40) {
		tmp = y_m / (x_m * z_m);
	} else {
		tmp = (y_m / (z_m / Math.cosh(x_m))) / x_m;
	}
	return z_s * (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)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, y_s, x_s, x_m, y_m, z_m):
	tmp = 0
	if ((math.cosh(x_m) * (y_m / x_m)) / z_m) <= 5e-40:
		tmp = y_m / (x_m * z_m)
	else:
		tmp = (y_m / (z_m / math.cosh(x_m))) / x_m
	return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (Float64(Float64(cosh(x_m) * Float64(y_m / x_m)) / z_m) <= 5e-40)
		tmp = Float64(y_m / Float64(x_m * z_m));
	else
		tmp = Float64(Float64(y_m / Float64(z_m / cosh(x_m))) / x_m);
	end
	return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0;
	if (((cosh(x_m) * (y_m / x_m)) / z_m) <= 5e-40)
		tmp = y_m / (x_m * z_m);
	else
		tmp = (y_m / (z_m / cosh(x_m))) / x_m;
	end
	tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[N[(N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision] / z$95$m), $MachinePrecision], 5e-40], N[(y$95$m / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / N[(z$95$m / N[Cosh[x$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (cosh.f64 x) (/.f64 y x)) z) < 4.99999999999999965e-40

   1. Initial program 96.8%

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

      1. *-commutative 96.8%

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

      2. associate-/l* 96.8%

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

   3. Simplified 96.8%

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

   5. Taylor expanded in x around 0 59.5%

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

      1. div-inv 59.5%

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

      2. associate-/l/ 59.5%

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

   7. Applied egg-rr 59.5%

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

   if 4.99999999999999965e-40 < (/.f64 (*.f64 (cosh.f64 x) (/.f64 y x)) z)

   1. Initial program 72.8%

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

      1. associate-/l* 69.0%

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

      2. associate-/l/ 76.5%

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

   3. Simplified 76.5%

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

      1. associate-*r/ 83.4%

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

      2. frac-times 73.5%

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

      3. associate-*r/ 99.9%

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

      4. *-commutative 99.9%

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

      5. clear-num 99.9%

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

      6. un-div-inv 99.9%

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

   6. Applied egg-rr 99.9%

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

4. Final simplification 80.2%

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

Alternative 2: 88.1% 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) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;\frac{\cosh x\_m \cdot \frac{y\_m}{x\_m}}{z\_m} \leq \infty:\\ \;\;\;\;\frac{y\_m}{x\_m} \cdot \frac{\cosh x\_m}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;\cosh x\_m \cdot \frac{y\_m}{x\_m \cdot z\_m}\\ \end{array}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (*
    x_s
    (if (<= (/ (* (cosh x_m) (/ y_m x_m)) z_m) INFINITY)
      (* (/ y_m x_m) (/ (cosh x_m) z_m))
      (* (cosh x_m) (/ y_m (* x_m z_m))))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (((cosh(x_m) * (y_m / x_m)) / z_m) <= ((double) INFINITY)) {
		tmp = (y_m / x_m) * (cosh(x_m) / z_m);
	} else {
		tmp = cosh(x_m) * (y_m / (x_m * z_m));
	}
	return z_s * (y_s * (x_s * tmp));
}

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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (((Math.cosh(x_m) * (y_m / x_m)) / z_m) <= Double.POSITIVE_INFINITY) {
		tmp = (y_m / x_m) * (Math.cosh(x_m) / z_m);
	} else {
		tmp = Math.cosh(x_m) * (y_m / (x_m * z_m));
	}
	return z_s * (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)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, y_s, x_s, x_m, y_m, z_m):
	tmp = 0
	if ((math.cosh(x_m) * (y_m / x_m)) / z_m) <= math.inf:
		tmp = (y_m / x_m) * (math.cosh(x_m) / z_m)
	else:
		tmp = math.cosh(x_m) * (y_m / (x_m * z_m))
	return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (Float64(Float64(cosh(x_m) * Float64(y_m / x_m)) / z_m) <= Inf)
		tmp = Float64(Float64(y_m / x_m) * Float64(cosh(x_m) / z_m));
	else
		tmp = Float64(cosh(x_m) * Float64(y_m / Float64(x_m * z_m)));
	end
	return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0;
	if (((cosh(x_m) * (y_m / x_m)) / z_m) <= Inf)
		tmp = (y_m / x_m) * (cosh(x_m) / z_m);
	else
		tmp = cosh(x_m) * (y_m / (x_m * z_m));
	end
	tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[N[(N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision] / z$95$m), $MachinePrecision], Infinity], N[(N[(y$95$m / x$95$m), $MachinePrecision] * N[(N[Cosh[x$95$m], $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision], N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (cosh.f64 x) (/.f64 y x)) z) < +inf.0

   1. Initial program 94.9%

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

      1. *-commutative 94.9%

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

      2. associate-/l* 95.3%

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

   3. Simplified 95.3%

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

   if +inf.0 < (/.f64 (*.f64 (cosh.f64 x) (/.f64 y x)) z)

   1. Initial program 0.0%

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

      1. associate-/l* 0.0%

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

      2. associate-/l/ 46.4%

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

   3. Simplified 46.4%

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

4. Final simplification 90.0%

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

Alternative 3: 77.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) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \left(\cosh x\_m \cdot \frac{y\_m}{x\_m \cdot z\_m}\right)\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (* z_s (* y_s (* x_s (* (cosh x_m) (/ y_m (* x_m z_m)))))))

C

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

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m)
    real(8), intent (in) :: z_s
    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_m
    code = z_s * (y_s * (x_s * (cosh(x_m) * (y_m / (x_m * z_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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	return z_s * (y_s * (x_s * (Math.cosh(x_m) * (y_m / (x_m * z_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)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, y_s, x_s, x_m, y_m, z_m):
	return z_s * (y_s * (x_s * (math.cosh(x_m) * (y_m / (x_m * z_m)))))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, y_s, x_s, x_m, y_m, z_m)
	return Float64(z_s * Float64(y_s * Float64(x_s * Float64(cosh(x_m) * Float64(y_m / Float64(x_m * z_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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = z_s * (y_s * (x_s * (cosh(x_m) * (y_m / (x_m * z_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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.5%

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

   1. associate-/l* 80.2%

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

   2. associate-/l/ 80.5%

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

3. Simplified 80.5%

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

5. Final simplification 80.5%

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

Alternative 4: 56.1% accurate, 8.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) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 3.8 \cdot 10^{-49}:\\ \;\;\;\;\frac{y\_m \cdot \frac{1}{z\_m}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{y\_m}{x\_m \cdot z\_m}\\ \end{array}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (*
    x_s
    (if (<= z_m 3.8e-49) (/ (* y_m (/ 1.0 z_m)) x_m) (/ y_m (* x_m z_m)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 3.8e-49) {
		tmp = (y_m * (1.0 / z_m)) / x_m;
	} else {
		tmp = y_m / (x_m * z_m);
	}
	return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m)
    real(8), intent (in) :: z_s
    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_m
    real(8) :: tmp
    if (z_m <= 3.8d-49) then
        tmp = (y_m * (1.0d0 / z_m)) / x_m
    else
        tmp = y_m / (x_m * z_m)
    end if
    code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 3.8e-49) {
		tmp = (y_m * (1.0 / z_m)) / x_m;
	} else {
		tmp = y_m / (x_m * z_m);
	}
	return z_s * (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)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, y_s, x_s, x_m, y_m, z_m):
	tmp = 0
	if z_m <= 3.8e-49:
		tmp = (y_m * (1.0 / z_m)) / x_m
	else:
		tmp = y_m / (x_m * z_m)
	return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (z_m <= 3.8e-49)
		tmp = Float64(Float64(y_m * Float64(1.0 / z_m)) / x_m);
	else
		tmp = Float64(y_m / Float64(x_m * z_m));
	end
	return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0;
	if (z_m <= 3.8e-49)
		tmp = (y_m * (1.0 / z_m)) / x_m;
	else
		tmp = y_m / (x_m * z_m);
	end
	tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 3.8e-49], N[(N[(y$95$m * N[(1.0 / z$95$m), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision], N[(y$95$m / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 3.7999999999999997e-49

   1. Initial program 85.4%

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

   3. Taylor expanded in x around 0 49.8%

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

      1. associate-/l/ 48.3%

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

      2. clear-num 48.1%

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

      3. associate-/r/ 47.7%

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

   5. Applied egg-rr 47.7%

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

      1. associate-/r* 48.3%

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

      2. associate-*l/ 55.5%

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

   7. Applied egg-rr 55.5%

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

   if 3.7999999999999997e-49 < z

   1. Initial program 82.4%

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

      1. *-commutative 82.4%

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

      2. associate-/l* 83.6%

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

   3. Simplified 83.6%

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

   5. Taylor expanded in x around 0 43.1%

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

      1. div-inv 43.2%

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

      2. associate-/l/ 49.6%

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

   7. Applied egg-rr 49.6%

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

4. Final simplification 53.8%

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

Alternative 5: 51.6% 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) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;y\_m \leq 1.5 \cdot 10^{+124}:\\ \;\;\;\;\frac{\frac{y\_m}{x\_m}}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{y\_m}{x\_m \cdot z\_m}\\ \end{array}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (* x_s (if (<= y_m 1.5e+124) (/ (/ y_m x_m) z_m) (/ y_m (* x_m z_m)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (y_m <= 1.5e+124) {
		tmp = (y_m / x_m) / z_m;
	} else {
		tmp = y_m / (x_m * z_m);
	}
	return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m)
    real(8), intent (in) :: z_s
    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_m
    real(8) :: tmp
    if (y_m <= 1.5d+124) then
        tmp = (y_m / x_m) / z_m
    else
        tmp = y_m / (x_m * z_m)
    end if
    code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (y_m <= 1.5e+124) {
		tmp = (y_m / x_m) / z_m;
	} else {
		tmp = y_m / (x_m * z_m);
	}
	return z_s * (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)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, y_s, x_s, x_m, y_m, z_m):
	tmp = 0
	if y_m <= 1.5e+124:
		tmp = (y_m / x_m) / z_m
	else:
		tmp = y_m / (x_m * z_m)
	return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (y_m <= 1.5e+124)
		tmp = Float64(Float64(y_m / x_m) / z_m);
	else
		tmp = Float64(y_m / Float64(x_m * z_m));
	end
	return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0;
	if (y_m <= 1.5e+124)
		tmp = (y_m / x_m) / z_m;
	else
		tmp = y_m / (x_m * z_m);
	end
	tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[y$95$m, 1.5e+124], N[(N[(y$95$m / x$95$m), $MachinePrecision] / z$95$m), $MachinePrecision], N[(y$95$m / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.5e124

   1. Initial program 86.1%

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

   3. Taylor expanded in x around 0 49.6%

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

   if 1.5e124 < y

   1. Initial program 76.0%

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

      1. *-commutative 76.0%

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

      2. associate-/l* 76.0%

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

   3. Simplified 76.0%

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

   5. Taylor expanded in x around 0 38.8%

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

      1. div-inv 38.8%

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

      2. associate-/l/ 62.6%

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

   7. Applied egg-rr 62.6%

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

4. Final simplification 51.6%

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

Alternative 6: 56.0% 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) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 3.2 \cdot 10^{-49}:\\ \;\;\;\;\frac{\frac{y\_m}{z\_m}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{y\_m}{x\_m \cdot z\_m}\\ \end{array}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (* x_s (if (<= z_m 3.2e-49) (/ (/ y_m z_m) x_m) (/ y_m (* x_m z_m)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 3.2e-49) {
		tmp = (y_m / z_m) / x_m;
	} else {
		tmp = y_m / (x_m * z_m);
	}
	return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m)
    real(8), intent (in) :: z_s
    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_m
    real(8) :: tmp
    if (z_m <= 3.2d-49) then
        tmp = (y_m / z_m) / x_m
    else
        tmp = y_m / (x_m * z_m)
    end if
    code = z_s * (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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	double tmp;
	if (z_m <= 3.2e-49) {
		tmp = (y_m / z_m) / x_m;
	} else {
		tmp = y_m / (x_m * z_m);
	}
	return z_s * (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)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, y_s, x_s, x_m, y_m, z_m):
	tmp = 0
	if z_m <= 3.2e-49:
		tmp = (y_m / z_m) / x_m
	else:
		tmp = y_m / (x_m * z_m)
	return z_s * (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)
z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0
	if (z_m <= 3.2e-49)
		tmp = Float64(Float64(y_m / z_m) / x_m);
	else
		tmp = Float64(y_m / Float64(x_m * z_m));
	end
	return Float64(z_s * 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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = 0.0;
	if (z_m <= 3.2e-49)
		tmp = (y_m / z_m) / x_m;
	else
		tmp = y_m / (x_m * z_m);
	end
	tmp_2 = z_s * (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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[z$95$m, 3.2e-49], N[(N[(y$95$m / z$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(y$95$m / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 3.20000000000000002e-49

   1. Initial program 85.4%

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

      1. associate-/l* 82.1%

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

      2. associate-/l/ 84.4%

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

   3. Simplified 84.4%

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

      1. associate-*r/ 89.3%

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

      2. frac-times 85.4%

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

      3. associate-*r/ 97.8%

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

      4. *-commutative 97.8%

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

      5. clear-num 97.8%

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

      6. un-div-inv 97.8%

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

   6. Applied egg-rr 97.8%

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

   7. Taylor expanded in x around 0 55.0%

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

   if 3.20000000000000002e-49 < z

   1. Initial program 82.4%

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

      1. *-commutative 82.4%

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

      2. associate-/l* 83.6%

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

   3. Simplified 83.6%

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

   5. Taylor expanded in x around 0 43.1%

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

      1. div-inv 43.2%

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

      2. associate-/l/ 49.6%

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

   7. Applied egg-rr 49.6%

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

4. Final simplification 53.5%

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

Alternative 7: 48.6% 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) \\ z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \frac{y\_m}{x\_m \cdot z\_m}\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (* z_s (* y_s (* x_s (/ y_m (* x_m z_m))))))

C

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

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
y\_m = abs(y)
y\_s = copysign(1.0d0, y)
z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, y_s, x_s, x_m, y_m, z_m)
    real(8), intent (in) :: z_s
    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_m
    code = z_s * (y_s * (x_s * (y_m / (x_m * z_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);
z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double y_s, double x_s, double x_m, double y_m, double z_m) {
	return z_s * (y_s * (x_s * (y_m / (x_m * z_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)
z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, y_s, x_s, x_m, y_m, z_m):
	return z_s * (y_s * (x_s * (y_m / (x_m * z_m))))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, y_s, x_s, x_m, y_m, z_m)
	return Float64(z_s * Float64(y_s * Float64(x_s * Float64(y_m / Float64(x_m * z_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);
z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp = code(z_s, y_s, x_s, x_m, y_m, z_m)
	tmp = z_s * (y_s * (x_s * (y_m / (x_m * z_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]
z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, y$95$s_, x$95$s_, x$95$m_, y$95$m_, z$95$m_] := N[(z$95$s * N[(y$95$s * N[(x$95$s * N[(y$95$m / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.5%

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

   1. *-commutative 84.5%

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

   2. associate-/l* 84.9%

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

3. Simplified 84.9%

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

5. Taylor expanded in x around 0 47.9%

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

   1. div-inv 47.9%

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

   2. associate-/l/ 48.6%

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

7. Applied egg-rr 48.6%

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

8. Final simplification 48.6%

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

Developer target: 97.3% 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 2024067 
(FPCore (x y z)
  :name "Linear.Quaternion:$ctan from linear-1.19.1.3"
  :precision binary64

  :alt
  (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))