Linear.Quaternion:$ctanh from linear-1.19.1.3

Percentage Accurate: 96.2% → 99.8%

Time: 9.6s

Alternatives: 9

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.8% 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 2000000000000:\\ \;\;\;\;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 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (* x_s (if (<= x_m 2000000000000.0) (* 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 <= 2000000000000.0) {
		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 <= 2000000000000.0d0) 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 <= 2000000000000.0) {
		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 <= 2000000000000.0:
		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 <= 2000000000000.0)
		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 <= 2000000000000.0)
		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, 2000000000000.0], 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 < 2e12

   1. Initial program 94.3%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 96.4

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

   4. Applied rewrites 96.4%

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

   if 2e12 < x

   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: 60.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := \frac{x\_m \cdot \frac{\sin y}{y}}{z}\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -5 \cdot 10^{-171}:\\ \;\;\;\;\frac{x\_m}{z} \cdot \mathsf{fma}\left(-0.16666666666666666, y \cdot y, 1\right)\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;z \cdot \left(z \cdot \frac{\frac{x\_m}{z \cdot z}}{z}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{z}\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ (* x_m (/ (sin y) y)) z)))
   (*
    x_s
    (if (<= t_0 -5e-171)
      (* (/ x_m z) (fma -0.16666666666666666 (* y y) 1.0))
      (if (<= t_0 0.0) (* z (* z (/ (/ x_m (* z z)) z))) (/ 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 = (x_m * (sin(y) / y)) / z;
	double tmp;
	if (t_0 <= -5e-171) {
		tmp = (x_m / z) * fma(-0.16666666666666666, (y * y), 1.0);
	} else if (t_0 <= 0.0) {
		tmp = z * (z * ((x_m / (z * z)) / z));
	} else {
		tmp = 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(Float64(x_m * Float64(sin(y) / y)) / z)
	tmp = 0.0
	if (t_0 <= -5e-171)
		tmp = Float64(Float64(x_m / z) * fma(-0.16666666666666666, Float64(y * y), 1.0));
	elseif (t_0 <= 0.0)
		tmp = Float64(z * Float64(z * Float64(Float64(x_m / Float64(z * z)) / z)));
	else
		tmp = Float64(x_m / z);
	end
	return Float64(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[(x$95$m * N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, N[(x$95$s * If[LessEqual[t$95$0, -5e-171], N[(N[(x$95$m / z), $MachinePrecision] * N[(-0.16666666666666666 * N[(y * y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(z * N[(z * N[(N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$95$m / z), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z) < -4.99999999999999992e-171

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 94.7

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

   4. Applied rewrites 94.7%

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

   5. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\left(1 + \frac{-1}{6} \cdot {y}^{2}\right)} \cdot \frac{x}{z} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{6} \cdot {y}^{2} + 1\right)} \cdot \frac{x}{z} \]

      2. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{-1}{6}, {y}^{2}, 1\right)} \cdot \frac{x}{z} \]

      3. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{6}, \color{blue}{y \cdot y}, 1\right) \cdot \frac{x}{z} \]

      4. lower-*.f64 57.1

         \[\leadsto \mathsf{fma}\left(-0.16666666666666666, \color{blue}{y \cdot y}, 1\right) \cdot \frac{x}{z} \]

   7. Applied rewrites 57.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-0.16666666666666666, y \cdot y, 1\right)} \cdot \frac{x}{z} \]

   if -4.99999999999999992e-171 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z) < 0.0

   1. Initial program 85.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 50.7

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

   5. Applied rewrites 50.7%

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

   7. Applied rewrites 50.6%

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

   9. Applied rewrites 54.3%

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

   11. Applied rewrites 55.6%

       \[\leadsto \left(z \cdot \frac{\frac{x}{z \cdot z}}{z}\right) \cdot z \]

   if 0.0 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z)

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 63.0

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

   5. Applied rewrites 63.0%

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

4. Final simplification 59.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x \cdot \frac{\sin y}{y}}{z} \leq -5 \cdot 10^{-171}:\\ \;\;\;\;\frac{x}{z} \cdot \mathsf{fma}\left(-0.16666666666666666, y \cdot y, 1\right)\\ \mathbf{elif}\;\frac{x \cdot \frac{\sin y}{y}}{z} \leq 0:\\ \;\;\;\;z \cdot \left(z \cdot \frac{\frac{x}{z \cdot z}}{z}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 60.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := \frac{x\_m \cdot \frac{\sin y}{y}}{z}\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -5 \cdot 10^{-171}:\\ \;\;\;\;\frac{x\_m}{z} \cdot \mathsf{fma}\left(-0.16666666666666666, y \cdot y, 1\right)\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;z \cdot \frac{x\_m}{z \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{z}\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ (* x_m (/ (sin y) y)) z)))
   (*
    x_s
    (if (<= t_0 -5e-171)
      (* (/ x_m z) (fma -0.16666666666666666 (* y y) 1.0))
      (if (<= t_0 0.0) (* z (/ x_m (* z z))) (/ 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 = (x_m * (sin(y) / y)) / z;
	double tmp;
	if (t_0 <= -5e-171) {
		tmp = (x_m / z) * fma(-0.16666666666666666, (y * y), 1.0);
	} else if (t_0 <= 0.0) {
		tmp = z * (x_m / (z * z));
	} else {
		tmp = 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(Float64(x_m * Float64(sin(y) / y)) / z)
	tmp = 0.0
	if (t_0 <= -5e-171)
		tmp = Float64(Float64(x_m / z) * fma(-0.16666666666666666, Float64(y * y), 1.0));
	elseif (t_0 <= 0.0)
		tmp = Float64(z * Float64(x_m / Float64(z * z)));
	else
		tmp = Float64(x_m / z);
	end
	return Float64(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[(x$95$m * N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, N[(x$95$s * If[LessEqual[t$95$0, -5e-171], N[(N[(x$95$m / z), $MachinePrecision] * N[(-0.16666666666666666 * N[(y * y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(z * N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$95$m / z), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z) < -4.99999999999999992e-171

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 94.7

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

   4. Applied rewrites 94.7%

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

   5. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\left(1 + \frac{-1}{6} \cdot {y}^{2}\right)} \cdot \frac{x}{z} \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{6} \cdot {y}^{2} + 1\right)} \cdot \frac{x}{z} \]

      2. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{-1}{6}, {y}^{2}, 1\right)} \cdot \frac{x}{z} \]

      3. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{6}, \color{blue}{y \cdot y}, 1\right) \cdot \frac{x}{z} \]

      4. lower-*.f64 57.1

         \[\leadsto \mathsf{fma}\left(-0.16666666666666666, \color{blue}{y \cdot y}, 1\right) \cdot \frac{x}{z} \]

   7. Applied rewrites 57.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-0.16666666666666666, y \cdot y, 1\right)} \cdot \frac{x}{z} \]

   if -4.99999999999999992e-171 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z) < 0.0

   1. Initial program 85.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 50.7

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

   5. Applied rewrites 50.7%

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

   7. Applied rewrites 50.6%

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

   9. Applied rewrites 54.3%

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

   if 0.0 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z)

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 63.0

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

   5. Applied rewrites 63.0%

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

4. Final simplification 58.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x \cdot \frac{\sin y}{y}}{z} \leq -5 \cdot 10^{-171}:\\ \;\;\;\;\frac{x}{z} \cdot \mathsf{fma}\left(-0.16666666666666666, y \cdot y, 1\right)\\ \mathbf{elif}\;\frac{x \cdot \frac{\sin y}{y}}{z} \leq 0:\\ \;\;\;\;z \cdot \frac{x}{z \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 94.6% accurate, 0.5× 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}\;\frac{x\_m \cdot t\_0}{z} \leq -2 \cdot 10^{-49}:\\ \;\;\;\;x\_m \cdot \frac{\sin y}{y \cdot 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 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ (sin y) y)))
   (*
    x_s
    (if (<= (/ (* x_m t_0) z) -2e-49)
      (* x_m (/ (sin y) (* y 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 (((x_m * t_0) / z) <= -2e-49) {
		tmp = x_m * (sin(y) / (y * 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 (((x_m * t_0) / z) <= (-2d-49)) then
        tmp = x_m * (sin(y) / (y * 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 (((x_m * t_0) / z) <= -2e-49) {
		tmp = x_m * (Math.sin(y) / (y * 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 ((x_m * t_0) / z) <= -2e-49:
		tmp = x_m * (math.sin(y) / (y * 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 (Float64(Float64(x_m * t_0) / z) <= -2e-49)
		tmp = Float64(x_m * Float64(sin(y) / Float64(y * 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 (((x_m * t_0) / z) <= -2e-49)
		tmp = x_m * (sin(y) / (y * 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[N[(N[(x$95$m * t$95$0), $MachinePrecision] / z), $MachinePrecision], -2e-49], N[(x$95$m * N[(N[Sin[y], $MachinePrecision] / N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z) < -1.99999999999999987e-49

   1. Initial program 99.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. associate-/l/ N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 90.8

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

   4. Applied rewrites 90.8%

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

   if -1.99999999999999987e-49 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z)

   1. Initial program 94.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 96.5

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

   4. Applied rewrites 96.5%

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

4. Final simplification 95.3%

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

Alternative 5: 95.8% accurate, 0.5× 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}\;\frac{\sin y}{y} \leq 0.9999999999999998:\\ \;\;\;\;\sin y \cdot \frac{x\_m}{y \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{z}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= (/ (sin y) y) 0.9999999999999998)
    (* (sin y) (/ x_m (* y z)))
    (/ 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 tmp;
	if ((sin(y) / y) <= 0.9999999999999998) {
		tmp = sin(y) * (x_m / (y * z));
	} else {
		tmp = 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) :: tmp
    if ((sin(y) / y) <= 0.9999999999999998d0) then
        tmp = sin(y) * (x_m / (y * z))
    else
        tmp = 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 tmp;
	if ((Math.sin(y) / y) <= 0.9999999999999998) {
		tmp = Math.sin(y) * (x_m / (y * z));
	} else {
		tmp = 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):
	tmp = 0
	if (math.sin(y) / y) <= 0.9999999999999998:
		tmp = math.sin(y) * (x_m / (y * z))
	else:
		tmp = 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)
	tmp = 0.0
	if (Float64(sin(y) / y) <= 0.9999999999999998)
		tmp = Float64(sin(y) * Float64(x_m / Float64(y * z)));
	else
		tmp = 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)
	tmp = 0.0;
	if ((sin(y) / y) <= 0.9999999999999998)
		tmp = sin(y) * (x_m / (y * z));
	else
		tmp = 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_] := N[(x$95$s * If[LessEqual[N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision], 0.9999999999999998], N[(N[Sin[y], $MachinePrecision] * N[(x$95$m / N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$95$m / z), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (sin.f64 y) y) < 0.99999999999999978

   1. Initial program 91.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. div-inv N/A

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

      6. associate-*l* N/A

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

      7. associate-/l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. associate-*l/ N/A

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

      11. *-lft-identity N/A

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

      12. associate-/l/ N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 93.4

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

   4. Applied rewrites 93.4%

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

   if 0.99999999999999978 < (/.f64 (sin.f64 y) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 100.0

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

   5. Applied rewrites 100.0%

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

4. Final simplification 96.5%

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

Alternative 6: 62.3% accurate, 0.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}\;\frac{\sin y}{y} \leq 10^{-44}:\\ \;\;\;\;z \cdot \frac{x\_m}{z \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{z}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= (/ (sin y) y) 1e-44) (* z (/ x_m (* z z))) (/ 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 tmp;
	if ((sin(y) / y) <= 1e-44) {
		tmp = z * (x_m / (z * z));
	} else {
		tmp = 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) :: tmp
    if ((sin(y) / y) <= 1d-44) then
        tmp = z * (x_m / (z * z))
    else
        tmp = 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 tmp;
	if ((Math.sin(y) / y) <= 1e-44) {
		tmp = z * (x_m / (z * z));
	} else {
		tmp = 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):
	tmp = 0
	if (math.sin(y) / y) <= 1e-44:
		tmp = z * (x_m / (z * z))
	else:
		tmp = 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)
	tmp = 0.0
	if (Float64(sin(y) / y) <= 1e-44)
		tmp = Float64(z * Float64(x_m / Float64(z * z)));
	else
		tmp = 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)
	tmp = 0.0;
	if ((sin(y) / y) <= 1e-44)
		tmp = z * (x_m / (z * z));
	else
		tmp = 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_] := N[(x$95$s * If[LessEqual[N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision], 1e-44], N[(z * N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x$95$m / z), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (sin.f64 y) y) < 9.99999999999999953e-45

   1. Initial program 90.7%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 17.6

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

   5. Applied rewrites 17.6%

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

   7. Applied rewrites 17.6%

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

   9. Applied rewrites 24.5%

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

   if 9.99999999999999953e-45 < (/.f64 (sin.f64 y) y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 93.1

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

   5. Applied rewrites 93.1%

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

4. Final simplification 61.0%

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

Alternative 7: 76.3% 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 1.25 \cdot 10^{-8}:\\ \;\;\;\;\frac{x\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m \cdot \sin y}{y \cdot z}\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= y 1.25e-8) (/ 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 <= 1.25e-8) {
		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 <= 1.25d-8) 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 <= 1.25e-8) {
		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 <= 1.25e-8:
		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 <= 1.25e-8)
		tmp = Float64(x_m / z);
	else
		tmp = Float64(Float64(x_m * 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 <= 1.25e-8)
		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, 1.25e-8], N[(x$95$m / z), $MachinePrecision], N[(N[(x$95$m * N[Sin[y], $MachinePrecision]), $MachinePrecision] / N[(y * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.2499999999999999e-8

   1. Initial program 98.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 68.1

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

   5. Applied rewrites 68.1%

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

   if 1.2499999999999999e-8 < y

   1. Initial program 87.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. associate-/l/ N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 95.0

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

   4. Applied rewrites 95.0%

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

Alternative 8: 76.3% 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 6.3 \cdot 10^{-10}:\\ \;\;\;\;\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 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= y 6.3e-10) (/ 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 <= 6.3e-10) {
		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 <= 6.3d-10) 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 <= 6.3e-10) {
		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 <= 6.3e-10:
		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 <= 6.3e-10)
		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 <= 6.3e-10)
		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, 6.3e-10], 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 < 6.29999999999999996e-10

   1. Initial program 98.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 68.1

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

   5. Applied rewrites 68.1%

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

   if 6.29999999999999996e-10 < y

   1. Initial program 87.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. associate-/l/ N/A

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

      8. lower-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 95.0

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

   4. Applied rewrites 95.0%

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

4. Final simplification 74.3%

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

Alternative 9: 58.2% accurate, 10.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 #s(literal 1 binary64) 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 95.6%

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

3. Taylor expanded in y around 0

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

   1. lower-/.f64 57.7

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

5. Applied rewrites 57.7%

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

Developer Target 1: 99.6% accurate, 0.8× 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 2024233 
(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))