Linear.Quaternion:$ctan from linear-1.19.1.3

Percentage Accurate: 85.3% → 99.5%

Time: 8.4s

Alternatives: 12

Speedup: 1.0×

• 64.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 85.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.5% accurate, 0.5× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= (* (cosh x_m) (/ y_m x_m)) 4e+283)
     (/ (+ (/ y_m x_m) (* 0.5 (* x_m y_m))) z)
     (/ (* y_m (/ (cosh x_m) z)) x_m)))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((cosh(x_m) * (y_m / x_m)) <= 4e+283) {
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z;
	} else {
		tmp = (y_m * (cosh(x_m) / z)) / x_m;
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((cosh(x_m) * (y_m / x_m)) <= 4d+283) then
        tmp = ((y_m / x_m) + (0.5d0 * (x_m * y_m))) / z
    else
        tmp = (y_m * (cosh(x_m) / z)) / x_m
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if ((Math.cosh(x_m) * (y_m / x_m)) <= 4e+283) {
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z;
	} else {
		tmp = (y_m * (Math.cosh(x_m) / z)) / x_m;
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if (math.cosh(x_m) * (y_m / x_m)) <= 4e+283:
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z
	else:
		tmp = (y_m * (math.cosh(x_m) / z)) / x_m
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (Float64(cosh(x_m) * Float64(y_m / x_m)) <= 4e+283)
		tmp = Float64(Float64(Float64(y_m / x_m) + Float64(0.5 * Float64(x_m * y_m))) / z);
	else
		tmp = Float64(Float64(y_m * Float64(cosh(x_m) / z)) / x_m);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if ((cosh(x_m) * (y_m / x_m)) <= 4e+283)
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z;
	else
		tmp = (y_m * (cosh(x_m) / z)) / x_m;
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision], 4e+283], N[(N[(N[(y$95$m / x$95$m), $MachinePrecision] + N[(0.5 * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(y$95$m * N[(N[Cosh[x$95$m], $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cosh.f64 x) (/.f64 y x)) < 3.99999999999999982e283

   1. Initial program 97.4%

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

   3. Taylor expanded in x around 0 77.4%

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

   if 3.99999999999999982e283 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 63.2%

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

      1. associate-*l/ 63.2%

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

   3. Simplified 63.2%

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

      1. associate-*r/ 100.0%

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

   6. Applied egg-rr 100.0%

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

4. Final simplification 86.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cosh x \cdot \frac{y}{x} \leq 4 \cdot 10^{+283}:\\ \;\;\;\;\frac{\frac{y}{x} + 0.5 \cdot \left(x \cdot y\right)}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot \frac{\cosh x}{z}}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 89.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ \begin{array}{l} t_0 := \cosh x\_m \cdot \frac{y\_m}{x\_m}\\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq \infty:\\ \;\;\;\;\frac{t\_0}{z}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \left(x\_m \cdot \frac{0.5}{z}\right)\\ \end{array}\right) \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (cosh x_m) (/ y_m x_m))))
   (* y_s (* x_s (if (<= t_0 INFINITY) (/ t_0 z) (* y_m (* x_m (/ 0.5 z))))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = cosh(x_m) * (y_m / x_m);
	double tmp;
	if (t_0 <= ((double) INFINITY)) {
		tmp = t_0 / z;
	} else {
		tmp = y_m * (x_m * (0.5 / z));
	}
	return y_s * (x_s * tmp);
}

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = Math.cosh(x_m) * (y_m / x_m);
	double tmp;
	if (t_0 <= Double.POSITIVE_INFINITY) {
		tmp = t_0 / z;
	} else {
		tmp = y_m * (x_m * (0.5 / z));
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	t_0 = math.cosh(x_m) * (y_m / x_m)
	tmp = 0
	if t_0 <= math.inf:
		tmp = t_0 / z
	else:
		tmp = y_m * (x_m * (0.5 / z))
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(cosh(x_m) * Float64(y_m / x_m))
	tmp = 0.0
	if (t_0 <= Inf)
		tmp = Float64(t_0 / z);
	else
		tmp = Float64(y_m * Float64(x_m * Float64(0.5 / z)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = cosh(x_m) * (y_m / x_m);
	tmp = 0.0;
	if (t_0 <= Inf)
		tmp = t_0 / z;
	else
		tmp = y_m * (x_m * (0.5 / z));
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$0, Infinity], N[(t$95$0 / z), $MachinePrecision], N[(y$95$m * N[(x$95$m * N[(0.5 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cosh.f64 x) (/.f64 y x)) < +inf.0

   1. Initial program 95.3%

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

   if +inf.0 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 0.0%

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

   3. Taylor expanded in x around 0 9.4%

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

   4. Taylor expanded in x around inf 9.4%

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

      1. associate-*r/ 9.4%

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

      2. *-commutative 9.4%

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

   6. Simplified 9.4%

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

      1. *-commutative 9.4%

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

      2. associate-*r* 9.4%

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

      3. *-commutative 9.4%

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

      4. associate-*l/ 24.7%

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

      5. *-un-lft-identity 24.7%

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

      6. times-frac 24.7%

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

      7. /-rgt-identity 24.7%

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

   8. Applied egg-rr 24.7%

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

4. Final simplification 86.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cosh x \cdot \frac{y}{x} \leq \infty:\\ \;\;\;\;\frac{\cosh x \cdot \frac{y}{x}}{z}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x \cdot \frac{0.5}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 85.4% accurate, 1.0× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= x_m 8.6e-174) (/ y_m (* x_m z)) (* (/ y_m x_m) (/ (cosh x_m) z))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 8.6e-174) {
		tmp = y_m / (x_m * z);
	} else {
		tmp = (y_m / x_m) * (cosh(x_m) / z);
	}
	return y_s * (x_s * tmp);
}

Fortran

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

Java

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

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if x_m <= 8.6e-174:
		tmp = y_m / (x_m * z)
	else:
		tmp = (y_m / x_m) * (math.cosh(x_m) / z)
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (x_m <= 8.6e-174)
		tmp = Float64(y_m / Float64(x_m * z));
	else
		tmp = Float64(Float64(y_m / x_m) * Float64(cosh(x_m) / z));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (x_m <= 8.6e-174)
		tmp = y_m / (x_m * z);
	else
		tmp = (y_m / x_m) * (cosh(x_m) / z);
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 8.6e-174], N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / x$95$m), $MachinePrecision] * N[(N[Cosh[x$95$m], $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 8.6000000000000006e-174

   1. Initial program 84.0%

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

      1. associate-*l/ 83.9%

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

   3. Simplified 83.9%

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

   5. Taylor expanded in x around 0 55.2%

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

   if 8.6000000000000006e-174 < x

   1. Initial program 83.5%

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

      1. associate-*l/ 83.4%

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

   3. Simplified 83.4%

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

4. Final simplification 66.6%

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

Alternative 4: 66.4% accurate, 6.7× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (*
   x_s
   (if (<= x_m 1.15e-173)
     (/ y_m (* x_m z))
     (/ (+ (/ y_m x_m) (* 0.5 (* x_m y_m))) z)))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.15e-173) {
		tmp = y_m / (x_m * z);
	} else {
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z;
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 1.15d-173) then
        tmp = y_m / (x_m * z)
    else
        tmp = ((y_m / x_m) + (0.5d0 * (x_m * y_m))) / z
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.15e-173) {
		tmp = y_m / (x_m * z);
	} else {
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z;
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if x_m <= 1.15e-173:
		tmp = y_m / (x_m * z)
	else:
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (x_m <= 1.15e-173)
		tmp = Float64(y_m / Float64(x_m * z));
	else
		tmp = Float64(Float64(Float64(y_m / x_m) + Float64(0.5 * Float64(x_m * y_m))) / z);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (x_m <= 1.15e-173)
		tmp = y_m / (x_m * z);
	else
		tmp = ((y_m / x_m) + (0.5 * (x_m * y_m))) / z;
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 1.15e-173], N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y$95$m / x$95$m), $MachinePrecision] + N[(0.5 * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.14999999999999994e-173

   1. Initial program 84.0%

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

      1. associate-*l/ 83.9%

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

   3. Simplified 83.9%

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

   5. Taylor expanded in x around 0 55.2%

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

   if 1.14999999999999994e-173 < x

   1. Initial program 83.5%

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

   3. Taylor expanded in x around 0 55.0%

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

4. Final simplification 55.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.15 \cdot 10^{-173}:\\ \;\;\;\;\frac{y}{x \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{y}{x} + 0.5 \cdot \left(x \cdot y\right)}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 62.5% accurate, 8.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 1.4:\\ \;\;\;\;\frac{\frac{y\_m}{z}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(x\_m \cdot \frac{y\_m}{z}\right)\\ \end{array}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (if (<= x_m 1.4) (/ (/ y_m z) x_m) (* 0.5 (* x_m (/ y_m z)))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = 0.5 * (x_m * (y_m / z));
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 1.4d0) then
        tmp = (y_m / z) / x_m
    else
        tmp = 0.5d0 * (x_m * (y_m / z))
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = 0.5 * (x_m * (y_m / z));
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if x_m <= 1.4:
		tmp = (y_m / z) / x_m
	else:
		tmp = 0.5 * (x_m * (y_m / z))
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (x_m <= 1.4)
		tmp = Float64(Float64(y_m / z) / x_m);
	else
		tmp = Float64(0.5 * Float64(x_m * Float64(y_m / z)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (x_m <= 1.4)
		tmp = (y_m / z) / x_m;
	else
		tmp = 0.5 * (x_m * (y_m / z));
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 1.4], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], N[(0.5 * N[(x$95$m * N[(y$95$m / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.3999999999999999

   1. Initial program 86.0%

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

      1. associate-*l/ 85.8%

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

   3. Simplified 85.8%

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

      1. associate-*r/ 96.1%

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

   6. Applied egg-rr 96.1%

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

   7. Taylor expanded in x around 0 65.1%

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

   if 1.3999999999999999 < x

   1. Initial program 77.6%

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

   3. Taylor expanded in x around 0 33.8%

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

   4. Taylor expanded in x around inf 33.8%

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

      1. associate-*r/ 33.8%

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

      2. *-commutative 33.8%

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

   6. Simplified 33.8%

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

      1. *-commutative 33.8%

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

      2. associate-*r* 33.8%

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

      3. *-commutative 33.8%

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

      4. associate-*r/ 28.0%

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

      5. *-commutative 28.0%

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

      6. associate-*l* 28.0%

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

   8. Applied egg-rr 28.0%

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

4. Final simplification 55.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.4:\\ \;\;\;\;\frac{\frac{y}{z}}{x}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(x \cdot \frac{y}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 65.8% accurate, 8.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 1.4:\\ \;\;\;\;\frac{\frac{y\_m}{z}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{y\_m}{\frac{z}{x\_m}}\\ \end{array}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (if (<= x_m 1.4) (/ (/ y_m z) x_m) (* 0.5 (/ y_m (/ z x_m)))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = 0.5 * (y_m / (z / x_m));
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 1.4d0) then
        tmp = (y_m / z) / x_m
    else
        tmp = 0.5d0 * (y_m / (z / x_m))
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = 0.5 * (y_m / (z / x_m));
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if x_m <= 1.4:
		tmp = (y_m / z) / x_m
	else:
		tmp = 0.5 * (y_m / (z / x_m))
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (x_m <= 1.4)
		tmp = Float64(Float64(y_m / z) / x_m);
	else
		tmp = Float64(0.5 * Float64(y_m / Float64(z / x_m)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (x_m <= 1.4)
		tmp = (y_m / z) / x_m;
	else
		tmp = 0.5 * (y_m / (z / x_m));
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 1.4], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], N[(0.5 * N[(y$95$m / N[(z / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.3999999999999999

   1. Initial program 86.0%

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

      1. associate-*l/ 85.8%

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

   3. Simplified 85.8%

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

      1. associate-*r/ 96.1%

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

   6. Applied egg-rr 96.1%

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

   7. Taylor expanded in x around 0 65.1%

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

   if 1.3999999999999999 < x

   1. Initial program 77.6%

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

   3. Taylor expanded in x around 0 33.8%

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

   4. Taylor expanded in x around inf 33.8%

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

      1. associate-*r/ 33.8%

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

      2. *-commutative 33.8%

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

   6. Simplified 33.8%

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

      1. *-commutative 33.8%

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

      2. associate-*r* 33.8%

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

      3. *-commutative 33.8%

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

      4. associate-*r/ 28.0%

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

      5. *-commutative 28.0%

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

      6. associate-*l* 28.0%

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

   8. Applied egg-rr 28.0%

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

   9. Taylor expanded in x around 0 33.8%

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

       1. *-commutative 33.8%

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

       2. associate-/l* 32.2%

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

   11. Simplified 32.2%

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

4. Final simplification 56.5%

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

Alternative 7: 66.4% accurate, 8.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 1.4:\\ \;\;\;\;\frac{\frac{y\_m}{z}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \left(x\_m \cdot \frac{0.5}{z}\right)\\ \end{array}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (if (<= x_m 1.4) (/ (/ y_m z) x_m) (* y_m (* x_m (/ 0.5 z)))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = y_m * (x_m * (0.5 / z));
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 1.4d0) then
        tmp = (y_m / z) / x_m
    else
        tmp = y_m * (x_m * (0.5d0 / z))
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = y_m * (x_m * (0.5 / z));
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if x_m <= 1.4:
		tmp = (y_m / z) / x_m
	else:
		tmp = y_m * (x_m * (0.5 / z))
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (x_m <= 1.4)
		tmp = Float64(Float64(y_m / z) / x_m);
	else
		tmp = Float64(y_m * Float64(x_m * Float64(0.5 / z)));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (x_m <= 1.4)
		tmp = (y_m / z) / x_m;
	else
		tmp = y_m * (x_m * (0.5 / z));
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 1.4], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], N[(y$95$m * N[(x$95$m * N[(0.5 / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.3999999999999999

   1. Initial program 86.0%

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

      1. associate-*l/ 85.8%

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

   3. Simplified 85.8%

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

      1. associate-*r/ 96.1%

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

   6. Applied egg-rr 96.1%

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

   7. Taylor expanded in x around 0 65.1%

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

   if 1.3999999999999999 < x

   1. Initial program 77.6%

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

   3. Taylor expanded in x around 0 33.8%

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

   4. Taylor expanded in x around inf 33.8%

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

      1. associate-*r/ 33.8%

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

      2. *-commutative 33.8%

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

   6. Simplified 33.8%

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

      1. *-commutative 33.8%

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

      2. associate-*r* 33.8%

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

      3. *-commutative 33.8%

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

      4. associate-*l/ 32.2%

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

      5. *-un-lft-identity 32.2%

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

      6. times-frac 32.2%

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

      7. /-rgt-identity 32.2%

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

   8. Applied egg-rr 32.2%

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

4. Final simplification 56.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.4:\\ \;\;\;\;\frac{\frac{y}{z}}{x}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x \cdot \frac{0.5}{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 66.3% accurate, 8.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 1.4:\\ \;\;\;\;\frac{\frac{y\_m}{z}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{z} \cdot \left(x\_m \cdot y\_m\right)\\ \end{array}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (if (<= x_m 1.4) (/ (/ y_m z) x_m) (* (/ 0.5 z) (* x_m y_m))))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = (0.5 / z) * (x_m * y_m);
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 1.4d0) then
        tmp = (y_m / z) / x_m
    else
        tmp = (0.5d0 / z) * (x_m * y_m)
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = (0.5 / z) * (x_m * y_m);
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if x_m <= 1.4:
		tmp = (y_m / z) / x_m
	else:
		tmp = (0.5 / z) * (x_m * y_m)
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (x_m <= 1.4)
		tmp = Float64(Float64(y_m / z) / x_m);
	else
		tmp = Float64(Float64(0.5 / z) * Float64(x_m * y_m));
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (x_m <= 1.4)
		tmp = (y_m / z) / x_m;
	else
		tmp = (0.5 / z) * (x_m * y_m);
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 1.4], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(0.5 / z), $MachinePrecision] * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.3999999999999999

   1. Initial program 86.0%

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

      1. associate-*l/ 85.8%

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

   3. Simplified 85.8%

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

      1. associate-*r/ 96.1%

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

   6. Applied egg-rr 96.1%

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

   7. Taylor expanded in x around 0 65.1%

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

   if 1.3999999999999999 < x

   1. Initial program 77.6%

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

   3. Taylor expanded in x around 0 33.8%

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

   4. Taylor expanded in x around inf 33.8%

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

      1. associate-*r/ 33.8%

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

      2. *-commutative 33.8%

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

   6. Simplified 33.8%

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

      1. associate-/l* 33.8%

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

      2. associate-/r/ 33.8%

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

   8. Applied egg-rr 33.8%

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

4. Final simplification 56.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.4:\\ \;\;\;\;\frac{\frac{y}{z}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{z} \cdot \left(x \cdot y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 66.3% accurate, 8.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ y_m = \left|y\right| \\ y_s = \mathsf{copysign}\left(1, y\right) \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 1.4:\\ \;\;\;\;\frac{\frac{y\_m}{z}}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5 \cdot \left(x\_m \cdot y\_m\right)}{z}\\ \end{array}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (if (<= x_m 1.4) (/ (/ y_m z) x_m) (/ (* 0.5 (* x_m y_m)) z)))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
y_m = fabs(y);
y_s = copysign(1.0, y);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = (0.5 * (x_m * y_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
y_m = abs(y)
y_s = copysign(1.0d0, y)
real(8) function code(y_s, x_s, x_m, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 1.4d0) then
        tmp = (y_m / z) / x_m
    else
        tmp = (0.5d0 * (x_m * y_m)) / z
    end if
    code = y_s * (x_s * tmp)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
y_m = Math.abs(y);
y_s = Math.copySign(1.0, y);
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (x_m <= 1.4) {
		tmp = (y_m / z) / x_m;
	} else {
		tmp = (0.5 * (x_m * y_m)) / z;
	}
	return y_s * (x_s * tmp);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
y_m = math.fabs(y)
y_s = math.copysign(1.0, y)
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if x_m <= 1.4:
		tmp = (y_m / z) / x_m
	else:
		tmp = (0.5 * (x_m * y_m)) / z
	return y_s * (x_s * tmp)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
y_m = abs(y)
y_s = copysign(1.0, y)
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (x_m <= 1.4)
		tmp = Float64(Float64(y_m / z) / x_m);
	else
		tmp = Float64(Float64(0.5 * Float64(x_m * y_m)) / z);
	end
	return Float64(y_s * Float64(x_s * tmp))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (x_m <= 1.4)
		tmp = (y_m / z) / x_m;
	else
		tmp = (0.5 * (x_m * y_m)) / z;
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[x$95$m, 1.4], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], N[(N[(0.5 * N[(x$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.3999999999999999

   1. Initial program 86.0%

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

      1. associate-*l/ 85.8%

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

   3. Simplified 85.8%

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

      1. associate-*r/ 96.1%

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

   6. Applied egg-rr 96.1%

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

   7. Taylor expanded in x around 0 65.1%

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

   if 1.3999999999999999 < x

   1. Initial program 77.6%

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

   3. Taylor expanded in x around 0 33.8%

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

   4. Taylor expanded in x around inf 33.8%

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

      1. associate-*r/ 33.8%

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

      2. *-commutative 33.8%

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

   6. Simplified 33.8%

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

4. Final simplification 56.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.4:\\ \;\;\;\;\frac{\frac{y}{z}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5 \cdot \left(x \cdot y\right)}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 52.7% accurate, 10.7× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (if (<= y_m 3e+86) (/ (/ y_m x_m) z) (/ y_m (* x_m z))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (y_m <= 3e+86)
		tmp = (y_m / x_m) / z;
	else
		tmp = y_m / (x_m * z);
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[y$95$m, 3e+86], N[(N[(y$95$m / x$95$m), $MachinePrecision] / z), $MachinePrecision], N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 2.99999999999999977e86

   1. Initial program 82.1%

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

   3. Taylor expanded in x around 0 48.7%

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

   if 2.99999999999999977e86 < y

   1. Initial program 90.9%

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

      1. associate-*l/ 90.8%

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

   3. Simplified 90.8%

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

   5. Taylor expanded in x around 0 57.3%

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

4. Final simplification 50.4%

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

Alternative 11: 55.2% accurate, 10.7× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
y_m = (fabs.f64 y)
y_s = (copysign.f64 1 y)
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (if (<= z 6e-57) (/ (/ y_m z) x_m) (/ y_m (* x_m z))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (z <= 6e-57)
		tmp = (y_m / z) / x_m;
	else
		tmp = y_m / (x_m * z);
	end
	tmp_2 = y_s * (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[z, 6e-57], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision], N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 6.00000000000000001e-57

   1. Initial program 85.3%

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

      1. associate-*l/ 85.2%

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

   3. Simplified 85.2%

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

      1. associate-*r/ 97.5%

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

   6. Applied egg-rr 97.5%

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

   7. Taylor expanded in x around 0 56.9%

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

   if 6.00000000000000001e-57 < z

   1. Initial program 80.0%

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

      1. associate-*l/ 79.8%

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

   3. Simplified 79.8%

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

   5. Taylor expanded in x around 0 46.1%

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

4. Final simplification 53.8%

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

Alternative 12: 49.4% accurate, 21.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
y_m = abs(y);
y_s = sign(y) * abs(1.0);
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * (y_m / (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]
y_m = N[Abs[y], $MachinePrecision]
y_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 83.8%

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

   1. associate-*l/ 83.7%

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

3. Simplified 83.7%

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

5. Taylor expanded in x around 0 49.3%

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

6. Final simplification 49.3%

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

Developer target: 97.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\frac{y}{z}}{x} \cdot \cosh x\\ \mathbf{if}\;y < -4.618902267687042 \cdot 10^{-52}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y < 1.038530535935153 \cdot 10^{-39}:\\ \;\;\;\;\frac{\frac{\cosh x \cdot y}{x}}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (/ (/ y z) x) (cosh x))))
   (if (< y -4.618902267687042e-52)
     t_0
     (if (< y 1.038530535935153e-39) (/ (/ (* (cosh x) y) x) z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((y / z) / x) * cosh(x);
	double tmp;
	if (y < -4.618902267687042e-52) {
		tmp = t_0;
	} else if (y < 1.038530535935153e-39) {
		tmp = ((cosh(x) * y) / x) / z;
	} else {
		tmp = t_0;
	}
	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) :: tmp
    t_0 = ((y / z) / x) * cosh(x)
    if (y < (-4.618902267687042d-52)) then
        tmp = t_0
    else if (y < 1.038530535935153d-39) then
        tmp = ((cosh(x) * y) / x) / z
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = ((y / z) / x) * Math.cosh(x);
	double tmp;
	if (y < -4.618902267687042e-52) {
		tmp = t_0;
	} else if (y < 1.038530535935153e-39) {
		tmp = ((Math.cosh(x) * y) / x) / z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = ((y / z) / x) * math.cosh(x)
	tmp = 0
	if y < -4.618902267687042e-52:
		tmp = t_0
	elif y < 1.038530535935153e-39:
		tmp = ((math.cosh(x) * y) / x) / z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(y / z) / x) * cosh(x))
	tmp = 0.0
	if (y < -4.618902267687042e-52)
		tmp = t_0;
	elseif (y < 1.038530535935153e-39)
		tmp = Float64(Float64(Float64(cosh(x) * y) / x) / z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = ((y / z) / x) * cosh(x);
	tmp = 0.0;
	if (y < -4.618902267687042e-52)
		tmp = t_0;
	elseif (y < 1.038530535935153e-39)
		tmp = ((cosh(x) * y) / x) / z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(y / z), $MachinePrecision] / x), $MachinePrecision] * N[Cosh[x], $MachinePrecision]), $MachinePrecision]}, If[Less[y, -4.618902267687042e-52], t$95$0, If[Less[y, 1.038530535935153e-39], N[(N[(N[(N[Cosh[x], $MachinePrecision] * y), $MachinePrecision] / x), $MachinePrecision] / z), $MachinePrecision], t$95$0]]]

Reproduce

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

  :herbie-target
  (if (< y -4.618902267687042e-52) (* (/ (/ y z) x) (cosh x)) (if (< y 1.038530535935153e-39) (/ (/ (* (cosh x) y) x) z) (* (/ (/ y z) x) (cosh x))))

  (/ (* (cosh x) (/ y x)) z))