Linear.Quaternion:$ctanh from linear-1.19.1.3

Percentage Accurate: 96.3% → 99.8%

Time: 7.9s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x * (sin(y) / y)) / 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 = (x * (sin(y) / y)) / z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 96.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x * (sin(y) / y)) / 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 = (x * (sin(y) / y)) / z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 10^{-11}:\\ \;\;\;\;\frac{x}{z\_m \cdot \frac{y}{\sin y}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \frac{\sin y}{y}}{z\_m}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (*
  z_s
  (if (<= z_m 1e-11) (/ x (* z_m (/ y (sin y)))) (/ (* x (/ (sin y) y)) z_m))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (z_m <= 1e-11) {
		tmp = x / (z_m * (y / sin(y)));
	} else {
		tmp = (x * (sin(y) / y)) / z_m;
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (z_m <= 1d-11) then
        tmp = x / (z_m * (y / sin(y)))
    else
        tmp = (x * (sin(y) / y)) / z_m
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (z_m <= 1e-11) {
		tmp = x / (z_m * (y / Math.sin(y)));
	} else {
		tmp = (x * (Math.sin(y) / y)) / z_m;
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	tmp = 0
	if z_m <= 1e-11:
		tmp = x / (z_m * (y / math.sin(y)))
	else:
		tmp = (x * (math.sin(y) / y)) / z_m
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	tmp = 0.0
	if (z_m <= 1e-11)
		tmp = Float64(x / Float64(z_m * Float64(y / sin(y))));
	else
		tmp = Float64(Float64(x * Float64(sin(y) / y)) / z_m);
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	tmp = 0.0;
	if (z_m <= 1e-11)
		tmp = x / (z_m * (y / sin(y)));
	else
		tmp = (x * (sin(y) / y)) / z_m;
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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_, x_, y_, z$95$m_] := N[(z$95$s * If[LessEqual[z$95$m, 1e-11], N[(x / N[(z$95$m * N[(y / N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / z$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 9.99999999999999939e-12

   1. Initial program 94.6%

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

      1. associate-/l* 97.8%

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

      2. associate-/l/ 86.1%

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

      3. *-commutative 86.1%

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

   3. Simplified 86.1%

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

      1. associate-/r* 97.8%

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

      2. clear-num 97.0%

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

      3. un-div-inv 97.2%

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

      4. div-inv 97.2%

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

      5. clear-num 97.3%

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

   6. Applied egg-rr 97.3%

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

   if 9.99999999999999939e-12 < z

   1. Initial program 99.9%

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

Alternative 2: 76.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq 1.45 \cdot 10^{-28}:\\ \;\;\;\;\frac{x}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{\sin y}{z\_m \cdot y}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 1.45e-28) (/ x z_m) (* x (/ (sin y) (* z_m y))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 1.45e-28) {
		tmp = x / z_m;
	} else {
		tmp = x * (sin(y) / (z_m * y));
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (y <= 1.45d-28) then
        tmp = x / z_m
    else
        tmp = x * (sin(y) / (z_m * y))
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 1.45e-28) {
		tmp = x / z_m;
	} else {
		tmp = x * (Math.sin(y) / (z_m * y));
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	tmp = 0
	if y <= 1.45e-28:
		tmp = x / z_m
	else:
		tmp = x * (math.sin(y) / (z_m * y))
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	tmp = 0.0
	if (y <= 1.45e-28)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(x * Float64(sin(y) / Float64(z_m * y)));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	tmp = 0.0;
	if (y <= 1.45e-28)
		tmp = x / z_m;
	else
		tmp = x * (sin(y) / (z_m * y));
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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_, x_, y_, z$95$m_] := N[(z$95$s * If[LessEqual[y, 1.45e-28], N[(x / z$95$m), $MachinePrecision], N[(x * N[(N[Sin[y], $MachinePrecision] / N[(z$95$m * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.45000000000000006e-28

   1. Initial program 97.7%

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

      1. associate-/l* 96.1%

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

      2. associate-/l/ 85.5%

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

      3. *-commutative 85.5%

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

   3. Simplified 85.5%

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

   5. Taylor expanded in y around 0 68.0%

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

   if 1.45000000000000006e-28 < y

   1. Initial program 91.3%

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

      1. associate-/l* 96.4%

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

      2. associate-/l/ 95.2%

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

      3. *-commutative 95.2%

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

   3. Simplified 95.2%

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

4. Final simplification 74.5%

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

Alternative 3: 95.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \left(x \cdot \frac{\frac{\sin y}{y}}{z\_m}\right) \end{array} \]

FPCore

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

C

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

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    code = z_s * (x * ((sin(y) / y) / z_m))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	return z_s * (x * ((Math.sin(y) / y) / z_m));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	return z_s * (x * ((math.sin(y) / y) / z_m))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	return Float64(z_s * Float64(x * Float64(Float64(sin(y) / y) / z_m)))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp = code(z_s, x, y, z_m)
	tmp = z_s * (x * ((sin(y) / y) / z_m));
end

Wolfram

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_, x_, y_, z$95$m_] := N[(z$95$s * N[(x * N[(N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 96.1%

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

   1. associate-/l* 96.2%

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

3. Simplified 96.2%

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

Alternative 4: 61.9% accurate, 8.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq 2.3 \cdot 10^{+64}:\\ \;\;\;\;\frac{x}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{z\_m \cdot \frac{y}{x}}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 2.3e+64) (/ x z_m) (/ y (* z_m (/ y x))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 2.3e+64) {
		tmp = x / z_m;
	} else {
		tmp = y / (z_m * (y / x));
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (y <= 2.3d+64) then
        tmp = x / z_m
    else
        tmp = y / (z_m * (y / x))
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 2.3e+64) {
		tmp = x / z_m;
	} else {
		tmp = y / (z_m * (y / x));
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	tmp = 0
	if y <= 2.3e+64:
		tmp = x / z_m
	else:
		tmp = y / (z_m * (y / x))
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	tmp = 0.0
	if (y <= 2.3e+64)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(y / Float64(z_m * Float64(y / x)));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	tmp = 0.0;
	if (y <= 2.3e+64)
		tmp = x / z_m;
	else
		tmp = y / (z_m * (y / x));
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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_, x_, y_, z$95$m_] := N[(z$95$s * If[LessEqual[y, 2.3e+64], N[(x / z$95$m), $MachinePrecision], N[(y / N[(z$95$m * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 2.3e64

   1. Initial program 97.4%

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

      1. associate-/l* 96.3%

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

      2. associate-/l/ 86.2%

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

      3. *-commutative 86.2%

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

   3. Simplified 86.2%

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

   5. Taylor expanded in y around 0 67.2%

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

   if 2.3e64 < y

   1. Initial program 91.3%

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

      1. associate-/l* 95.7%

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

      2. associate-/l/ 94.2%

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

      3. *-commutative 94.2%

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

   3. Simplified 94.2%

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

      1. associate-*r/ 94.2%

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

      2. associate-*l/ 94.1%

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

      3. associate-/r* 91.1%

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

      4. *-commutative 91.1%

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

      5. clear-num 91.1%

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

      6. un-div-inv 91.2%

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

      7. div-inv 89.6%

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

      8. clear-num 89.7%

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

   6. Applied egg-rr 89.7%

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

   7. Taylor expanded in y around 0 40.7%

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

Alternative 5: 61.8% accurate, 8.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq 2.3 \cdot 10^{+64}:\\ \;\;\;\;\frac{x}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{\frac{x}{y}}{z\_m}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 2.3e+64) (/ x z_m) (* y (/ (/ x y) z_m)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 2.3e+64) {
		tmp = x / z_m;
	} else {
		tmp = y * ((x / y) / z_m);
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (y <= 2.3d+64) then
        tmp = x / z_m
    else
        tmp = y * ((x / y) / z_m)
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 2.3e+64) {
		tmp = x / z_m;
	} else {
		tmp = y * ((x / y) / z_m);
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	tmp = 0
	if y <= 2.3e+64:
		tmp = x / z_m
	else:
		tmp = y * ((x / y) / z_m)
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	tmp = 0.0
	if (y <= 2.3e+64)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(y * Float64(Float64(x / y) / z_m));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	tmp = 0.0;
	if (y <= 2.3e+64)
		tmp = x / z_m;
	else
		tmp = y * ((x / y) / z_m);
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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_, x_, y_, z$95$m_] := N[(z$95$s * If[LessEqual[y, 2.3e+64], N[(x / z$95$m), $MachinePrecision], N[(y * N[(N[(x / y), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 2.3e64

   1. Initial program 97.4%

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

      1. associate-/l* 96.3%

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

      2. associate-/l/ 86.2%

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

      3. *-commutative 86.2%

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

   3. Simplified 86.2%

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

   5. Taylor expanded in y around 0 67.2%

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

   if 2.3e64 < y

   1. Initial program 91.3%

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

      1. *-commutative 91.3%

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

      2. associate-*l/ 91.3%

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

      3. associate-/l* 91.2%

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

      4. associate-/l* 91.1%

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

   3. Simplified 91.1%

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

   5. Taylor expanded in y around 0 40.7%

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

Alternative 6: 60.0% accurate, 8.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq 5 \cdot 10^{+68}:\\ \;\;\;\;\frac{x}{z\_m}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{y}{z\_m \cdot y}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m)
 :precision binary64
 (* z_s (if (<= y 5e+68) (/ x z_m) (* x (/ y (* z_m y))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 5e+68) {
		tmp = x / z_m;
	} else {
		tmp = x * (y / (z_m * y));
	}
	return z_s * tmp;
}

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8) :: tmp
    if (y <= 5d+68) then
        tmp = x / z_m
    else
        tmp = x * (y / (z_m * y))
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	double tmp;
	if (y <= 5e+68) {
		tmp = x / z_m;
	} else {
		tmp = x * (y / (z_m * y));
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	tmp = 0
	if y <= 5e+68:
		tmp = x / z_m
	else:
		tmp = x * (y / (z_m * y))
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	tmp = 0.0
	if (y <= 5e+68)
		tmp = Float64(x / z_m);
	else
		tmp = Float64(x * Float64(y / Float64(z_m * y)));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m)
	tmp = 0.0;
	if (y <= 5e+68)
		tmp = x / z_m;
	else
		tmp = x * (y / (z_m * y));
	end
	tmp_2 = z_s * tmp;
end

Wolfram

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_, x_, y_, z$95$m_] := N[(z$95$s * If[LessEqual[y, 5e+68], N[(x / z$95$m), $MachinePrecision], N[(x * N[(y / N[(z$95$m * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 5.0000000000000004e68

   1. Initial program 97.4%

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

      1. associate-/l* 96.3%

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

      2. associate-/l/ 86.3%

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

      3. *-commutative 86.3%

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

   3. Simplified 86.3%

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

   5. Taylor expanded in y around 0 66.9%

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

   if 5.0000000000000004e68 < y

   1. Initial program 91.1%

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

      1. associate-/l* 95.7%

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

      2. associate-/l/ 94.1%

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

      3. *-commutative 94.1%

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

   3. Simplified 94.1%

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

   5. Taylor expanded in y around 0 32.6%

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

4. Final simplification 60.2%

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

Alternative 7: 58.0% accurate, 35.7× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \frac{x}{z\_m} \end{array} \]

FPCore

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

C

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

Fortran

z\_m = abs(z)
z\_s = copysign(1.0d0, z)
real(8) function code(z_s, x, y, z_m)
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    code = z_s * (x / z_m)
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m) {
	return z_s * (x / z_m);
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m):
	return z_s * (x / z_m)

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m)
	return Float64(z_s * Float64(x / z_m))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp = code(z_s, x, y, z_m)
	tmp = z_s * (x / z_m);
end

Wolfram

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_, x_, y_, z$95$m_] := N[(z$95$s * N[(x / z$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 96.1%

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

   1. associate-/l* 96.2%

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

   2. associate-/l/ 87.8%

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

   3. *-commutative 87.8%

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

3. Simplified 87.8%

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

5. Taylor expanded in y around 0 57.7%

   \[\leadsto \color{blue}{\frac{x}{z}} \]
6. Add Preprocessing

Developer Target 1: 99.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y}{\sin y}\\ t_1 := \frac{x \cdot \frac{1}{t\_0}}{z}\\ \mathbf{if}\;z < -4.2173720203427147 \cdot 10^{-29}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z < 4.446702369113811 \cdot 10^{+64}:\\ \;\;\;\;\frac{x}{z \cdot t\_0}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ y (sin y))) (t_1 (/ (* x (/ 1.0 t_0)) z)))
   (if (< z -4.2173720203427147e-29)
     t_1
     (if (< z 4.446702369113811e+64) (/ x (* z t_0)) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = y / sin(y);
	double t_1 = (x * (1.0 / t_0)) / z;
	double tmp;
	if (z < -4.2173720203427147e-29) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x / (z * t_0);
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_0 = y / sin(y)
    t_1 = (x * (1.0d0 / t_0)) / z
    if (z < (-4.2173720203427147d-29)) then
        tmp = t_1
    else if (z < 4.446702369113811d+64) then
        tmp = x / (z * t_0)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = y / Math.sin(y);
	double t_1 = (x * (1.0 / t_0)) / z;
	double tmp;
	if (z < -4.2173720203427147e-29) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x / (z * t_0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y / math.sin(y)
	t_1 = (x * (1.0 / t_0)) / z
	tmp = 0
	if z < -4.2173720203427147e-29:
		tmp = t_1
	elif z < 4.446702369113811e+64:
		tmp = x / (z * t_0)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y / sin(y))
	t_1 = Float64(Float64(x * Float64(1.0 / t_0)) / z)
	tmp = 0.0
	if (z < -4.2173720203427147e-29)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = Float64(x / Float64(z * t_0));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y / sin(y);
	t_1 = (x * (1.0 / t_0)) / z;
	tmp = 0.0;
	if (z < -4.2173720203427147e-29)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = x / (z * t_0);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y / N[Sin[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, If[Less[z, -4.2173720203427147e-29], t$95$1, If[Less[z, 4.446702369113811e+64], N[(x / N[(z * t$95$0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< z -42173720203427147/1000000000000000000000000000000000000000000000) (/ (* x (/ 1 (/ y (sin y)))) z) (if (< z 44467023691138110000000000000000000000000000000000000000000000000) (/ x (* z (/ y (sin y)))) (/ (* x (/ 1 (/ y (sin y)))) z))))

  (/ (* x (/ (sin y) y)) z))