Linear.Quaternion:$ctanh from linear-1.19.1.3

Percentage Accurate: 95.8% → 99.6%

Time: 8.6s

Alternatives: 12

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: 95.8% 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.6% 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 10^{+49}:\\ \;\;\;\;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 1e+49) (* 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 <= 1e+49) {
		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 <= 1d+49) 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 <= 1e+49) {
		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 <= 1e+49:
		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 <= 1e+49)
		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 <= 1e+49)
		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, 1e+49], 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 < 9.99999999999999946e48

   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 97.1

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

   4. Applied rewrites 97.1%

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

   if 9.99999999999999946e48 < 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: 40.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 -4 \cdot 10^{-286}:\\ \;\;\;\;\frac{-x\_m}{z}\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\frac{\frac{x\_m}{z} \cdot x\_m}{x\_m}\\ \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 -4e-286)
      (/ (- x_m) z)
      (if (<= t_0 0.0) (/ (* (/ x_m z) x_m) x_m) (/ 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 <= -4e-286) {
		tmp = -x_m / z;
	} else if (t_0 <= 0.0) {
		tmp = ((x_m / z) * x_m) / x_m;
	} 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) :: t_0
    real(8) :: tmp
    t_0 = (x_m * (sin(y) / y)) / z
    if (t_0 <= (-4d-286)) then
        tmp = -x_m / z
    else if (t_0 <= 0.0d0) then
        tmp = ((x_m / z) * x_m) / x_m
    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 t_0 = (x_m * (Math.sin(y) / y)) / z;
	double tmp;
	if (t_0 <= -4e-286) {
		tmp = -x_m / z;
	} else if (t_0 <= 0.0) {
		tmp = ((x_m / z) * x_m) / x_m;
	} 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):
	t_0 = (x_m * (math.sin(y) / y)) / z
	tmp = 0
	if t_0 <= -4e-286:
		tmp = -x_m / z
	elif t_0 <= 0.0:
		tmp = ((x_m / z) * x_m) / x_m
	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 <= -4e-286)
		tmp = Float64(Float64(-x_m) / z);
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(Float64(x_m / z) * x_m) / x_m);
	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)
	t_0 = (x_m * (sin(y) / y)) / z;
	tmp = 0.0;
	if (t_0 <= -4e-286)
		tmp = -x_m / z;
	elseif (t_0 <= 0.0)
		tmp = ((x_m / z) * x_m) / x_m;
	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_] := 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, -4e-286], N[((-x$95$m) / z), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(N[(N[(x$95$m / z), $MachinePrecision] * x$95$m), $MachinePrecision] / x$95$m), $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.0000000000000002e-286

   1. Initial program 99.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 56.3

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

   5. Applied rewrites 56.3%

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

   7. Applied rewrites 56.1%

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

   9. Applied rewrites 2.5%

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

   if -4.0000000000000002e-286 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z) < 0.0

   1. Initial program 84.3%

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

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

   5. Applied rewrites 51.9%

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

   7. Applied rewrites 51.9%

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

   9. Applied rewrites 51.9%

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

   11. Applied rewrites 66.6%

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

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

   1. Initial program 99.5%

      \[\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.8

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

   5. Applied rewrites 68.8%

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

Alternative 3: 39.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^{-274}:\\ \;\;\;\;\frac{-x\_m}{z}\\ \mathbf{elif}\;t\_0 \leq 10^{-303}:\\ \;\;\;\;\frac{z \cdot 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-274)
      (/ (- x_m) z)
      (if (<= t_0 1e-303) (/ (* 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-274) {
		tmp = -x_m / z;
	} else if (t_0 <= 1e-303) {
		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) :: t_0
    real(8) :: tmp
    t_0 = (x_m * (sin(y) / y)) / z
    if (t_0 <= (-5d-274)) then
        tmp = -x_m / z
    else if (t_0 <= 1d-303) 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 t_0 = (x_m * (Math.sin(y) / y)) / z;
	double tmp;
	if (t_0 <= -5e-274) {
		tmp = -x_m / z;
	} else if (t_0 <= 1e-303) {
		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):
	t_0 = (x_m * (math.sin(y) / y)) / z
	tmp = 0
	if t_0 <= -5e-274:
		tmp = -x_m / z
	elif t_0 <= 1e-303:
		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-274)
		tmp = Float64(Float64(-x_m) / z);
	elseif (t_0 <= 1e-303)
		tmp = Float64(Float64(z * 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)
	t_0 = (x_m * (sin(y) / y)) / z;
	tmp = 0.0;
	if (t_0 <= -5e-274)
		tmp = -x_m / z;
	elseif (t_0 <= 1e-303)
		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_] := 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-274], N[((-x$95$m) / z), $MachinePrecision], If[LessEqual[t$95$0, 1e-303], N[(N[(z * x$95$m), $MachinePrecision] / N[(z * z), $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) < -5e-274

   1. Initial program 99.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 56.3

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

   5. Applied rewrites 56.3%

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

   7. Applied rewrites 56.1%

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

   9. Applied rewrites 2.5%

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

   if -5e-274 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z) < 9.99999999999999931e-304

   1. Initial program 84.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 51.2

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

   5. Applied rewrites 51.2%

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

   7. Applied rewrites 51.2%

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

   9. Applied rewrites 51.2%

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

   11. Applied rewrites 63.7%

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

   if 9.99999999999999931e-304 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z)

   1. Initial program 99.5%

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

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

   5. Applied rewrites 69.4%

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

Alternative 4: 39.1% 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 -2 \cdot 10^{-272}:\\ \;\;\;\;\frac{-x\_m}{z}\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;\frac{x\_m \cdot x\_m}{z \cdot x\_m}\\ \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 -2e-272)
      (/ (- x_m) z)
      (if (<= t_0 0.0) (/ (* x_m x_m) (* z x_m)) (/ 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 <= -2e-272) {
		tmp = -x_m / z;
	} else if (t_0 <= 0.0) {
		tmp = (x_m * x_m) / (z * x_m);
	} 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) :: t_0
    real(8) :: tmp
    t_0 = (x_m * (sin(y) / y)) / z
    if (t_0 <= (-2d-272)) then
        tmp = -x_m / z
    else if (t_0 <= 0.0d0) then
        tmp = (x_m * x_m) / (z * x_m)
    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 t_0 = (x_m * (Math.sin(y) / y)) / z;
	double tmp;
	if (t_0 <= -2e-272) {
		tmp = -x_m / z;
	} else if (t_0 <= 0.0) {
		tmp = (x_m * x_m) / (z * x_m);
	} 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):
	t_0 = (x_m * (math.sin(y) / y)) / z
	tmp = 0
	if t_0 <= -2e-272:
		tmp = -x_m / z
	elif t_0 <= 0.0:
		tmp = (x_m * x_m) / (z * x_m)
	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 <= -2e-272)
		tmp = Float64(Float64(-x_m) / z);
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(x_m * x_m) / Float64(z * x_m));
	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)
	t_0 = (x_m * (sin(y) / y)) / z;
	tmp = 0.0;
	if (t_0 <= -2e-272)
		tmp = -x_m / z;
	elseif (t_0 <= 0.0)
		tmp = (x_m * x_m) / (z * x_m);
	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_] := 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, -2e-272], N[((-x$95$m) / z), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(N[(x$95$m * x$95$m), $MachinePrecision] / N[(z * x$95$m), $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) < -1.99999999999999986e-272

   1. Initial program 99.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 56.9

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

   5. Applied rewrites 56.9%

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

   7. Applied rewrites 56.7%

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

   9. Applied rewrites 2.5%

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

   if -1.99999999999999986e-272 < (/.f64 (*.f64 x (/.f64 (sin.f64 y) y)) z) < 0.0

   1. Initial program 84.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 51.1

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

   5. Applied rewrites 51.1%

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

   7. Applied rewrites 51.1%

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

   9. Applied rewrites 51.2%

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

   11. Applied rewrites 57.8%

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

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

   1. Initial program 99.5%

      \[\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.8

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

   5. Applied rewrites 68.8%

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

Alternative 5: 40.4% 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{-1}{\frac{z}{x\_m \cdot x\_m} \cdot x\_m}\\ \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)
    (/ -1.0 (* (/ z (* x_m x_m)) x_m))
    (/ 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 = -1.0 / ((z / (x_m * x_m)) * x_m);
	} 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 = (-1.0d0) / ((z / (x_m * x_m)) * x_m)
    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 = -1.0 / ((z / (x_m * x_m)) * x_m);
	} 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 = -1.0 / ((z / (x_m * x_m)) * x_m)
	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(-1.0 / Float64(Float64(z / Float64(x_m * x_m)) * x_m));
	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 = -1.0 / ((z / (x_m * x_m)) * x_m);
	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[(-1.0 / N[(N[(z / N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $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 92.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 54.3

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

   5. Applied rewrites 54.3%

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

   7. Applied rewrites 54.4%

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

   9. Applied rewrites 32.2%

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

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

   1. Initial program 99.5%

      \[\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.8

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

   5. Applied rewrites 68.8%

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

4. Final simplification 47.8%

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

Alternative 6: 60.0% 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}\;y \leq 1.3 \cdot 10^{+54}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot y, -0.16666666666666666, 1\right) \cdot \frac{x\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;{\left(\left(\frac{\frac{z}{x\_m}}{x\_m \cdot x\_m} \cdot x\_m\right) \cdot x\_m\right)}^{-1}\\ \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.3e+54)
    (* (fma (* y y) -0.16666666666666666 1.0) (/ x_m z))
    (pow (* (* (/ (/ z x_m) (* x_m x_m)) x_m) x_m) -1.0))))

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.3e+54) {
		tmp = fma((y * y), -0.16666666666666666, 1.0) * (x_m / z);
	} else {
		tmp = pow(((((z / x_m) / (x_m * x_m)) * x_m) * x_m), -1.0);
	}
	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.3e+54)
		tmp = Float64(fma(Float64(y * y), -0.16666666666666666, 1.0) * Float64(x_m / z));
	else
		tmp = Float64(Float64(Float64(Float64(z / x_m) / Float64(x_m * x_m)) * x_m) * x_m) ^ -1.0;
	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, 1.3e+54], N[(N[(N[(y * y), $MachinePrecision] * -0.16666666666666666 + 1.0), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(N[(N[(z / x$95$m), $MachinePrecision] / N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision], -1.0], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.30000000000000003e54

   1. Initial program 97.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. *-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 98.5

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

   4. Applied rewrites 98.5%

      \[\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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 70.7

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

   7. Applied rewrites 70.7%

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

   if 1.30000000000000003e54 < y

   1. Initial program 90.2%

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

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

   5. Applied rewrites 21.9%

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

   7. Applied rewrites 22.1%

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

   9. Applied rewrites 31.5%

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

   11. Applied rewrites 32.8%

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

4. Final simplification 62.0%

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

Alternative 7: 60.8% 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}\;\frac{\sin y}{y} \leq -4.2 \cdot 10^{-306}:\\ \;\;\;\;\frac{-x\_m}{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) -4.2e-306) (/ (- x_m) 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) <= -4.2e-306) {
		tmp = -x_m / 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) <= (-4.2d-306)) then
        tmp = -x_m / 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) <= -4.2e-306) {
		tmp = -x_m / 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) <= -4.2e-306:
		tmp = -x_m / 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) <= -4.2e-306)
		tmp = Float64(Float64(-x_m) / 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) <= -4.2e-306)
		tmp = -x_m / 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], -4.2e-306], N[((-x$95$m) / z), $MachinePrecision], N[(x$95$m / z), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (sin.f64 y) y) < -4.2000000000000002e-306

   1. Initial program 91.5%

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

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

   5. Applied rewrites 16.2%

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

   7. Applied rewrites 16.2%

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

   9. Applied rewrites 22.7%

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

   if -4.2000000000000002e-306 < (/.f64 (sin.f64 y) y)

   1. Initial program 97.2%

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

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

   5. Applied rewrites 76.5%

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

