Linear.Quaternion:$ctanh from linear-1.19.1.3

Percentage Accurate: 96.1% → 99.7%

Time: 6.2s

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.1% 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.7% 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 4 \cdot 10^{-34}:\\ \;\;\;\;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 4e-34) (* 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 <= 4e-34) {
		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 <= 4d-34) 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 <= 4e-34) {
		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 <= 4e-34:
		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 <= 4e-34)
		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 <= 4e-34)
		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, 4e-34], 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.99999999999999971e-34

   1. Initial program 94.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 95.1

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

   4. Applied rewrites 95.1%

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

   if 3.99999999999999971e-34 < 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. Add Preprocessing

Alternative 2: 95.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 -1 \cdot 10^{+26}:\\ \;\;\;\;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) -1e+26)
      (* 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) <= -1e+26) {
		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) <= (-1d+26)) 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) <= -1e+26) {
		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) <= -1e+26:
		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) <= -1e+26)
		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) <= -1e+26)
		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], -1e+26], 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.00000000000000005e26

   1. Initial program 99.7%

      \[\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 82.4

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

   4. Applied rewrites 82.4%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. frac-times N/A

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

      5. frac-2neg N/A

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

      6. distribute-lft-neg-out N/A

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

      7. lift-neg.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-neg-in N/A

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

      11. associate-/l* N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 N/A

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

      14. lower-/.f64 89.2

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

   6. Applied rewrites 89.2%

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

   if -1.00000000000000005e26 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z)

   1. Initial program 95.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 97.5

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

   4. Applied rewrites 97.5%

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

4. Final simplification 95.8%

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

Alternative 3: 56.1% accurate, 0.8× 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{x\_m \cdot \frac{\sin y}{y}}{z} \leq 0:\\ \;\;\;\;\frac{y \cdot x\_m}{z \cdot y}\\ \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 (<= (/ (* x_m (/ (sin y) y)) z) 0.0) (/ (* y x_m) (* z y)) (/ 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 (((x_m * (sin(y) / y)) / z) <= 0.0) {
		tmp = (y * x_m) / (z * y);
	} 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 (((x_m * (sin(y) / y)) / z) <= 0.0d0) then
        tmp = (y * x_m) / (z * y)
    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 (((x_m * (Math.sin(y) / y)) / z) <= 0.0) {
		tmp = (y * x_m) / (z * y);
	} 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 ((x_m * (math.sin(y) / y)) / z) <= 0.0:
		tmp = (y * x_m) / (z * y)
	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(Float64(x_m * Float64(sin(y) / y)) / z) <= 0.0)
		tmp = Float64(Float64(y * x_m) / Float64(z * y));
	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 (((x_m * (sin(y) / y)) / z) <= 0.0)
		tmp = (y * x_m) / (z * y);
	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[(x$95$m * N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], 0.0], N[(N[(y * x$95$m), $MachinePrecision] / N[(z * y), $MachinePrecision]), $MachinePrecision], N[(x$95$m / z), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 94.2%

      \[\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}{y \cdot z}} \]

      6. frac-2neg N/A

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

      7. distribute-frac-neg2 N/A

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

      8. distribute-neg-frac N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. distribute-rgt-neg-in N/A

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

      12. distribute-rgt-neg-in N/A

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

      13. remove-double-neg N/A

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

      14. lower-*.f64 N/A

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

      15. *-commutative N/A

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

      16. lower-*.f64 89.6

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

   4. Applied rewrites 89.6%

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

   5. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 50.7

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

   7. Applied rewrites 50.7%

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

   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 66.4

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

   5. Applied rewrites 66.4%

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

