Linear.Quaternion:$ctan from linear-1.19.1.3

Percentage Accurate: 84.4% → 99.8%

Time: 9.0s

Alternatives: 10

Speedup: 1.0×

• 64.4% 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.4% 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) \\ 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 4 \cdot 10^{+24}:\\ \;\;\;\;\cosh x\_m \cdot \frac{y\_m}{x\_m \cdot z\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\cosh x\_m \cdot y\_m}{z\_m}}{x\_m}\\ \end{array}\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)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 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) 4e+24)
      (* (cosh x_m) (/ y_m (* x_m z_m)))
      (/ (/ (* (cosh x_m) y_m) z_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) <= 4e+24) {
		tmp = cosh(x_m) * (y_m / (x_m * z_m));
	} else {
		tmp = ((cosh(x_m) * y_m) / z_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) <= 4d+24) then
        tmp = cosh(x_m) * (y_m / (x_m * z_m))
    else
        tmp = ((cosh(x_m) * y_m) / z_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) <= 4e+24) {
		tmp = Math.cosh(x_m) * (y_m / (x_m * z_m));
	} else {
		tmp = ((Math.cosh(x_m) * y_m) / z_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) <= 4e+24:
		tmp = math.cosh(x_m) * (y_m / (x_m * z_m))
	else:
		tmp = ((math.cosh(x_m) * y_m) / z_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) <= 4e+24)
		tmp = Float64(cosh(x_m) * Float64(y_m / Float64(x_m * z_m)));
	else
		tmp = Float64(Float64(Float64(cosh(x_m) * y_m) / z_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) <= 4e+24)
		tmp = cosh(x_m) * (y_m / (x_m * z_m));
	else
		tmp = ((cosh(x_m) * y_m) / z_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], 4e+24], N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Cosh[x$95$m], $MachinePrecision] * y$95$m), $MachinePrecision] / z$95$m), $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) < 3.9999999999999999e24

   1. Initial program 98.3%

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

      1. associate-/l* 95.3%

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

      2. associate-/l/ 90.3%

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

   3. Simplified 90.3%

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

   if 3.9999999999999999e24 < (/.f64 (*.f64 (cosh.f64 x) (/.f64 y x)) z)

   1. Initial program 70.6%

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

      1. *-commutative 70.6%

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

      2. associate-*l/ 93.2%

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

      3. associate-/l* 93.2%

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

      4. associate-/l* 96.1%

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

      5. associate-/r* 81.5%

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

   3. Simplified 81.5%

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

      1. associate-*r/ 81.6%

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

      2. *-commutative 81.6%

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

      3. *-commutative 81.6%

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

      4. associate-/r* 100.0%

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

   6. Applied egg-rr 100.0%

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

4. Final simplification 95.0%

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

