Statistics.Distribution.Beta:$cvariance from math-functions-0.1.5.2

Percentage Accurate: 82.6% → 98.2%

Time: 4.0s

Alternatives: 12

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (* x y) (* (* z z) (+ z 1.0))))

C

double code(double x, double y, double z) {
	return (x * y) / ((z * z) * (z + 1.0));
}

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 = (x * y) / ((z * z) * (z + 1.0d0))
end function

Java

public static double code(double x, double y, double z) {
	return (x * y) / ((z * z) * (z + 1.0));
}

Python

def code(x, y, z):
	return (x * y) / ((z * z) * (z + 1.0))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 82.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (/ (* x y) (* (* z z) (+ z 1.0))))

C

double code(double x, double y, double z) {
	return (x * y) / ((z * z) * (z + 1.0));
}

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 = (x * y) / ((z * z) * (z + 1.0d0))
end function

Java

public static double code(double x, double y, double z) {
	return (x * y) / ((z * z) * (z + 1.0));
}

Python

def code(x, y, z):
	return (x * y) / ((z * z) * (z + 1.0))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.2% accurate, 0.3× 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) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ \begin{array}{l} t_0 := \frac{\frac{y\_m}{z}}{z} \cdot \frac{x\_m}{z}\\ t_1 := \left(z \cdot z\right) \cdot \left(z + 1\right)\\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -1000000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-313}:\\ \;\;\;\;\frac{y\_m}{z} \cdot \frac{x\_m}{z}\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+92}:\\ \;\;\;\;y\_m \cdot \frac{x\_m}{\mathsf{fma}\left(z, z, z\right) \cdot z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (/ (/ y_m z) z) (/ x_m z))) (t_1 (* (* z z) (+ z 1.0))))
   (*
    y_s
    (*
     x_s
     (if (<= t_1 -1000000000.0)
       t_0
       (if (<= t_1 5e-313)
         (* (/ y_m z) (/ x_m z))
         (if (<= t_1 5e+92) (* y_m (/ x_m (* (fma z z z) z))) t_0)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = ((y_m / z) / z) * (x_m / z);
	double t_1 = (z * z) * (z + 1.0);
	double tmp;
	if (t_1 <= -1000000000.0) {
		tmp = t_0;
	} else if (t_1 <= 5e-313) {
		tmp = (y_m / z) * (x_m / z);
	} else if (t_1 <= 5e+92) {
		tmp = y_m * (x_m / (fma(z, z, z) * z));
	} else {
		tmp = t_0;
	}
	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)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(Float64(Float64(y_m / z) / z) * Float64(x_m / z))
	t_1 = Float64(Float64(z * z) * Float64(z + 1.0))
	tmp = 0.0
	if (t_1 <= -1000000000.0)
		tmp = t_0;
	elseif (t_1 <= 5e-313)
		tmp = Float64(Float64(y_m / z) * Float64(x_m / z));
	elseif (t_1 <= 5e+92)
		tmp = Float64(y_m * Float64(x_m / Float64(fma(z, z, z) * z)));
	else
		tmp = t_0;
	end
	return Float64(y_s * Float64(x_s * tmp))
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$1, -1000000000.0], t$95$0, If[LessEqual[t$95$1, 5e-313], N[(N[(y$95$m / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+92], N[(y$95$m * N[(x$95$m / N[(N[(z * z + z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -1e9 or 5.00000000000000022e92 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))

   1. Initial program 82.1%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-*l* N/A

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

      7. times-frac N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. distribute-rgt-in N/A

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

      12. *-lft-identity N/A

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

      13. lower-fma.f64 94.1

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

   3. Applied rewrites 94.1%

      \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{y}{\mathsf{fma}\left(z, z, z\right)}} \]
   4. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. frac-times N/A

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

      6. *-commutative N/A

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

      7. frac-times N/A

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

      8. associate-*r/ N/A

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

      9. distribute-lft1-in N/A

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

      10. times-frac N/A

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

      11. lower-*.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lift-/.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-+.f64 N/A

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

      16. lift-/.f64 98.9

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

   5. Applied rewrites 98.9%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 98.3%

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

   if -1e9 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 5.00000000002e-313

   1. Initial program 73.0%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

      8. times-frac N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. distribute-rgt-in N/A

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

      13. *-lft-identity N/A

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

      14. lower-fma.f64 97.9

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

   3. Applied rewrites 97.9%

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

   4. Taylor expanded in z around 0

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

   6. Applied rewrites 97.1%

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

   if 5.00000000002e-313 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 5.00000000000000022e92

   1. Initial program 92.0%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. distribute-rgt-in N/A

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

      14. *-lft-identity N/A

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

      15. lower-fma.f64 98.8

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

   3. Applied rewrites 98.8%

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

Alternative 2: 98.1% 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) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ \begin{array}{l} t_0 := \frac{\frac{y\_m}{z}}{z} \cdot \frac{x\_m}{z}\\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -4 \cdot 10^{+23}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 7 \cdot 10^{+30}:\\ \;\;\;\;y\_m \cdot \frac{\frac{x\_m}{\mathsf{fma}\left(z, z, z\right)}}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (/ (/ y_m z) z) (/ x_m z))))
   (*
    y_s
    (*
     x_s
     (if (<= z -4e+23)
       t_0
       (if (<= z 7e+30) (* y_m (/ (/ x_m (fma z z z)) z)) t_0))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = ((y_m / z) / z) * (x_m / z);
	double tmp;
	if (z <= -4e+23) {
		tmp = t_0;
	} else if (z <= 7e+30) {
		tmp = y_m * ((x_m / fma(z, z, z)) / z);
	} else {
		tmp = t_0;
	}
	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)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(Float64(Float64(y_m / z) / z) * Float64(x_m / z))
	tmp = 0.0
	if (z <= -4e+23)
		tmp = t_0;
	elseif (z <= 7e+30)
		tmp = Float64(y_m * Float64(Float64(x_m / fma(z, z, z)) / z));
	else
		tmp = t_0;
	end
	return Float64(y_s * Float64(x_s * tmp))
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[z, -4e+23], t$95$0, If[LessEqual[z, 7e+30], N[(y$95$m * N[(N[(x$95$m / N[(z * z + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.9999999999999997e23 or 7.00000000000000042e30 < z

   1. Initial program 81.7%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-*l* N/A

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

      7. times-frac N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. distribute-rgt-in N/A

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

      12. *-lft-identity N/A

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

      13. lower-fma.f64 93.9

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

   3. Applied rewrites 93.9%

      \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{y}{\mathsf{fma}\left(z, z, z\right)}} \]
   4. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. frac-times N/A

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

      6. *-commutative N/A

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

      7. frac-times N/A

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

      8. associate-*r/ N/A

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

      9. distribute-lft1-in N/A

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

      10. times-frac N/A

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

      11. lower-*.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lift-/.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-+.f64 N/A

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

      16. lift-/.f64 98.9

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

   5. Applied rewrites 98.9%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 98.9%

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

   if -3.9999999999999997e23 < z < 7.00000000000000042e30

   1. Initial program 83.3%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. distribute-rgt-in N/A

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

      14. *-lft-identity N/A

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

      15. lower-fma.f64 87.1

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

   3. Applied rewrites 87.1%

      \[\leadsto \color{blue}{y \cdot \frac{x}{\mathsf{fma}\left(z, z, z\right) \cdot z}} \]
   4. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-fma.f64 N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lift-fma.f64 N/A

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

      7. lift-/.f64 97.5

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

   5. Applied rewrites 97.5%

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

Alternative 3: 97.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{\frac{y\_m}{1 + z} \cdot \frac{x\_m}{z}}{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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (/ (* (/ y_m (+ 1.0 z)) (/ x_m z)) z))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (((y_m / (1.0 + z)) * (x_m / z)) / z));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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 / (1.0d0 + z)) * (x_m / z)) / 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);
assert x_m < y_m && y_m < z;
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 / (1.0 + z)) * (x_m / z)) / 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)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * (((y_m / (1.0 + z)) * (x_m / z)) / z))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(Float64(Float64(y_m / Float64(1.0 + z)) * Float64(x_m / z)) / 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);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * (((y_m / (1.0 + z)) * (x_m / z)) / 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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[(y$95$m / N[(1.0 + z), $MachinePrecision]), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 82.6%

   \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. associate-*l* N/A

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

   7. times-frac N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. lower-/.f64 N/A

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

   11. distribute-rgt-in N/A

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

   12. *-lft-identity N/A

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

   13. lower-fma.f64 94.9

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

3. Applied rewrites 94.9%

   \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{y}{\mathsf{fma}\left(z, z, z\right)}} \]
4. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift-fma.f64 N/A

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

   5. frac-times N/A

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

   6. *-commutative N/A

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

   7. frac-times N/A

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

   8. associate-*r/ N/A

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

   9. distribute-lft1-in N/A

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

   10. times-frac N/A

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

   11. lower-*.f64 N/A

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

   12. lower-/.f64 N/A

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

   13. lift-/.f64 N/A

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

   14. +-commutative N/A

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

   15. lower-+.f64 N/A

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

   16. lift-/.f64 97.1

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

5. Applied rewrites 97.1%

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

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-+.f64 N/A

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

   4. lift-/.f64 N/A

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

   5. associate-/l/ N/A

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

   6. *-commutative N/A

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

   7. +-commutative N/A

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

   8. distribute-lft1-in N/A

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

   9. lift-/.f64 N/A

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

   10. times-frac N/A

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

   11. associate-/r* N/A

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

   12. lower-/.f64 N/A

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

   13. *-commutative N/A

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

   14. lower-/.f64 N/A

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

   15. lower-*.f64 N/A

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

   16. lift-fma.f64 88.8

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

7. Applied rewrites 88.8%

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

   1. lift-*.f64 N/A

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

   2. lift-fma.f64 N/A

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

   3. lower-/.f64 N/A

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

   4. *-commutative N/A

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

   5. distribute-lft1-in N/A

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

   6. +-commutative N/A

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

   7. times-frac N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. lift-+.f64 N/A

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

   11. lift-/.f64 97.9

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

9. Applied rewrites 97.9%

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

Alternative 4: 97.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \left(\frac{\frac{y\_m}{z}}{1 + z} \cdot \frac{x\_m}{z}\right)\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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (* (/ (/ y_m z) (+ 1.0 z)) (/ x_m z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (((y_m / z) / (1.0 + z)) * (x_m / z)));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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 / z) / (1.0d0 + z)) * (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);
assert x_m < y_m && y_m < z;
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 / z) / (1.0 + z)) * (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)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * (((y_m / z) / (1.0 + z)) * (x_m / z)))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(Float64(Float64(y_m / z) / Float64(1.0 + z)) * 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);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * (((y_m / z) / (1.0 + z)) * (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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[(y$95$m / z), $MachinePrecision] / N[(1.0 + z), $MachinePrecision]), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 82.6%

   \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. associate-*l* N/A

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

   7. times-frac N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. lower-/.f64 N/A

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

   11. distribute-rgt-in N/A

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

   12. *-lft-identity N/A

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

   13. lower-fma.f64 94.9

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

3. Applied rewrites 94.9%

   \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{y}{\mathsf{fma}\left(z, z, z\right)}} \]
4. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift-fma.f64 N/A

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

   5. frac-times N/A

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

   6. *-commutative N/A

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

   7. frac-times N/A

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

   8. associate-*r/ N/A

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

   9. distribute-lft1-in N/A

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

   10. times-frac N/A

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

   11. lower-*.f64 N/A

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

   12. lower-/.f64 N/A

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

   13. lift-/.f64 N/A

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

   14. +-commutative N/A

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

   15. lower-+.f64 N/A

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

   16. lift-/.f64 97.1

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

5. Applied rewrites 97.1%

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

Alternative 5: 96.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ \begin{array}{l} t_0 := \frac{\frac{y\_m}{z}}{z} \cdot \frac{x\_m}{z}\\ t_1 := \left(z \cdot z\right) \cdot \left(z + 1\right)\\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq -1000000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 10^{-5}:\\ \;\;\;\;y\_m \cdot \frac{\frac{x\_m}{z}}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (/ (/ y_m z) z) (/ x_m z))) (t_1 (* (* z z) (+ z 1.0))))
   (*
    y_s
    (*
     x_s
     (if (<= t_1 -1000000000.0)
       t_0
       (if (<= t_1 1e-5) (* y_m (/ (/ x_m z) z)) t_0))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = ((y_m / z) / z) * (x_m / z);
	double t_1 = (z * z) * (z + 1.0);
	double tmp;
	if (t_1 <= -1000000000.0) {
		tmp = t_0;
	} else if (t_1 <= 1e-5) {
		tmp = y_m * ((x_m / z) / z);
	} else {
		tmp = t_0;
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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) :: t_1
    real(8) :: tmp
    t_0 = ((y_m / z) / z) * (x_m / z)
    t_1 = (z * z) * (z + 1.0d0)
    if (t_1 <= (-1000000000.0d0)) then
        tmp = t_0
    else if (t_1 <= 1d-5) then
        tmp = y_m * ((x_m / z) / z)
    else
        tmp = t_0
    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);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = ((y_m / z) / z) * (x_m / z);
	double t_1 = (z * z) * (z + 1.0);
	double tmp;
	if (t_1 <= -1000000000.0) {
		tmp = t_0;
	} else if (t_1 <= 1e-5) {
		tmp = y_m * ((x_m / z) / z);
	} else {
		tmp = t_0;
	}
	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)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	t_0 = ((y_m / z) / z) * (x_m / z)
	t_1 = (z * z) * (z + 1.0)
	tmp = 0
	if t_1 <= -1000000000.0:
		tmp = t_0
	elif t_1 <= 1e-5:
		tmp = y_m * ((x_m / z) / z)
	else:
		tmp = t_0
	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)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(Float64(Float64(y_m / z) / z) * Float64(x_m / z))
	t_1 = Float64(Float64(z * z) * Float64(z + 1.0))
	tmp = 0.0
	if (t_1 <= -1000000000.0)
		tmp = t_0;
	elseif (t_1 <= 1e-5)
		tmp = Float64(y_m * Float64(Float64(x_m / z) / z));
	else
		tmp = t_0;
	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);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = ((y_m / z) / z) * (x_m / z);
	t_1 = (z * z) * (z + 1.0);
	tmp = 0.0;
	if (t_1 <= -1000000000.0)
		tmp = t_0;
	elseif (t_1 <= 1e-5)
		tmp = y_m * ((x_m / z) / z);
	else
		tmp = t_0;
	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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision] * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] * N[(z + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[t$95$1, -1000000000.0], t$95$0, If[LessEqual[t$95$1, 1e-5], N[(y$95$m * N[(N[(x$95$m / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < -1e9 or 1.00000000000000008e-5 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64)))

   1. Initial program 83.1%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-*l* N/A

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

      7. times-frac N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. distribute-rgt-in N/A

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

      12. *-lft-identity N/A

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

      13. lower-fma.f64 94.3

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

   3. Applied rewrites 94.3%

      \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{y}{\mathsf{fma}\left(z, z, z\right)}} \]
   4. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-fma.f64 N/A

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

      5. frac-times N/A

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

      6. *-commutative N/A

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

      7. frac-times N/A

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

      8. associate-*r/ N/A

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

      9. distribute-lft1-in N/A

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

      10. times-frac N/A

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

      11. lower-*.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lift-/.f64 N/A

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

      14. +-commutative N/A

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

      15. lower-+.f64 N/A

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

      16. lift-/.f64 98.8

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

   5. Applied rewrites 98.8%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 96.8%

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

   if -1e9 < (*.f64 (*.f64 z z) (+.f64 z #s(literal 1 binary64))) < 1.00000000000000008e-5

   1. Initial program 82.0%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. distribute-rgt-in N/A

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

      14. *-lft-identity N/A

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

      15. lower-fma.f64 86.4

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

   3. Applied rewrites 86.4%

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

   4. Taylor expanded in z around 0

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

   6. Applied rewrites 85.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lift-/.f64 N/A

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

      5. lower-/.f64 96.5

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

   8. Applied rewrites 96.5%

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

Alternative 6: 94.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \frac{\frac{x\_m}{z} \cdot y\_m}{\mathsf{fma}\left(z, z, z\right)}\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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (/ (* (/ x_m z) y_m) (fma z z z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * (((x_m / z) * y_m) / fma(z, z, z)));
}

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(Float64(Float64(x_m / z) * y_m) / fma(z, z, 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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(N[(x$95$m / z), $MachinePrecision] * y$95$m), $MachinePrecision] / N[(z * z + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 82.6%

   \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. associate-*l* N/A

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

   7. times-frac N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. lower-/.f64 N/A

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

   11. distribute-rgt-in N/A

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

   12. *-lft-identity N/A

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

   13. lower-fma.f64 94.9

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

3. Applied rewrites 94.9%

   \[\leadsto \color{blue}{\frac{x}{z} \cdot \frac{y}{\mathsf{fma}\left(z, z, z\right)}} \]
4. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift-fma.f64 N/A

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

   5. associate-*r/ N/A

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

   6. lower-/.f64 N/A

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

   7. lower-*.f64 N/A

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

   8. lift-/.f64 N/A

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

   9. lift-fma.f64 94.9

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

5. Applied rewrites 94.9%

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

Alternative 7: 94.0% accurate, 0.8× 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) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ \begin{array}{l} t_0 := \frac{x\_m}{z} \cdot \frac{y\_m}{z \cdot z}\\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -1:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 2.7 \cdot 10^{+17}:\\ \;\;\;\;y\_m \cdot \frac{\frac{x\_m}{z}}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (/ x_m z) (/ y_m (* z z)))))
   (*
    y_s
    (*
     x_s
     (if (<= z -1.0) t_0 (if (<= z 2.7e+17) (* y_m (/ (/ x_m z) z)) t_0))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = (x_m / z) * (y_m / (z * z));
	double tmp;
	if (z <= -1.0) {
		tmp = t_0;
	} else if (z <= 2.7e+17) {
		tmp = y_m * ((x_m / z) / z);
	} else {
		tmp = t_0;
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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 = (x_m / z) * (y_m / (z * z))
    if (z <= (-1.0d0)) then
        tmp = t_0
    else if (z <= 2.7d+17) then
        tmp = y_m * ((x_m / z) / z)
    else
        tmp = t_0
    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);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = (x_m / z) * (y_m / (z * z));
	double tmp;
	if (z <= -1.0) {
		tmp = t_0;
	} else if (z <= 2.7e+17) {
		tmp = y_m * ((x_m / z) / z);
	} else {
		tmp = t_0;
	}
	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)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	t_0 = (x_m / z) * (y_m / (z * z))
	tmp = 0
	if z <= -1.0:
		tmp = t_0
	elif z <= 2.7e+17:
		tmp = y_m * ((x_m / z) / z)
	else:
		tmp = t_0
	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)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(Float64(x_m / z) * Float64(y_m / Float64(z * z)))
	tmp = 0.0
	if (z <= -1.0)
		tmp = t_0;
	elseif (z <= 2.7e+17)
		tmp = Float64(y_m * Float64(Float64(x_m / z) / z));
	else
		tmp = t_0;
	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);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = (x_m / z) * (y_m / (z * z));
	tmp = 0.0;
	if (z <= -1.0)
		tmp = t_0;
	elseif (z <= 2.7e+17)
		tmp = y_m * ((x_m / z) / z);
	else
		tmp = t_0;
	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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(x$95$m / z), $MachinePrecision] * N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[z, -1.0], t$95$0, If[LessEqual[z, 2.7e+17], N[(y$95$m * N[(N[(x$95$m / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 2.7e17 < z

   1. Initial program 82.6%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. associate-*l* N/A

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

      7. times-frac N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. distribute-rgt-in N/A

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

      12. *-lft-identity N/A

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

      13. lower-fma.f64 94.2

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

   3. Applied rewrites 94.2%

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

   4. Taylor expanded in z around inf

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

      1. pow2 N/A

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

      2. lift-*.f64 93.4

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

   6. Applied rewrites 93.4%

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

   if -1 < z < 2.7e17

   1. Initial program 82.6%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. distribute-rgt-in N/A

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

      14. *-lft-identity N/A

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

      15. lower-fma.f64 86.7

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

   3. Applied rewrites 86.7%

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

   4. Taylor expanded in z around 0

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

   6. Applied rewrites 83.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lift-/.f64 N/A

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

      5. lower-/.f64 94.6

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

   8. Applied rewrites 94.6%

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

Alternative 8: 92.0% accurate, 0.8× 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) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ \begin{array}{l} t_0 := \frac{y\_m}{\left(z \cdot z\right) \cdot z} \cdot x\_m\\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -1:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 0.0305:\\ \;\;\;\;y\_m \cdot \frac{\frac{x\_m}{z}}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (let* ((t_0 (* (/ y_m (* (* z z) z)) x_m)))
   (*
    y_s
    (*
     x_s
     (if (<= z -1.0) t_0 (if (<= z 0.0305) (* y_m (/ (/ x_m z) z)) t_0))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = (y_m / ((z * z) * z)) * x_m;
	double tmp;
	if (z <= -1.0) {
		tmp = t_0;
	} else if (z <= 0.0305) {
		tmp = y_m * ((x_m / z) / z);
	} else {
		tmp = t_0;
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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 = (y_m / ((z * z) * z)) * x_m
    if (z <= (-1.0d0)) then
        tmp = t_0
    else if (z <= 0.0305d0) then
        tmp = y_m * ((x_m / z) / z)
    else
        tmp = t_0
    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);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double t_0 = (y_m / ((z * z) * z)) * x_m;
	double tmp;
	if (z <= -1.0) {
		tmp = t_0;
	} else if (z <= 0.0305) {
		tmp = y_m * ((x_m / z) / z);
	} else {
		tmp = t_0;
	}
	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)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	t_0 = (y_m / ((z * z) * z)) * x_m
	tmp = 0
	if z <= -1.0:
		tmp = t_0
	elif z <= 0.0305:
		tmp = y_m * ((x_m / z) / z)
	else:
		tmp = t_0
	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)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	t_0 = Float64(Float64(y_m / Float64(Float64(z * z) * z)) * x_m)
	tmp = 0.0
	if (z <= -1.0)
		tmp = t_0;
	elseif (z <= 0.0305)
		tmp = Float64(y_m * Float64(Float64(x_m / z) / z));
	else
		tmp = t_0;
	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);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	t_0 = (y_m / ((z * z) * z)) * x_m;
	tmp = 0.0;
	if (z <= -1.0)
		tmp = t_0;
	elseif (z <= 0.0305)
		tmp = y_m * ((x_m / z) / z);
	else
		tmp = t_0;
	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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(y$95$m / N[(N[(z * z), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]}, N[(y$95$s * N[(x$95$s * If[LessEqual[z, -1.0], t$95$0, If[LessEqual[z, 0.0305], N[(y$95$m * N[(N[(x$95$m / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 0.030499999999999999 < z

   1. Initial program 83.1%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

         \[\leadsto \frac{y}{{z}^{3}} \cdot x \]

      5. unpow3 N/A

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

      6. pow2 N/A

         \[\leadsto \frac{y}{{z}^{2} \cdot z} \cdot x \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{y}{{z}^{2} \cdot z} \cdot x \]

      8. pow2 N/A

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

      9. lift-*.f64 87.4

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

   4. Applied rewrites 87.4%

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

   if -1 < z < 0.030499999999999999

   1. Initial program 82.1%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. distribute-rgt-in N/A

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

      14. *-lft-identity N/A

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

      15. lower-fma.f64 86.4

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

   3. Applied rewrites 86.4%

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

   4. Taylor expanded in z around 0

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

   6. Applied rewrites 85.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lift-/.f64 N/A

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

      5. lower-/.f64 96.6

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

   8. Applied rewrites 96.6%

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

Alternative 9: 80.7% accurate, 1.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) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \left(y\_m \cdot \frac{\frac{x\_m}{z}}{z}\right)\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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (* y_m (/ (/ x_m z) z)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
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) / z)));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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) / 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);
assert x_m < y_m && y_m < z;
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) / 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)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * (y_m * ((x_m / z) / z)))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(y_m * Float64(Float64(x_m / z) / 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);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * (y_m * ((x_m / z) / 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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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[(N[(x$95$m / z), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 82.6%

   \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. *-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. lift-+.f64 N/A

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

   7. associate-/l* N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. associate-*l* N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 N/A

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

   13. distribute-rgt-in N/A

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

   14. *-lft-identity N/A

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

   15. lower-fma.f64 85.5

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

3. Applied rewrites 85.5%

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

4. Taylor expanded in z around 0

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

6. Applied rewrites 75.5%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/r* N/A

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

   4. lift-/.f64 N/A

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

   5. lower-/.f64 80.7

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

8. Applied rewrites 80.7%

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

Alternative 10: 77.4% accurate, 1.1× 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) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \begin{array}{l} \mathbf{if}\;y\_m \leq 2:\\ \;\;\;\;\frac{\frac{y\_m}{z}}{z} \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \frac{x\_m}{z \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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (*
  y_s
  (* x_s (if (<= y_m 2.0) (* (/ (/ y_m z) z) x_m) (* y_m (/ x_m (* z z)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (y_m <= 2.0) {
		tmp = ((y_m / z) / z) * x_m;
	} else {
		tmp = y_m * (x_m / (z * z));
	}
	return y_s * (x_s * tmp);
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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 (y_m <= 2.0d0) then
        tmp = ((y_m / z) / z) * x_m
    else
        tmp = y_m * (x_m / (z * 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);
assert x_m < y_m && y_m < z;
public static double code(double y_s, double x_s, double x_m, double y_m, double z) {
	double tmp;
	if (y_m <= 2.0) {
		tmp = ((y_m / z) / z) * x_m;
	} else {
		tmp = y_m * (x_m / (z * 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)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	tmp = 0
	if y_m <= 2.0:
		tmp = ((y_m / z) / z) * x_m
	else:
		tmp = y_m * (x_m / (z * 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)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0
	if (y_m <= 2.0)
		tmp = Float64(Float64(Float64(y_m / z) / z) * x_m);
	else
		tmp = Float64(y_m * Float64(x_m / Float64(z * 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);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(y_s, x_s, x_m, y_m, z)
	tmp = 0.0;
	if (y_m <= 2.0)
		tmp = ((y_m / z) / z) * x_m;
	else
		tmp = y_m * (x_m / (z * 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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * If[LessEqual[y$95$m, 2.0], N[(N[(N[(y$95$m / z), $MachinePrecision] / z), $MachinePrecision] * x$95$m), $MachinePrecision], N[(y$95$m * N[(x$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 2

   1. Initial program 72.2%

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

   2. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

         \[\leadsto \frac{y}{{z}^{2}} \cdot x \]

      5. pow2 N/A

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

      6. lift-*.f64 76.1

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

   4. Applied rewrites 76.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lift-/.f64 83.4

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

   6. Applied rewrites 83.4%

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

   if 2 < y

   1. Initial program 86.2%

      \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. distribute-rgt-in N/A

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

      14. *-lft-identity N/A

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

      15. lower-fma.f64 87.2

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

   3. Applied rewrites 87.2%

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

   4. Taylor expanded in z around 0

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

   6. Applied rewrites 75.3%

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

Alternative 11: 75.5% accurate, 1.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) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \left(y\_m \cdot \frac{x\_m}{z \cdot z}\right)\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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (* y_m (/ x_m (* z z))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
y\_m = fabs(y);
y\_s = copysign(1.0, y);
assert(x_m < y_m && y_m < z);
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 * z))));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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 * 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);
assert x_m < y_m && y_m < z;
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 * 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)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * (y_m * (x_m / (z * z))))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
y\_m = abs(y)
y\_s = copysign(1.0, y)
x_m, y_m, z = sort([x_m, y_m, z])
function code(y_s, x_s, x_m, y_m, z)
	return Float64(y_s * Float64(x_s * Float64(y_m * Float64(x_m / Float64(z * 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);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * (y_m * (x_m / (z * 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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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 / N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 82.6%

   \[\frac{x \cdot y}{\left(z \cdot z\right) \cdot \left(z + 1\right)} \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. *-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. lift-+.f64 N/A

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

   7. associate-/l* N/A

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

   8. lower-*.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. associate-*l* N/A

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

   11. *-commutative N/A

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

   12. lower-*.f64 N/A

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

   13. distribute-rgt-in N/A

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

   14. *-lft-identity N/A

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

   15. lower-fma.f64 85.5

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

3. Applied rewrites 85.5%

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

4. Taylor expanded in z around 0

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

6. Applied rewrites 75.5%

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

Alternative 12: 69.4% accurate, 1.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) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ y\_s \cdot \left(x\_s \cdot \left(\frac{y\_m}{z \cdot z} \cdot x\_m\right)\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)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (y_s x_s x_m y_m z)
 :precision binary64
 (* y_s (* x_s (* (/ y_m (* 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);
assert(x_m < y_m && y_m < z);
double code(double y_s, double x_s, double x_m, double y_m, double z) {
	return y_s * (x_s * ((y_m / (z * z)) * x_m));
}

Fortran

x\_m =     private
x\_s =     private
y\_m =     private
y\_s =     private
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
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 / (z * z)) * x_m))
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);
assert x_m < y_m && y_m < z;
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 / (z * z)) * x_m));
}

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)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(y_s, x_s, x_m, y_m, z):
	return y_s * (x_s * ((y_m / (z * z)) * x_m))

Julia

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

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(y_s, x_s, x_m, y_m, z)
	tmp = y_s * (x_s * ((y_m / (z * z)) * x_m));
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]
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
code[y$95$s_, x$95$s_, x$95$m_, y$95$m_, z_] := N[(y$95$s * N[(x$95$s * N[(N[(y$95$m / N[(z * z), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 82.6%

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

2. Taylor expanded in z around 0

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

   1. associate-/l* N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 N/A

      \[\leadsto \frac{y}{{z}^{2}} \cdot x \]

   5. pow2 N/A

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

   6. lift-*.f64 69.4

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

4. Applied rewrites 69.4%

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

Reproduce

herbie shell --seed 2025128 
(FPCore (x y z)
  :name "Statistics.Distribution.Beta:$cvariance from math-functions-0.1.5.2"
  :precision binary64
  (/ (* x y) (* (* z z) (+ z 1.0))))