Linear.Quaternion:$ctanh from linear-1.19.1.3

Percentage Accurate: 96.2% → 99.5%

Time: 8.5s

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.2% 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.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := \frac{\sin y}{y}\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 3.9 \cdot 10^{+67}:\\ \;\;\;\;t\_0 \cdot \frac{x\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m \cdot t\_0}{z}\\ \end{array} \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (* x_s (if (<= x_m 3.9e+67) (* t_0 (/ x_m z)) (/ (* x_m t_0) z)))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = sin(y) / y;
	double tmp;
	if (x_m <= 3.9e+67) {
		tmp = t_0 * (x_m / z);
	} else {
		tmp = (x_m * t_0) / z;
	}
	return x_s * tmp;
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sin(y) / y
    if (x_m <= 3.9d+67) then
        tmp = t_0 * (x_m / z)
    else
        tmp = (x_m * t_0) / z
    end if
    code = x_s * tmp
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = Math.sin(y) / y;
	double tmp;
	if (x_m <= 3.9e+67) {
		tmp = t_0 * (x_m / z);
	} else {
		tmp = (x_m * t_0) / z;
	}
	return x_s * tmp;
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = math.sin(y) / y
	tmp = 0
	if x_m <= 3.9e+67:
		tmp = t_0 * (x_m / z)
	else:
		tmp = (x_m * t_0) / z
	return x_s * tmp

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(sin(y) / y)
	tmp = 0.0
	if (x_m <= 3.9e+67)
		tmp = Float64(t_0 * Float64(x_m / z));
	else
		tmp = Float64(Float64(x_m * t_0) / z);
	end
	return Float64(x_s * tmp)
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = sin(y) / y;
	tmp = 0.0;
	if (x_m <= 3.9e+67)
		tmp = t_0 * (x_m / z);
	else
		tmp = (x_m * t_0) / z;
	end
	tmp_2 = 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]