Alternative 2: 91.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) \\ z_m = \left|z\right| \\ z_s = \mathsf{copysign}\left(1, z\right) \\ \begin{array}{l} t_0 := \frac{\cosh x\_m \cdot \frac{y\_m}{x\_m}}{z\_m}\\ z\_s \cdot \left(y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq \infty:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \frac{\cosh x\_m}{x\_m \cdot z\_m}\\ \end{array}\right)\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)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (let* ((t_0 (/ (* (cosh x_m) (/ y_m x_m)) z_m)))
   (*
    z_s
    (*
     y_s
     (* x_s (if (<= t_0 INFINITY) t_0 (* y_m (/ (cosh x_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 t_0 = (cosh(x_m) * (y_m / x_m)) / z_m;
	double tmp;
	if (t_0 <= ((double) INFINITY)) {
		tmp = t_0;
	} else {
		tmp = y_m * (cosh(x_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 t_0 = (Math.cosh(x_m) * (y_m / x_m)) / z_m;
	double tmp;
	if (t_0 <= Double.POSITIVE_INFINITY) {
		tmp = t_0;
	} else {
		tmp = y_m * (Math.cosh(x_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):
	t_0 = (math.cosh(x_m) * (y_m / x_m)) / z_m
	tmp = 0
	if t_0 <= math.inf:
		tmp = t_0
	else:
		tmp = y_m * (math.cosh(x_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)
	t_0 = Float64(Float64(cosh(x_m) * Float64(y_m / x_m)) / z_m)
	tmp = 0.0
	if (t_0 <= Inf)
		tmp = t_0;
	else
		tmp = Float64(y_m * Float64(cosh(x_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)
	t_0 = (cosh(x_m) * (y_m / x_m)) / z_m;
	tmp = 0.0;
	if (t_0 <= Inf)
		tmp = t_0;
	else
		tmp = y_m * (cosh(x_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_] := Block[{t$95$0 = N[(N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision] / z$95$m), $MachinePrecision]}, N[(z$95$s * N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, Infinity], t$95$0, N[(y$95$m * N[(N[Cosh[x$95$m], $MachinePrecision] / 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 95.3%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]
   2. 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. *-commutative 0.0%

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

      2. associate-*l/ 100.0%

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

      3. associate-/l* 100.0%

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

      4. associate-/l* 100.0%

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

      5. associate-/r* 75.0%

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

   3. Simplified 75.0%

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

4. Final simplification 93.1%

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

Alternative 3: 86.6% 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 \begin{array}{l} \mathbf{if}\;y\_m \leq 6.5 \cdot 10^{-208}:\\ \;\;\;\;y\_m \cdot \frac{\cosh x\_m}{x\_m \cdot z\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{y\_m}{x\_m} \cdot \frac{\cosh x\_m}{z\_m}\\ \end{array}\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)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 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 6.5e-208)
      (* y_m (/ (cosh x_m) (* x_m z_m)))
      (* (/ y_m x_m) (/ (cosh 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 <= 6.5e-208) {
		tmp = y_m * (cosh(x_m) / (x_m * z_m));
	} else {
		tmp = (y_m / x_m) * (cosh(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 <= 6.5d-208) then
        tmp = y_m * (cosh(x_m) / (x_m * z_m))
    else
        tmp = (y_m / x_m) * (cosh(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 <= 6.5e-208) {
		tmp = y_m * (Math.cosh(x_m) / (x_m * z_m));
	} else {
		tmp = (y_m / x_m) * (Math.cosh(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 <= 6.5e-208:
		tmp = y_m * (math.cosh(x_m) / (x_m * z_m))
	else:
		tmp = (y_m / x_m) * (math.cosh(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 <= 6.5e-208)
		tmp = Float64(y_m * Float64(cosh(x_m) / Float64(x_m * z_m)));
	else
		tmp = Float64(Float64(y_m / x_m) * Float64(cosh(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 <= 6.5e-208)
		tmp = y_m * (cosh(x_m) / (x_m * z_m));
	else
		tmp = (y_m / x_m) * (cosh(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, 6.5e-208], N[(y$95$m * N[(N[Cosh[x$95$m], $MachinePrecision] / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / x$95$m), $MachinePrecision] * N[(N[Cosh[x$95$m], $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 6.4999999999999998e-208

   1. Initial program 79.4%

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

      1. *-commutative 79.4%

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

      2. associate-*l/ 94.7%

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

      3. associate-/l* 94.7%

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

      4. associate-/l* 96.0%

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

      5. associate-/r* 86.9%

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

   3. Simplified 86.9%

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

   if 6.4999999999999998e-208 < y

   1. Initial program 92.0%

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

      1. associate-*r/ 97.4%

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

      2. associate-/l/ 85.8%

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

      3. times-frac 91.9%

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

   4. Applied egg-rr 91.9%

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

4. Final simplification 89.1%

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

Alternative 4: 83.3% 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(y\_m \cdot \frac{\cosh x\_m}{x\_m \cdot z\_m}\right)\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)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (* z_s (* y_s (* x_s (* y_m (/ (cosh x_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 * (cosh(x_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 * (cosh(x_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 * (Math.cosh(x_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 * (math.cosh(x_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(cosh(x_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 * (cosh(x_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[(N[Cosh[x$95$m], $MachinePrecision] / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 84.9%

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

   1. *-commutative 84.9%

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

   2. associate-*l/ 95.9%

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

   3. associate-/l* 95.8%

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

   4. associate-/l* 96.1%

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

   5. associate-/r* 86.4%

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

3. Simplified 86.4%

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

5. Final simplification 86.4%

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

Alternative 5: 65.8% 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) \\ 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}\;x\_m \leq 1.82 \cdot 10^{-183}:\\ \;\;\;\;\frac{\frac{y\_m}{z\_m}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \left(0.5 \cdot \frac{x\_m}{z\_m} + \frac{1}{x\_m \cdot z\_m}\right)\\ \end{array}\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)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (*
    x_s
    (if (<= x_m 1.82e-183)
      (/ (/ y_m z_m) x_m)
      (* y_m (+ (* 0.5 (/ x_m z_m)) (/ 1.0 (* 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 (x_m <= 1.82e-183) {
		tmp = (y_m / z_m) / x_m;
	} else {
		tmp = y_m * ((0.5 * (x_m / z_m)) + (1.0 / (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 (x_m <= 1.82d-183) then
        tmp = (y_m / z_m) / x_m
    else
        tmp = y_m * ((0.5d0 * (x_m / z_m)) + (1.0d0 / (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 (x_m <= 1.82e-183) {
		tmp = (y_m / z_m) / x_m;
	} else {
		tmp = y_m * ((0.5 * (x_m / z_m)) + (1.0 / (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 x_m <= 1.82e-183:
		tmp = (y_m / z_m) / x_m
	else:
		tmp = y_m * ((0.5 * (x_m / z_m)) + (1.0 / (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 (x_m <= 1.82e-183)
		tmp = Float64(Float64(y_m / z_m) / x_m);
	else
		tmp = Float64(y_m * Float64(Float64(0.5 * Float64(x_m / z_m)) + Float64(1.0 / 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 (x_m <= 1.82e-183)
		tmp = (y_m / z_m) / x_m;
	else
		tmp = y_m * ((0.5 * (x_m / z_m)) + (1.0 / (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[x$95$m, 1.82e-183], N[(N[(y$95$m / z$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(y$95$m * N[(N[(0.5 * N[(x$95$m / z$95$m), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(x$95$m * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.82e-183

   1. Initial program 87.6%

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

      1. *-commutative 87.6%

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

      2. associate-*l/ 95.2%

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

      3. associate-/l* 95.1%

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

      4. associate-/l* 94.5%

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

      5. associate-/r* 88.9%

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

   3. Simplified 88.9%

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

   5. Taylor expanded in x around 0 60.1%

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

      1. div-inv 60.2%

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

      2. *-commutative 60.2%

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

      3. associate-/r* 66.7%

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

   7. Applied egg-rr 66.7%

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

   if 1.82e-183 < x

   1. Initial program 80.5%

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

      1. *-commutative 80.5%

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

      2. associate-*l/ 97.0%

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

      3. associate-/l* 96.9%

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

      4. associate-/l* 98.9%

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

      5. associate-/r* 82.3%

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

   3. Simplified 82.3%

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

   5. Taylor expanded in x around 0 60.2%

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

4. Final simplification 64.3%

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

Alternative 6: 61.5% 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}\;x\_m \leq 1.4:\\ \;\;\;\;\frac{\frac{y\_m}{z\_m}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \frac{y\_m}{z\_m \cdot 2}\\ \end{array}\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)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (* x_s (if (<= x_m 1.4) (/ (/ y_m z_m) x_m) (* x_m (/ y_m (* z_m 2.0))))))))

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 (x_m <= 1.4) {
		tmp = (y_m / z_m) / x_m;
	} else {
		tmp = x_m * (y_m / (z_m * 2.0));
	}
	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 (x_m <= 1.4d0) then
        tmp = (y_m / z_m) / x_m
    else
        tmp = x_m * (y_m / (z_m * 2.0d0))
    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 (x_m <= 1.4) {
		tmp = (y_m / z_m) / x_m;
	} else {
		tmp = x_m * (y_m / (z_m * 2.0));
	}
	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 x_m <= 1.4:
		tmp = (y_m / z_m) / x_m
	else:
		tmp = x_m * (y_m / (z_m * 2.0))
	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 (x_m <= 1.4)
		tmp = Float64(Float64(y_m / z_m) / x_m);
	else
		tmp = Float64(x_m * Float64(y_m / Float64(z_m * 2.0)));
	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 (x_m <= 1.4)
		tmp = (y_m / z_m) / x_m;
	else
		tmp = x_m * (y_m / (z_m * 2.0));
	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[x$95$m, 1.4], N[(N[(y$95$m / z$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(x$95$m * N[(y$95$m / N[(z$95$m * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.3999999999999999

   1. Initial program 88.5%

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

      1. *-commutative 88.5%

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

      2. associate-*l/ 94.6%

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

      3. associate-/l* 94.5%

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

      4. associate-/l* 95.0%

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

      5. associate-/r* 90.4%

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

   3. Simplified 90.4%

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

   5. Taylor expanded in x around 0 66.4%

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

      1. div-inv 66.5%

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

      2. *-commutative 66.5%

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

      3. associate-/r* 71.0%

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

   7. Applied egg-rr 71.0%

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

   if 1.3999999999999999 < x

   1. Initial program 73.3%

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

   3. Taylor expanded in x around 0 36.0%

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

   4. Taylor expanded in x around inf 36.0%

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

      1. associate-*r/ 36.0%

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

      2. *-commutative 36.0%

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

      3. associate-/l* 36.0%

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

      4. *-commutative 36.0%

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

   6. Simplified 36.0%

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

      1. clear-num 36.0%

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

      2. un-div-inv 36.0%

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

      3. *-commutative 36.0%

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

      4. div-inv 36.0%

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

      5. metadata-eval 36.0%

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

   8. Applied egg-rr 36.0%

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

      1. associate-/l* 29.7%

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

   10. Simplified 29.7%

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

4. Final simplification 61.4%

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

Alternative 7: 65.5% 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}\;x\_m \leq 1.4:\\ \;\;\;\;\frac{\frac{y\_m}{z\_m}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \left(x\_m \cdot \frac{0.5}{z\_m}\right)\\ \end{array}\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)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 z)
(FPCore (z_s y_s x_s x_m y_m z_m)
 :precision binary64
 (*
  z_s
  (*
   y_s
   (* x_s (if (<= x_m 1.4) (/ (/ y_m z_m) x_m) (* y_m (* x_m (/ 0.5 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 (x_m <= 1.4) {
		tmp = (y_m / z_m) / x_m;
	} else {
		tmp = y_m * (x_m * (0.5 / 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 (x_m <= 1.4d0) then
        tmp = (y_m / z_m) / x_m
    else
        tmp = y_m * (x_m * (0.5d0 / 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 (x_m <= 1.4) {
		tmp = (y_m / z_m) / x_m;
	} else {
		tmp = y_m * (x_m * (0.5 / 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 x_m <= 1.4:
		tmp = (y_m / z_m) / x_m
	else:
		tmp = y_m * (x_m * (0.5 / 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 (x_m <= 1.4)
		tmp = Float64(Float64(y_m / z_m) / x_m);
	else
		tmp = Float64(y_m * Float64(x_m * Float64(0.5 / 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 (x_m <= 1.4)
		tmp = (y_m / z_m) / x_m;
	else
		tmp = y_m * (x_m * (0.5 / 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[x$95$m, 1.4], N[(N[(y$95$m / z$95$m), $MachinePrecision] / x$95$m), $MachinePrecision], N[(y$95$m * N[(x$95$m * N[(0.5 / z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.3999999999999999

   1. Initial program 88.5%

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

      1. *-commutative 88.5%

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

      2. associate-*l/ 94.6%

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

      3. associate-/l* 94.5%

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

      4. associate-/l* 95.0%

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

      5. associate-/r* 90.4%

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

   3. Simplified 90.4%

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

   5. Taylor expanded in x around 0 66.4%

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

      1. div-inv 66.5%

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

      2. *-commutative 66.5%

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

      3. associate-/r* 71.0%

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

   7. Applied egg-rr 71.0%

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

   if 1.3999999999999999 < x

   1. Initial program 73.3%

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

   3. Taylor expanded in x around 0 36.0%

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

   4. Taylor expanded in x around inf 36.0%

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

      1. associate-*r/ 36.0%

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

      2. *-commutative 36.0%

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

      3. associate-/l* 36.0%

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

      4. *-commutative 36.0%

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

   6. Simplified 36.0%

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

   7. Taylor expanded in y around 0 36.0%

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

      1. associate-*r/ 36.0%

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

      2. *-commutative 36.0%

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

      3. associate-*r/ 36.0%

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

      4. *-commutative 36.0%

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

      5. associate-*r* 39.2%

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

   9. Simplified 39.2%

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

4. Final simplification 63.6%

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

Alternative 8: 52.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) \\ 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 \cdot 10^{-49}:\\ \;\;\;\;\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 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 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 3e-49) (/ (/ 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 (z_m <= 3e-49) {
		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 (z_m <= 3d-49) 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 (z_m <= 3e-49) {
		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 z_m <= 3e-49:
		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 (z_m <= 3e-49)
		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 (z_m <= 3e-49)
		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[z$95$m, 3e-49], 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 z < 3e-49

   1. Initial program 87.5%

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

   3. Taylor expanded in x around 0 54.3%

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

   if 3e-49 < z

   1. Initial program 79.2%

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

      1. *-commutative 79.2%

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

      2. associate-*l/ 91.7%

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

      3. associate-/l* 91.7%

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

      4. associate-/l* 99.7%

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

      5. associate-/r* 79.7%

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

   3. Simplified 79.7%

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

   5. Taylor expanded in x around 0 53.4%

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

4. Final simplification 54.0%

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

Alternative 9: 56.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) \\ 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 9.2 \cdot 10^{+27}:\\ \;\;\;\;\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 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 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 9.2e+27) (/ (/ 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 <= 9.2e+27) {
		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 <= 9.2d+27) 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 <= 9.2e+27) {
		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 <= 9.2e+27:
		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 <= 9.2e+27)
		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 <= 9.2e+27)
		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, 9.2e+27], 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 < 9.2000000000000002e27

   1. Initial program 86.6%

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

      1. *-commutative 86.6%

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

      2. associate-*l/ 97.9%

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

      3. associate-/l* 97.8%

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

      4. associate-/l* 95.0%

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

      5. associate-/r* 90.4%

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

   3. Simplified 90.4%

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

   5. Taylor expanded in x around 0 51.8%

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

      1. div-inv 51.9%

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

      2. *-commutative 51.9%

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

      3. associate-/r* 61.1%

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

   7. Applied egg-rr 61.1%

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

   if 9.2000000000000002e27 < z

   1. Initial program 79.6%

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

      1. *-commutative 79.6%

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

      2. associate-*l/ 89.4%

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

      3. associate-/l* 89.4%

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

      4. associate-/l* 99.7%

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

      5. associate-/r* 73.9%

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

   3. Simplified 73.9%

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

   5. Taylor expanded in x around 0 51.9%

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

4. Final simplification 58.9%

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

Alternative 10: 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) \\ 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 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
z_m = (fabs.f64 z)
z_s = (copysign.f64 1 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.9%

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

   1. *-commutative 84.9%

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

   2. associate-*l/ 95.9%

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

   3. associate-/l* 95.8%

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

   4. associate-/l* 96.1%

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

   5. associate-/r* 86.4%

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

3. Simplified 86.4%

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

5. Taylor expanded in x around 0 51.9%

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

6. Final simplification 51.9%

   \[\leadsto \frac{y}{x \cdot z} \]
7. 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 2024039 
(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))