Linear.Quaternion:$ctan from linear-1.19.1.3

Percentage Accurate: 84.7% → 99.8%

Time: 6.3s

Alternatives: 8

Speedup: 0.5×

• 64.6% 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: 84.7% 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.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 10^{+267}:\\ \;\;\;\;\frac{t\_0}{z}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \frac{\frac{\cosh x\_m}{x\_m}}{z}\\ \end{array}\right) \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) 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 1e+267) (/ t_0 z) (* y_m (/ (/ (cosh x_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 t_0 = cosh(x_m) * (y_m / x_m);
	double tmp;
	if (t_0 <= 1e+267) {
		tmp = t_0 / z;
	} else {
		tmp = y_m * ((cosh(x_m) / x_m) / z);
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y_m, z)
use fmin_fmax_functions
    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) :: t_0
    real(8) :: tmp
    t_0 = cosh(x_m) * (y_m / x_m)
    if (t_0 <= 1d+267) then
        tmp = t_0 / z
    else
        tmp = y_m * ((cosh(x_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 t_0 = Math.cosh(x_m) * (y_m / x_m);
	double tmp;
	if (t_0 <= 1e+267) {
		tmp = t_0 / z;
	} else {
		tmp = y_m * ((Math.cosh(x_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):
	t_0 = math.cosh(x_m) * (y_m / x_m)
	tmp = 0
	if t_0 <= 1e+267:
		tmp = t_0 / z
	else:
		tmp = y_m * ((math.cosh(x_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)
	t_0 = Float64(cosh(x_m) * Float64(y_m / x_m))
	tmp = 0.0
	if (t_0 <= 1e+267)
		tmp = Float64(t_0 / z);
	else
		tmp = Float64(y_m * Float64(Float64(cosh(x_m) / 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)
	t_0 = cosh(x_m) * (y_m / x_m);
	tmp = 0.0;
	if (t_0 <= 1e+267)
		tmp = t_0 / z;
	else
		tmp = y_m * ((cosh(x_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_] := 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, 1e+267], N[(t$95$0 / z), $MachinePrecision], N[(y$95$m * N[(N[(N[Cosh[x$95$m], $MachinePrecision] / x$95$m), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cosh.f64 x) (/.f64 y x)) < 9.9999999999999997e266

   1. Initial program 84.7%

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

   if 9.9999999999999997e266 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 84.7%

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

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

   3. Applied rewrites 83.0%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 95.9

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

   5. Applied rewrites 95.9%

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

Alternative 2: 92.0% 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}\;\frac{\cosh x\_m \cdot \frac{y\_m}{x\_m}}{z} \leq 2 \cdot 10^{-36}:\\ \;\;\;\;\frac{y\_m}{x\_m \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{y\_m \cdot \cosh x\_m}{z}}{x\_m}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) 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)) z) 2e-36)
     (/ y_m (* x_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)) / z) <= 2e-36) {
		tmp = y_m / (x_m * z);
	} else {
		tmp = ((y_m * cosh(x_m)) / z) / x_m;
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y_m, z)
use fmin_fmax_functions
    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)) / z) <= 2d-36) then
        tmp = y_m / (x_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)) / z) <= 2e-36) {
		tmp = y_m / (x_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)) / z) <= 2e-36:
		tmp = y_m / (x_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(Float64(cosh(x_m) * Float64(y_m / x_m)) / z) <= 2e-36)
		tmp = Float64(y_m / Float64(x_m * z));
	else
		tmp = Float64(Float64(Float64(y_m * 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)) / z) <= 2e-36)
		tmp = y_m / (x_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[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], 2e-36], N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y$95$m * N[Cosh[x$95$m], $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision] / x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (cosh.f64 x) (/.f64 y x)) z) < 1.9999999999999999e-36

   1. Initial program 84.7%

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

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

   4. Applied rewrites 48.7%

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

   if 1.9999999999999999e-36 < (/.f64 (*.f64 (cosh.f64 x) (/.f64 y x)) z)

   1. Initial program 84.7%

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

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

   3. Applied rewrites 96.3%

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