Alternative 4: 66.2% 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^{-62}:\\ \;\;\;\;\left(-y\right) \cdot \frac{x\_m}{\left(-y\right) \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-62) (* (- 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) <= 1e-62) {
		tmp = -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) <= 1d-62) then
        tmp = -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) <= 1e-62) {
		tmp = -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) <= 1e-62:
		tmp = -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) <= 1e-62)
		tmp = Float64(Float64(-y) * Float64(x_m / Float64(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) <= 1e-62)
		tmp = -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], 1e-62], N[((-y) * 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) < 1e-62

   1. Initial program 92.1%

      \[\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. lift-/.f64 N/A

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

      6. frac-2neg N/A

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

      7. frac-times N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 94.2

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

   4. Applied rewrites 94.2%

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

   5. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 33.8

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

   7. Applied rewrites 33.8%

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

   if 1e-62 < (/.f64 (sin.f64 y) y)

   1. Initial program 99.9%

      \[\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 91.3

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

   5. Applied rewrites 91.3%

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

Alternative 5: 77.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 2 \cdot 10^{-8}:\\ \;\;\;\;\frac{x\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x\_m}{z \cdot y} \cdot \sin y\\ \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 2e-8) (/ x_m z) (* (/ x_m (* z y)) (sin y)))))

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-8) {
		tmp = x_m / z;
	} else {
		tmp = (x_m / (z * y)) * sin(y);
	}
	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-8) then
        tmp = x_m / z
    else
        tmp = (x_m / (z * y)) * sin(y)
    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-8) {
		tmp = x_m / z;
	} else {
		tmp = (x_m / (z * y)) * Math.sin(y);
	}
	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-8:
		tmp = x_m / z
	else:
		tmp = (x_m / (z * y)) * math.sin(y)
	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-8)
		tmp = Float64(x_m / z);
	else
		tmp = Float64(Float64(x_m / Float64(z * y)) * sin(y));
	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-8)
		tmp = x_m / z;
	else
		tmp = (x_m / (z * y)) * sin(y);
	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-8], N[(x$95$m / z), $MachinePrecision], N[(N[(x$95$m / N[(z * y), $MachinePrecision]), $MachinePrecision] * N[Sin[y], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 2e-8

   1. Initial program 96.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 72.8

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

   5. Applied rewrites 72.8%

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

   if 2e-8 < y

   1. Initial program 95.4%

      \[\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}{y \cdot z}} \]

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. associate-/r* N/A

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

      11. lower-/.f64 N/A

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

      12. lower-/.f64 95.5

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

   4. Applied rewrites 95.5%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. remove-double-neg N/A

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

      5. distribute-lft-neg-out N/A

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

      6. lift-neg.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lift-*.f64 N/A

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

      10. lift-neg.f64 N/A

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

      11. distribute-lft-neg-out N/A

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

      12. remove-double-neg N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 94.4

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

   6. Applied rewrites 94.4%

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

Alternative 6: 61.2% accurate, 3.8× 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 27500000000000:\\ \;\;\;\;\mathsf{fma}\left(-0.16666666666666666, y \cdot y, 1\right) \cdot \frac{x\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;\left(-y\right) \cdot \frac{x\_m}{\left(-y\right) \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 27500000000000.0)
    (* (fma -0.16666666666666666 (* y y) 1.0) (/ 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 <= 27500000000000.0) {
		tmp = fma(-0.16666666666666666, (y * y), 1.0) * (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 <= 27500000000000.0)
		tmp = Float64(fma(-0.16666666666666666, Float64(y * y), 1.0) * Float64(x_m / z));
	else
		tmp = Float64(Float64(-y) * Float64(x_m / Float64(Float64(-y) * 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_] := N[(x$95$s * If[LessEqual[y, 27500000000000.0], N[(N[(-0.16666666666666666 * N[(y * y), $MachinePrecision] + 1.0), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], N[((-y) * N[(x$95$m / N[((-y) * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 2.75e13

   1. Initial program 96.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 97.0

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

   4. Applied rewrites 97.0%

      \[\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 68.8

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

   7. Applied rewrites 68.8%

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

   if 2.75e13 < y

   1. Initial program 95.1%

      \[\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. lift-/.f64 N/A

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

      6. frac-2neg N/A

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

      7. frac-times N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 94.0

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

   4. Applied rewrites 94.0%

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

   5. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 36.5

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

   7. Applied rewrites 36.5%

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

Alternative 7: 58.6% 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 96.4%

   \[\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 59.1

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

5. Applied rewrites 59.1%

   \[\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 2024332 
(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))