Linear.Quaternion:$ctan from linear-1.19.1.3

Percentage Accurate: 85.2% → 99.8%

Time: 4.8s

Alternatives: 8

Speedup: 0.8×

• 63.7% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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.2% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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.8% accurate, 0.8× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (*
  y_s
  (if (<= y_m 1e-60)
    (/ (* y_m (/ (cosh x) x)) z)
    (/ (/ (* y_m (cosh x)) z) x))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (y_m <= 1e-60) {
		tmp = (y_m * (cosh(x) / x)) / z;
	} else {
		tmp = ((y_m * cosh(x)) / z) / x;
	}
	return y_s * tmp;
}

Fortran

y\_m =     private
y\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y_m <= 1d-60) then
        tmp = (y_m * (cosh(x) / x)) / z
    else
        tmp = ((y_m * cosh(x)) / z) / x
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (y_m <= 1e-60) {
		tmp = (y_m * (Math.cosh(x) / x)) / z;
	} else {
		tmp = ((y_m * Math.cosh(x)) / z) / x;
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	tmp = 0
	if y_m <= 1e-60:
		tmp = (y_m * (math.cosh(x) / x)) / z
	else:
		tmp = ((y_m * math.cosh(x)) / z) / x
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (y_m <= 1e-60)
		tmp = Float64(Float64(y_m * Float64(cosh(x) / x)) / z);
	else
		tmp = Float64(Float64(Float64(y_m * cosh(x)) / z) / x);
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if (y_m <= 1e-60)
		tmp = (y_m * (cosh(x) / x)) / z;
	else
		tmp = ((y_m * cosh(x)) / z) / x;
	end
	tmp_2 = y_s * tmp;
end

Wolfram

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_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[y$95$m, 1e-60], N[(N[(y$95$m * N[(N[Cosh[x], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(N[(y$95$m * N[Cosh[x], $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / x), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 9.9999999999999997e-61

   1. Initial program 85.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 95.8

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

   3. Applied rewrites 95.8%

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

   if 9.9999999999999997e-61 < y

   1. Initial program 85.2%

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

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. associate-*r/ N/A

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

      6. associate-*l/ N/A

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

      7. lower-/.f64 N/A

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

      8. mult-flip-rev N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 95.9

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

   3. Applied rewrites 95.9%

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

Alternative 2: 72.3% accurate, 0.8× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (*
  y_s
  (if (<= x 2.6e-92) (* y_m (/ (/ 1.0 z) x)) (/ (* y_m (/ (cosh x) x)) z))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (x <= 2.6e-92) {
		tmp = y_m * ((1.0 / z) / x);
	} else {
		tmp = (y_m * (cosh(x) / x)) / z;
	}
	return y_s * tmp;
}

Fortran

y\_m =     private
y\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= 2.6d-92) then
        tmp = y_m * ((1.0d0 / z) / x)
    else
        tmp = (y_m * (cosh(x) / x)) / z
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (x <= 2.6e-92) {
		tmp = y_m * ((1.0 / z) / x);
	} else {
		tmp = (y_m * (Math.cosh(x) / x)) / z;
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	tmp = 0
	if x <= 2.6e-92:
		tmp = y_m * ((1.0 / z) / x)
	else:
		tmp = (y_m * (math.cosh(x) / x)) / z
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (x <= 2.6e-92)
		tmp = Float64(y_m * Float64(Float64(1.0 / z) / x));
	else
		tmp = Float64(Float64(y_m * Float64(cosh(x) / x)) / z);
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if (x <= 2.6e-92)
		tmp = y_m * ((1.0 / z) / x);
	else
		tmp = (y_m * (cosh(x) / x)) / z;
	end
	tmp_2 = y_s * tmp;
end

Wolfram

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_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[x, 2.6e-92], N[(y$95$m * N[(N[(1.0 / z), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m * N[(N[Cosh[x], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 2.6e-92

   1. Initial program 85.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. associate-/l/ N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 83.5

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

   3. Applied rewrites 83.5%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 49.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 49.8

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

   8. Applied rewrites 49.8%

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

   if 2.6e-92 < x

   1. Initial program 85.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 95.8

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

   3. Applied rewrites 95.8%

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

Alternative 3: 72.3% accurate, 0.5× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (*
  y_s
  (if (<= (* (cosh x) (/ y_m x)) 1e+136)
    (/ (/ 1.0 z) (/ x y_m))
    (* y_m (/ (cosh x) (* z x))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((cosh(x) * (y_m / x)) <= 1e+136) {
		tmp = (1.0 / z) / (x / y_m);
	} else {
		tmp = y_m * (cosh(x) / (z * x));
	}
	return y_s * tmp;
}

Fortran

y\_m =     private
y\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((cosh(x) * (y_m / x)) <= 1d+136) then
        tmp = (1.0d0 / z) / (x / y_m)
    else
        tmp = y_m * (cosh(x) / (z * x))
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((Math.cosh(x) * (y_m / x)) <= 1e+136) {
		tmp = (1.0 / z) / (x / y_m);
	} else {
		tmp = y_m * (Math.cosh(x) / (z * x));
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	tmp = 0
	if (math.cosh(x) * (y_m / x)) <= 1e+136:
		tmp = (1.0 / z) / (x / y_m)
	else:
		tmp = y_m * (math.cosh(x) / (z * x))
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (Float64(cosh(x) * Float64(y_m / x)) <= 1e+136)
		tmp = Float64(Float64(1.0 / z) / Float64(x / y_m));
	else
		tmp = Float64(y_m * Float64(cosh(x) / Float64(z * x)));
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if ((cosh(x) * (y_m / x)) <= 1e+136)
		tmp = (1.0 / z) / (x / y_m);
	else
		tmp = y_m * (cosh(x) / (z * x));
	end
	tmp_2 = y_s * tmp;
end

Wolfram

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_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[N[(N[Cosh[x], $MachinePrecision] * N[(y$95$m / x), $MachinePrecision]), $MachinePrecision], 1e+136], N[(N[(1.0 / z), $MachinePrecision] / N[(x / y$95$m), $MachinePrecision]), $MachinePrecision], N[(y$95$m * N[(N[Cosh[x], $MachinePrecision] / N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cosh.f64 x) (/.f64 y x)) < 1.00000000000000006e136

   1. Initial program 85.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. associate-/l/ N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 83.5

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

   3. Applied rewrites 83.5%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 49.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. associate-*l* N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/r* N/A

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

      8. associate-/r/ N/A

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

      9. lift-/.f64 N/A

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

      10. associate-*r/ N/A

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

      11. mult-flip N/A

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

      12. lower-/.f64 N/A

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

      13. lower-/.f64 50.4

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

   8. Applied rewrites 50.4%

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

   if 1.00000000000000006e136 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 85.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. associate-/l/ N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 83.5

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

   3. Applied rewrites 83.5%

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

Alternative 4: 58.0% accurate, 0.7× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (*
  y_s
  (if (<= (* (cosh x) (/ y_m x)) 5e+127)
    (/ (/ 1.0 z) (/ x y_m))
    (/ (/ y_m z) x))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((cosh(x) * (y_m / x)) <= 5e+127) {
		tmp = (1.0 / z) / (x / y_m);
	} else {
		tmp = (y_m / z) / x;
	}
	return y_s * tmp;
}

Fortran

y\_m =     private
y\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((cosh(x) * (y_m / x)) <= 5d+127) then
        tmp = (1.0d0 / z) / (x / y_m)
    else
        tmp = (y_m / z) / x
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((Math.cosh(x) * (y_m / x)) <= 5e+127) {
		tmp = (1.0 / z) / (x / y_m);
	} else {
		tmp = (y_m / z) / x;
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	tmp = 0
	if (math.cosh(x) * (y_m / x)) <= 5e+127:
		tmp = (1.0 / z) / (x / y_m)
	else:
		tmp = (y_m / z) / x
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (Float64(cosh(x) * Float64(y_m / x)) <= 5e+127)
		tmp = Float64(Float64(1.0 / z) / Float64(x / y_m));
	else
		tmp = Float64(Float64(y_m / z) / x);
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if ((cosh(x) * (y_m / x)) <= 5e+127)
		tmp = (1.0 / z) / (x / y_m);
	else
		tmp = (y_m / z) / x;
	end
	tmp_2 = y_s * tmp;
end

Wolfram

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_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[N[(N[Cosh[x], $MachinePrecision] * N[(y$95$m / x), $MachinePrecision]), $MachinePrecision], 5e+127], N[(N[(1.0 / z), $MachinePrecision] / N[(x / y$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / z), $MachinePrecision] / x), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cosh.f64 x) (/.f64 y x)) < 5.0000000000000004e127

   1. Initial program 85.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. associate-/l/ N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 83.5

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

   3. Applied rewrites 83.5%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 49.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. associate-*l* N/A

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

      6. lift-*.f64 N/A

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

      7. associate-/r* N/A

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

      8. associate-/r/ N/A

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

      9. lift-/.f64 N/A

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

      10. associate-*r/ N/A

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

      11. mult-flip N/A

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

      12. lower-/.f64 N/A

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

      13. lower-/.f64 50.4

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

   8. Applied rewrites 50.4%

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

   if 5.0000000000000004e127 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 85.2%

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

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. associate-*r/ N/A

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

      6. associate-*l/ N/A

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

      7. lower-/.f64 N/A

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

      8. mult-flip-rev N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 95.9

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

   3. Applied rewrites 95.9%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 54.1%

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

Alternative 5: 54.1% accurate, 0.7× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (*
  y_s
  (if (<= (* (cosh x) (/ y_m x)) 1e+137)
    (/ (* y_m (/ 1.0 x)) z)
    (/ (/ y_m z) x))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((cosh(x) * (y_m / x)) <= 1e+137) {
		tmp = (y_m * (1.0 / x)) / z;
	} else {
		tmp = (y_m / z) / x;
	}
	return y_s * tmp;
}

Fortran

y\_m =     private
y\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((cosh(x) * (y_m / x)) <= 1d+137) then
        tmp = (y_m * (1.0d0 / x)) / z
    else
        tmp = (y_m / z) / x
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((Math.cosh(x) * (y_m / x)) <= 1e+137) {
		tmp = (y_m * (1.0 / x)) / z;
	} else {
		tmp = (y_m / z) / x;
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	tmp = 0
	if (math.cosh(x) * (y_m / x)) <= 1e+137:
		tmp = (y_m * (1.0 / x)) / z
	else:
		tmp = (y_m / z) / x
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (Float64(cosh(x) * Float64(y_m / x)) <= 1e+137)
		tmp = Float64(Float64(y_m * Float64(1.0 / x)) / z);
	else
		tmp = Float64(Float64(y_m / z) / x);
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if ((cosh(x) * (y_m / x)) <= 1e+137)
		tmp = (y_m * (1.0 / x)) / z;
	else
		tmp = (y_m / z) / x;
	end
	tmp_2 = y_s * tmp;
end

Wolfram

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_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[N[(N[Cosh[x], $MachinePrecision] * N[(y$95$m / x), $MachinePrecision]), $MachinePrecision], 1e+137], N[(N[(y$95$m * N[(1.0 / x), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(y$95$m / z), $MachinePrecision] / x), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cosh.f64 x) (/.f64 y x)) < 1e137

   1. Initial program 85.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 95.8

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

   3. Applied rewrites 95.8%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 50.1%

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

   if 1e137 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 85.2%

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

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. associate-*r/ N/A

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

      6. associate-*l/ N/A

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

      7. lower-/.f64 N/A

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

      8. mult-flip-rev N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 95.9

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

   3. Applied rewrites 95.9%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 54.1%

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

Alternative 6: 54.1% accurate, 1.8× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (* y_s (if (<= y_m 3.2e-36) (/ (/ y_m x) z) (/ (/ y_m z) x))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (y_m <= 3.2e-36) {
		tmp = (y_m / x) / z;
	} else {
		tmp = (y_m / z) / x;
	}
	return y_s * tmp;
}

Fortran

y\_m =     private
y\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y_m <= 3.2d-36) then
        tmp = (y_m / x) / z
    else
        tmp = (y_m / z) / x
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (y_m <= 3.2e-36) {
		tmp = (y_m / x) / z;
	} else {
		tmp = (y_m / z) / x;
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	tmp = 0
	if y_m <= 3.2e-36:
		tmp = (y_m / x) / z
	else:
		tmp = (y_m / z) / x
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (y_m <= 3.2e-36)
		tmp = Float64(Float64(y_m / x) / z);
	else
		tmp = Float64(Float64(y_m / z) / x);
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if (y_m <= 3.2e-36)
		tmp = (y_m / x) / z;
	else
		tmp = (y_m / z) / x;
	end
	tmp_2 = y_s * tmp;
end

Wolfram

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_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[y$95$m, 3.2e-36], N[(N[(y$95$m / x), $MachinePrecision] / z), $MachinePrecision], N[(N[(y$95$m / z), $MachinePrecision] / x), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 3.20000000000000021e-36

   1. Initial program 85.2%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 50.1

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

   4. Applied rewrites 50.1%

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

   if 3.20000000000000021e-36 < y

   1. Initial program 85.2%

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

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. associate-*r/ N/A

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

      6. associate-*l/ N/A

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

      7. lower-/.f64 N/A

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

      8. mult-flip-rev N/A

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

      9. lower-/.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 95.9

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

   3. Applied rewrites 95.9%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 54.1%

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

Alternative 7: 52.3% accurate, 0.7× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (*
  y_s
  (if (<= (* (cosh x) (/ y_m x)) 5e+229) (/ (/ y_m x) z) (/ y_m (* x z)))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((cosh(x) * (y_m / x)) <= 5e+229) {
		tmp = (y_m / x) / z;
	} else {
		tmp = y_m / (x * z);
	}
	return y_s * tmp;
}

Fortran

y\_m =     private
y\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((cosh(x) * (y_m / x)) <= 5d+229) then
        tmp = (y_m / x) / z
    else
        tmp = y_m / (x * z)
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((Math.cosh(x) * (y_m / x)) <= 5e+229) {
		tmp = (y_m / x) / z;
	} else {
		tmp = y_m / (x * z);
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	tmp = 0
	if (math.cosh(x) * (y_m / x)) <= 5e+229:
		tmp = (y_m / x) / z
	else:
		tmp = y_m / (x * z)
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (Float64(cosh(x) * Float64(y_m / x)) <= 5e+229)
		tmp = Float64(Float64(y_m / x) / z);
	else
		tmp = Float64(y_m / Float64(x * z));
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if ((cosh(x) * (y_m / x)) <= 5e+229)
		tmp = (y_m / x) / z;
	else
		tmp = y_m / (x * z);
	end
	tmp_2 = y_s * tmp;
end

Wolfram

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_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[N[(N[Cosh[x], $MachinePrecision] * N[(y$95$m / x), $MachinePrecision]), $MachinePrecision], 5e+229], N[(N[(y$95$m / x), $MachinePrecision] / z), $MachinePrecision], N[(y$95$m / N[(x * z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cosh.f64 x) (/.f64 y x)) < 5.0000000000000005e229

   1. Initial program 85.2%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 50.1

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

   4. Applied rewrites 50.1%

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

   if 5.0000000000000005e229 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 85.2%

      \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 50.3

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

   4. Applied rewrites 50.3%

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

Alternative 8: 50.3% accurate, 2.9× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z) :precision binary64 (* y_s (/ y_m (* x z))))

C

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

Fortran

y\_m =     private
y\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(y_s, x, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = y_s * (y_m / (x * z))
end function

Java

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

Python

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

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	return Float64(y_s * Float64(y_m / Float64(x * z)))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp = code(y_s, x, y_m, z)
	tmp = y_s * (y_m / (x * z));
end

Wolfram

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_, y$95$m_, z_] := N[(y$95$s * N[(y$95$m / N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 85.2%

   \[\frac{\cosh x \cdot \frac{y}{x}}{z} \]

2. Taylor expanded in x around 0

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

   1. lower-/.f64 N/A

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

   2. lower-*.f64 50.3

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

4. Applied rewrites 50.3%

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

Reproduce

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