Alternative 3: 86.4% 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}\;\frac{\cosh x\_m \cdot \frac{y\_m}{x\_m}}{z} \leq \infty:\\ \;\;\;\;\frac{\cosh x\_m}{z} \cdot \frac{y\_m}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \frac{\cosh x\_m}{z \cdot x\_m}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) 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)) z) INFINITY)
     (* (/ (cosh x_m) z) (/ y_m x_m))
     (* 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)) / z) <= ((double) INFINITY)) {
		tmp = (cosh(x_m) / z) * (y_m / x_m);
	} else {
		tmp = y_m * (cosh(x_m) / (z * x_m));
	}
	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 tmp;
	if (((Math.cosh(x_m) * (y_m / x_m)) / z) <= Double.POSITIVE_INFINITY) {
		tmp = (Math.cosh(x_m) / z) * (y_m / x_m);
	} 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)) / z) <= math.inf:
		tmp = (math.cosh(x_m) / z) * (y_m / x_m)
	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(Float64(cosh(x_m) * Float64(y_m / x_m)) / z) <= Inf)
		tmp = Float64(Float64(cosh(x_m) / z) * Float64(y_m / x_m));
	else
		tmp = Float64(y_m * Float64(cosh(x_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 (((cosh(x_m) * (y_m / x_m)) / z) <= Inf)
		tmp = (cosh(x_m) / z) * (y_m / x_m);
	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[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], Infinity], N[(N[(N[Cosh[x$95$m], $MachinePrecision] / z), $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision], N[(y$95$m * N[(N[Cosh[x$95$m], $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 84.7%

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

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. mult-flip-rev N/A

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

      9. lower-/.f64 84.7

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

   3. Applied rewrites 84.7%

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

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

   1. Initial program 84.7%

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

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

   3. Applied rewrites 83.0%

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

Alternative 4: 79.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) \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;\cosh x\_m \cdot \frac{y\_m}{x\_m} \leq 1.5 \cdot 10^{+234}:\\ \;\;\;\;\frac{\frac{y\_m}{x\_m}}{z}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \frac{\cosh x\_m}{z \cdot x\_m}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) 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)) 1.5e+234)
     (/ (/ y_m x_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)) <= 1.5e+234) {
		tmp = (y_m / x_m) / z;
	} else {
		tmp = y_m * (cosh(x_m) / (z * x_m));
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y_m, z)
use fmin_fmax_functions
    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)) <= 1.5d+234) then
        tmp = (y_m / x_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)) <= 1.5e+234) {
		tmp = (y_m / x_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)) <= 1.5e+234:
		tmp = (y_m / x_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)) <= 1.5e+234)
		tmp = Float64(Float64(y_m / x_m) / z);
	else
		tmp = Float64(y_m * Float64(cosh(x_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 ((cosh(x_m) * (y_m / x_m)) <= 1.5e+234)
		tmp = (y_m / x_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], 1.5e+234], N[(N[(y$95$m / x$95$m), $MachinePrecision] / z), $MachinePrecision], N[(y$95$m * N[(N[Cosh[x$95$m], $MachinePrecision] / N[(z * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (cosh.f64 x) (/.f64 y x)) < 1.4999999999999999e234

   1. Initial program 84.7%

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

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

   4. Applied rewrites 48.4%

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

   if 1.4999999999999999e234 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 84.7%

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

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

   3. Applied rewrites 83.0%

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

Alternative 5: 52.3% accurate, 0.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}\;\frac{\cosh x\_m \cdot \frac{y\_m}{x\_m}}{z} \leq 2 \cdot 10^{-36}:\\ \;\;\;\;\frac{y\_m}{x\_m \cdot z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{y\_m}{z}}{x\_m}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) 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)) z) 2e-36)
     (/ y_m (* x_m z))
     (/ (/ 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 (((cosh(x_m) * (y_m / x_m)) / z) <= 2e-36) {
		tmp = y_m / (x_m * z);
	} else {
		tmp = (y_m / z) / x_m;
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y_m, z)
use fmin_fmax_functions
    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)) / z) <= 2d-36) then
        tmp = y_m / (x_m * z)
    else
        tmp = (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 (((Math.cosh(x_m) * (y_m / x_m)) / z) <= 2e-36) {
		tmp = y_m / (x_m * z);
	} else {
		tmp = (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 ((math.cosh(x_m) * (y_m / x_m)) / z) <= 2e-36:
		tmp = y_m / (x_m * z)
	else:
		tmp = (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 (Float64(Float64(cosh(x_m) * Float64(y_m / x_m)) / z) <= 2e-36)
		tmp = Float64(y_m / Float64(x_m * z));
	else
		tmp = Float64(Float64(y_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)) / z) <= 2e-36)
		tmp = y_m / (x_m * z);
	else
		tmp = (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[N[(N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], 2e-36], N[(y$95$m / N[(x$95$m * z), $MachinePrecision]), $MachinePrecision], N[(N[(y$95$m / z), $MachinePrecision] / x$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (cosh.f64 x) (/.f64 y x)) z) < 1.9999999999999999e-36

   1. Initial program 84.7%

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

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

   4. Applied rewrites 48.7%

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

   if 1.9999999999999999e-36 < (/.f64 (*.f64 (cosh.f64 x) (/.f64 y x)) z)

   1. Initial program 84.7%

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

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

   3. Applied rewrites 96.3%

      \[\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 52.4%

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

Alternative 6: 52.3% accurate, 0.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}\;\cosh x\_m \cdot \frac{y\_m}{x\_m} \leq 10^{+273}:\\ \;\;\;\;\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 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) 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)) 1e+273)
     (/ (/ 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 ((cosh(x_m) * (y_m / x_m)) <= 1e+273) {
		tmp = (y_m / x_m) / z;
	} else {
		tmp = y_m / (x_m * z);
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y_m, z)
use fmin_fmax_functions
    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)) <= 1d+273) 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 ((Math.cosh(x_m) * (y_m / x_m)) <= 1e+273) {
		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 (math.cosh(x_m) * (y_m / x_m)) <= 1e+273:
		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 (Float64(cosh(x_m) * Float64(y_m / x_m)) <= 1e+273)
		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 ((cosh(x_m) * (y_m / x_m)) <= 1e+273)
		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[N[(N[Cosh[x$95$m], $MachinePrecision] * N[(y$95$m / x$95$m), $MachinePrecision]), $MachinePrecision], 1e+273], 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 (*.f64 (cosh.f64 x) (/.f64 y x)) < 9.99999999999999945e272

   1. Initial program 84.7%

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

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

   4. Applied rewrites 48.4%

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

   if 9.99999999999999945e272 < (*.f64 (cosh.f64 x) (/.f64 y x))

   1. Initial program 84.7%

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

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

   4. Applied rewrites 48.7%

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

Alternative 7: 50.7% accurate, 0.6× 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 \infty:\\ \;\;\;\;\frac{\frac{y\_m}{x\_m}}{z}\\ \mathbf{else}:\\ \;\;\;\;\left(-y\_m\right) \cdot \frac{\frac{-z}{\left(-z\right) \cdot \left(-z\right)}}{x\_m}\\ \end{array}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) 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)) INFINITY)
     (/ (/ y_m x_m) z)
     (* (- y_m) (/ (/ (- z) (* (- z) (- 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)) <= ((double) INFINITY)) {
		tmp = (y_m / x_m) / z;
	} else {
		tmp = -y_m * ((-z / (-z * -z)) / x_m);
	}
	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 tmp;
	if ((Math.cosh(x_m) * (y_m / x_m)) <= Double.POSITIVE_INFINITY) {
		tmp = (y_m / x_m) / z;
	} else {
		tmp = -y_m * ((-z / (-z * -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)) <= math.inf:
		tmp = (y_m / x_m) / z
	else:
		tmp = -y_m * ((-z / (-z * -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)) <= Inf)
		tmp = Float64(Float64(y_m / x_m) / z);
	else
		tmp = Float64(Float64(-y_m) * Float64(Float64(Float64(-z) / Float64(Float64(-z) * 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 ((cosh(x_m) * (y_m / x_m)) <= Inf)
		tmp = (y_m / x_m) / z;
	else
		tmp = -y_m * ((-z / (-z * -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], Infinity], N[(N[(y$95$m / x$95$m), $MachinePrecision] / z), $MachinePrecision], N[((-y$95$m) * N[(N[((-z) / N[((-z) * (-z)), $MachinePrecision]), $MachinePrecision] / x$95$m), $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 84.7%

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

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

   4. Applied rewrites 48.4%

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

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

   1. Initial program 84.7%

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

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

   4. Applied rewrites 48.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. mult-flip N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 52.4

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

   6. Applied rewrites 52.4%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. *-rgt-identity N/A

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

      5. lift-/.f64 N/A

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

      6. frac-2neg N/A

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

      7. mult-flip N/A

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

      8. associate-/l* N/A

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

      9. lower-*.f64 N/A

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

      10. lower-neg.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. metadata-eval N/A

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

      13. frac-2neg-rev N/A

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

      14. lower-/.f64 48.3

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

   8. Applied rewrites 48.3%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. metadata-eval N/A

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

      4. metadata-eval N/A

         \[\leadsto \left(-y\right) \cdot \frac{\frac{1 + 0}{\mathsf{neg}\left(z\right)}}{x} \]

      5. div-add N/A

         \[\leadsto \left(-y\right) \cdot \frac{\frac{1}{\mathsf{neg}\left(z\right)} + \frac{0}{\mathsf{neg}\left(z\right)}}{x} \]

      6. frac-add N/A

         \[\leadsto \left(-y\right) \cdot \frac{\frac{1 \cdot \left(\mathsf{neg}\left(z\right)\right) + \left(\mathsf{neg}\left(z\right)\right) \cdot 0}{\left(\mathsf{neg}\left(z\right)\right) \cdot \left(\mathsf{neg}\left(z\right)\right)}}{x} \]

      7. *-commutative N/A

         \[\leadsto \left(-y\right) \cdot \frac{\frac{\left(\mathsf{neg}\left(z\right)\right) \cdot 1 + \left(\mathsf{neg}\left(z\right)\right) \cdot 0}{\left(\mathsf{neg}\left(z\right)\right) \cdot \left(\mathsf{neg}\left(z\right)\right)}}{x} \]

      8. distribute-lft-in N/A

         \[\leadsto \left(-y\right) \cdot \frac{\frac{\left(\mathsf{neg}\left(z\right)\right) \cdot \left(1 + 0\right)}{\left(\mathsf{neg}\left(z\right)\right) \cdot \left(\mathsf{neg}\left(z\right)\right)}}{x} \]

      9. metadata-eval N/A

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

      10. *-rgt-identity N/A

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

      11. lower-/.f64 N/A

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

      12. lower-neg.f64 N/A

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

      13. lower-*.f64 N/A

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

      14. lower-neg.f64 N/A

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

      15. lower-neg.f64 46.6

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

   10. Applied rewrites 46.6%

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

Alternative 8: 48.7% accurate, 2.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 \frac{y\_m}{x\_m \cdot z}\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) 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 =     private
x\_s =     private
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_s, x_m, y_m, z)
use fmin_fmax_functions
    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 84.7%

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

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

4. Applied rewrites 48.7%

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

Reproduce

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