code[x$95$s_, x$95$m_, y_, z_] := Block[{t$95$0 = N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]}, N[(x$95$s * If[LessEqual[x$95$m, 3.9e+67], N[(t$95$0 * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], N[(N[(x$95$m * t$95$0), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 3.90000000000000007e67

   1. Initial program 92.8%

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

      1. *-commutative 92.8%

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

      2. associate-/l* 96.2%

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

   4. Applied egg-rr 96.2%

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

   if 3.90000000000000007e67 < x

   1. Initial program 99.7%

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

4. Final simplification 96.9%

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

Alternative 2: 76.7% accurate, 1.0× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= y 7.5e-74) (/ x_m z) (* x_m (/ (sin y) (* y z))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (y <= 7.5e-74) {
		tmp = x_m / z;
	} else {
		tmp = x_m * (sin(y) / (y * z));
	}
	return x_s * tmp;
}

Fortran

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

Java

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

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if y <= 7.5e-74:
		tmp = x_m / z
	else:
		tmp = x_m * (math.sin(y) / (y * z))
	return x_s * tmp

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (y <= 7.5e-74)
		tmp = Float64(x_m / z);
	else
		tmp = Float64(x_m * Float64(sin(y) / Float64(y * z)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (y <= 7.5e-74)
		tmp = x_m / z;
	else
		tmp = x_m * (sin(y) / (y * z));
	end
	tmp_2 = 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]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[y, 7.5e-74], N[(x$95$m / z), $MachinePrecision], N[(x$95$m * N[(N[Sin[y], $MachinePrecision] / N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 7.5e-74

   1. Initial program 96.2%

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

      1. associate-/l* 97.1%

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

      2. associate-/l/ 87.0%

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

      3. *-commutative 87.0%

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

   3. Simplified 87.0%

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

   5. Taylor expanded in y around 0 63.1%

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

   if 7.5e-74 < y

   1. Initial program 88.9%

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

      1. associate-/l* 94.1%

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

      2. associate-/l/ 93.3%

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

      3. *-commutative 93.3%

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

   3. Simplified 93.3%

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

4. Final simplification 71.7%

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

Alternative 3: 97.5% accurate, 1.0× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (* x_s (if (<= z 1.1e-89) (* x_m (/ t_0 z)) (* t_0 (/ x_m z))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = sin(y) / y;
	double tmp;
	if (z <= 1.1e-89) {
		tmp = x_m * (t_0 / z);
	} else {
		tmp = t_0 * (x_m / z);
	}
	return x_s * tmp;
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sin(y) / y
    if (z <= 1.1d-89) then
        tmp = x_m * (t_0 / z)
    else
        tmp = t_0 * (x_m / z)
    end if
    code = x_s * tmp
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = Math.sin(y) / y;
	double tmp;
	if (z <= 1.1e-89) {
		tmp = x_m * (t_0 / z);
	} else {
		tmp = t_0 * (x_m / z);
	}
	return x_s * tmp;
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = math.sin(y) / y
	tmp = 0
	if z <= 1.1e-89:
		tmp = x_m * (t_0 / z)
	else:
		tmp = t_0 * (x_m / z)
	return x_s * tmp

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(sin(y) / y)
	tmp = 0.0
	if (z <= 1.1e-89)
		tmp = Float64(x_m * Float64(t_0 / z));
	else
		tmp = Float64(t_0 * Float64(x_m / z));
	end
	return Float64(x_s * tmp)
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = sin(y) / y;
	tmp = 0.0;
	if (z <= 1.1e-89)
		tmp = x_m * (t_0 / z);
	else
		tmp = t_0 * (x_m / z);
	end
	tmp_2 = 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]
code[x$95$s_, x$95$m_, y_, z_] := Block[{t$95$0 = N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]}, N[(x$95$s * If[LessEqual[z, 1.1e-89], N[(x$95$m * N[(t$95$0 / z), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 1.10000000000000006e-89

   1. Initial program 92.0%

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

      1. associate-/l* 97.9%

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

   3. Simplified 97.9%

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

   if 1.10000000000000006e-89 < z

   1. Initial program 98.2%

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

      1. *-commutative 98.2%

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

      2. associate-/l* 99.8%

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

   4. Applied egg-rr 99.8%

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

4. Final simplification 98.6%

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

Alternative 4: 95.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.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. Final simplification 96.2%

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

Alternative 5: 60.0% accurate, 8.9× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= z 3.4e+36) (/ 1.0 (/ z x_m)) (* x_m (/ y (* y z))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (z <= 3.4e+36) {
		tmp = 1.0 / (z / x_m);
	} else {
		tmp = x_m * (y / (y * z));
	}
	return x_s * tmp;
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 3.4d+36) then
        tmp = 1.0d0 / (z / x_m)
    else
        tmp = x_m * (y / (y * z))
    end if
    code = x_s * tmp
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (z <= 3.4e+36) {
		tmp = 1.0 / (z / x_m);
	} else {
		tmp = x_m * (y / (y * z));
	}
	return x_s * tmp;
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if z <= 3.4e+36:
		tmp = 1.0 / (z / x_m)
	else:
		tmp = x_m * (y / (y * z))
	return x_s * tmp

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (z <= 3.4e+36)
		tmp = Float64(1.0 / Float64(z / x_m));
	else
		tmp = Float64(x_m * Float64(y / Float64(y * z)));
	end
	return Float64(x_s * tmp)
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (z <= 3.4e+36)
		tmp = 1.0 / (z / x_m);
	else
		tmp = x_m * (y / (y * z));
	end
	tmp_2 = 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]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[z, 3.4e+36], N[(1.0 / N[(z / x$95$m), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(y / N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 3.3999999999999998e36

   1. Initial program 92.4%

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

      1. associate-/l* 98.2%

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

      2. associate-/l/ 88.6%

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

      3. *-commutative 88.6%

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

   3. Simplified 88.6%

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

   5. Taylor expanded in y around 0 52.0%

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

      1. div-inv 52.1%

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

      2. clear-num 52.1%

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

   7. Applied egg-rr 52.1%

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

   if 3.3999999999999998e36 < z

   1. Initial program 99.7%

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

      1. associate-/l* 90.1%

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

      2. associate-/l/ 89.1%

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

      3. *-commutative 89.1%

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

   3. Simplified 89.1%

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

      1. associate-*r/ 89.1%

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

      2. *-commutative 89.1%

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

      3. associate-/r* 96.3%

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

      4. *-commutative 96.3%

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

   6. Applied egg-rr 96.3%

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

   7. Taylor expanded in y around 0 56.9%

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

      1. associate-/l/ 71.0%

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

      2. associate-/l* 71.5%

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

      3. *-commutative 71.5%

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

   9. Applied egg-rr 71.5%

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

4. Final simplification 56.7%

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

Alternative 6: 62.2% accurate, 8.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (y <= 2e-7)
		tmp = x_m / z;
	else
		tmp = y * (x_m / (y * z));
	end
	tmp_2 = 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]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[y, 2e-7], N[(x$95$m / z), $MachinePrecision], N[(y * N[(x$95$m / N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.9999999999999999e-7

   1. Initial program 96.4%

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

      1. associate-/l* 97.3%

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

      2. associate-/l/ 87.6%

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

      3. *-commutative 87.6%

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

   3. Simplified 87.6%

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

   5. Taylor expanded in y around 0 65.0%

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

   if 1.9999999999999999e-7 < y

   1. Initial program 87.2%

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

      1. associate-/l* 93.1%

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

      2. associate-/l/ 92.2%

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

      3. *-commutative 92.2%

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

   3. Simplified 92.2%

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

      1. associate-*r/ 92.1%

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

      2. *-commutative 92.1%

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

      3. associate-/r* 89.2%

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

      4. *-commutative 89.2%

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

   6. Applied egg-rr 89.2%

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

   7. Taylor expanded in y around 0 20.7%

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

      1. associate-/l/ 26.3%

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

      2. *-commutative 26.3%

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

      3. associate-/l* 38.2%

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

      4. *-commutative 38.2%

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

   9. Applied egg-rr 38.2%

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

4. Final simplification 58.4%

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

Alternative 7: 58.2% accurate, 35.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.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/ 88.8%

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

   3. *-commutative 88.8%

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

3. Simplified 88.8%

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

5. Taylor expanded in y around 0 54.1%

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

6. Final simplification 54.1%

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

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

  :herbie-target
  (if (< z -4.2173720203427147e-29) (/ (* x (/ 1.0 (/ y (sin y)))) z) (if (< z 4.446702369113811e+64) (/ x (* z (/ y (sin y)))) (/ (* x (/ 1.0 (/ y (sin y)))) z)))

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