Alternative 8: 59.5% 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.3 \cdot 10^{+54}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot y, -0.16666666666666666, 1\right) \cdot \frac{x\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{z}{x\_m \cdot x\_m} \cdot x\_m\right)}^{-1}\\ \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.3e+54)
    (* (fma (* y y) -0.16666666666666666 1.0) (/ x_m z))
    (pow (* (/ z (* x_m x_m)) x_m) -1.0))))

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.3e+54) {
		tmp = fma((y * y), -0.16666666666666666, 1.0) * (x_m / z);
	} else {
		tmp = pow(((z / (x_m * x_m)) * x_m), -1.0);
	}
	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.3e+54)
		tmp = Float64(fma(Float64(y * y), -0.16666666666666666, 1.0) * Float64(x_m / z));
	else
		tmp = Float64(Float64(z / Float64(x_m * x_m)) * x_m) ^ -1.0;
	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, 1.3e+54], N[(N[(N[(y * y), $MachinePrecision] * -0.16666666666666666 + 1.0), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(z / N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision], -1.0], $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.30000000000000003e54

   1. Initial program 97.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. *-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 98.5

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

   4. Applied rewrites 98.5%

      \[\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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 70.7

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

   7. Applied rewrites 70.7%

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

   if 1.30000000000000003e54 < y

   1. Initial program 90.2%

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

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

   5. Applied rewrites 21.9%

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

   7. Applied rewrites 22.1%

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

   9. Applied rewrites 31.5%

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

   11. Applied rewrites 31.3%

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

4. Final simplification 61.6%

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

Alternative 9: 77.5% 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.85 \cdot 10^{-8}:\\ \;\;\;\;\frac{x\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\sin y \cdot x\_m}{z \cdot 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 1.85e-8) (/ x_m z) (/ (* (sin y) x_m) (* z 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 <= 1.85e-8) {
		tmp = x_m / z;
	} else {
		tmp = (sin(y) * x_m) / (z * 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 <= 1.85d-8) then
        tmp = x_m / z
    else
        tmp = (sin(y) * x_m) / (z * 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 <= 1.85e-8) {
		tmp = x_m / z;
	} else {
		tmp = (Math.sin(y) * x_m) / (z * 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 <= 1.85e-8:
		tmp = x_m / z
	else:
		tmp = (math.sin(y) * x_m) / (z * 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 <= 1.85e-8)
		tmp = Float64(x_m / z);
	else
		tmp = Float64(Float64(sin(y) * x_m) / Float64(z * 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 <= 1.85e-8)
		tmp = x_m / z;
	else
		tmp = (sin(y) * x_m) / (z * 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, 1.85e-8], N[(x$95$m / z), $MachinePrecision], N[(N[(N[Sin[y], $MachinePrecision] * x$95$m), $MachinePrecision] / N[(z * y), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.85e-8

   1. Initial program 97.2%

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

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

   5. Applied rewrites 74.9%

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

   if 1.85e-8 < y

   1. Initial program 91.6%

      \[\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. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-*.f64 91.5

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

   4. Applied rewrites 91.5%

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

Alternative 10: 96.0% 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(\frac{\sin y}{y} \cdot \frac{x\_m}{z}\right) \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 (* (/ (sin y) 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) {
	return x_s * ((sin(y) / y) * (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 * ((sin(y) / y) * (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 * ((Math.sin(y) / y) * (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 * ((math.sin(y) / y) * (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(Float64(sin(y) / y) * 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 * ((sin(y) / y) * (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[(N[(N[Sin[y], $MachinePrecision] / y), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

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

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

4. Applied rewrites 96.9%

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

Alternative 11: 59.4% 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 1.3 \cdot 10^{+54}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot y, -0.16666666666666666, 1\right) \cdot \frac{x\_m}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x\_m}{z} \cdot x\_m}{x\_m}\\ \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.3e+54)
    (* (fma (* y y) -0.16666666666666666 1.0) (/ x_m z))
    (/ (* (/ x_m z) x_m) x_m))))

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.3e+54) {
		tmp = fma((y * y), -0.16666666666666666, 1.0) * (x_m / z);
	} else {
		tmp = ((x_m / z) * x_m) / x_m;
	}
	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.3e+54)
		tmp = Float64(fma(Float64(y * y), -0.16666666666666666, 1.0) * Float64(x_m / z));
	else
		tmp = Float64(Float64(Float64(x_m / z) * x_m) / x_m);
	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, 1.3e+54], N[(N[(N[(y * y), $MachinePrecision] * -0.16666666666666666 + 1.0), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x$95$m / z), $MachinePrecision] * x$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 1.30000000000000003e54

   1. Initial program 97.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. *-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 98.5

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

   4. Applied rewrites 98.5%

      \[\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. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 70.7

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

   7. Applied rewrites 70.7%

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

   if 1.30000000000000003e54 < y

   1. Initial program 90.2%

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

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

   5. Applied rewrites 21.9%

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

   7. Applied rewrites 21.9%

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

   9. Applied rewrites 22.0%

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

   11. Applied rewrites 31.3%

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

Alternative 12: 59.1% 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.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 60.5

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

5. Applied rewrites 60.5%

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