Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2

Percentage Accurate: 89.4% → 98.1%

Time: 8.2s

Alternatives: 11

Speedup: 0.3×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 89.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 / x) / (y * (1.0d0 + (z * z)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ x\_s \cdot \left(y\_s \cdot {\left(\mathsf{fma}\left(x\_m \cdot z, z, x\_m\right) \cdot y\_m\right)}^{-1}\right) \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (* x_s (* y_s (pow (* (fma (* x_m z) z x_m) y_m) -1.0))))

C

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

Julia

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[Power[N[(N[(N[(x$95$m * z), $MachinePrecision] * z + x$95$m), $MachinePrecision] * y$95$m), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 89.1%

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

   1. lift-/.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. associate-/l/ N/A

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

   4. lower-/.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 88.9

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

   7. lift-*.f64 N/A

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

   8. lift-+.f64 N/A

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

   9. +-commutative N/A

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

   10. distribute-lft-in N/A

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

   11. *-rgt-identity N/A

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

   12. lower-fma.f64 89.0

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

4. Applied rewrites 89.0%

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

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lift-fma.f64 N/A

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

   4. *-commutative N/A

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

   5. lift-*.f64 N/A

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

   6. *-lft-identity N/A

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

   7. lift-*.f64 N/A

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

   8. distribute-lft-in N/A

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

   9. lift-*.f64 N/A

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

   10. *-lft-identity N/A

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

   11. lift-*.f64 N/A

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

   12. *-commutative N/A

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

   13. lift-*.f64 N/A

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

   14. associate-*r* N/A

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

   15. lift-*.f64 N/A

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

   16. associate-*l* N/A

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

   17. lift-*.f64 N/A

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

   18. *-commutative N/A

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

   19. lift-*.f64 N/A

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

   20. associate-*r* N/A

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

   21. *-commutative N/A

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

   22. lift-*.f64 N/A

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

   23. lower-fma.f64 N/A

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

   24. lower-*.f64 96.3

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

6. Applied rewrites 96.3%

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

   1. lift-fma.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-rgt-identity N/A

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

   5. *-commutative N/A

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

   6. lift-*.f64 N/A

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

   7. associate-*r* N/A

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

   8. lift-*.f64 N/A

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

   9. associate-*r* N/A

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

   10. lift-*.f64 N/A

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

   11. distribute-rgt-in N/A

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

   12. distribute-lft-in N/A

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

   13. lift-*.f64 N/A

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

   14. lift-*.f64 N/A

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

   15. +-commutative N/A

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

   16. lift-*.f64 N/A

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

   17. lift-fma.f64 N/A

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

   18. *-commutative N/A

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

   19. associate-*r* N/A

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

   20. *-commutative N/A

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

   21. lift-*.f64 N/A

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

   22. lift-*.f64 90.4

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

8. Applied rewrites 95.2%

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

9. Final simplification 95.2%

   \[\leadsto {\left(\mathsf{fma}\left(x \cdot z, z, x\right) \cdot y\right)}^{-1} \]
10. Add Preprocessing

Alternative 2: 69.6% accurate, 0.2× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (if (<= (/ (pow x_m -1.0) (* y_m (+ 1.0 (* z z)))) 1e-317)
     (/ y_m (* (* y_m y_m) x_m))
     (pow (* y_m x_m) -1.0)))))

C

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

Fortran

y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, x_m, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (((x_m ** (-1.0d0)) / (y_m * (1.0d0 + (z * z)))) <= 1d-317) then
        tmp = y_m / ((y_m * y_m) * x_m)
    else
        tmp = (y_m * x_m) ** (-1.0d0)
    end if
    code = x_s * (y_s * tmp)
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
	double tmp;
	if ((Math.pow(x_m, -1.0) / (y_m * (1.0 + (z * z)))) <= 1e-317) {
		tmp = y_m / ((y_m * y_m) * x_m);
	} else {
		tmp = Math.pow((y_m * x_m), -1.0);
	}
	return x_s * (y_s * tmp);
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(x_s, y_s, x_m, y_m, z):
	tmp = 0
	if (math.pow(x_m, -1.0) / (y_m * (1.0 + (z * z)))) <= 1e-317:
		tmp = y_m / ((y_m * y_m) * x_m)
	else:
		tmp = math.pow((y_m * x_m), -1.0)
	return x_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0
	if (Float64((x_m ^ -1.0) / Float64(y_m * Float64(1.0 + Float64(z * z)))) <= 1e-317)
		tmp = Float64(y_m / Float64(Float64(y_m * y_m) * x_m));
	else
		tmp = Float64(y_m * x_m) ^ -1.0;
	end
	return Float64(x_s * Float64(y_s * tmp))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0;
	if (((x_m ^ -1.0) / (y_m * (1.0 + (z * z)))) <= 1e-317)
		tmp = y_m / ((y_m * y_m) * x_m);
	else
		tmp = (y_m * x_m) ^ -1.0;
	end
	tmp_2 = x_s * (y_s * tmp);
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[Power[x$95$m, -1.0], $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-317], N[(y$95$m / N[(N[(y$95$m * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision], N[Power[N[(y$95$m * x$95$m), $MachinePrecision], -1.0], $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 1 binary64) x) (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))) < 1.00000023e-317

   1. Initial program 83.0%

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

   3. Taylor expanded in z around 0

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

      1. associate-/r* N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 50.0

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

   5. Applied rewrites 50.0%

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

   7. Applied rewrites 50.5%

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

   9. Applied rewrites 43.4%

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

   if 1.00000023e-317 < (/.f64 (/.f64 #s(literal 1 binary64) x) (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))))

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

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

      1. associate-/r* N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 74.0

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

   5. Applied rewrites 74.0%

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

   7. Applied rewrites 74.1%

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

4. Final simplification 54.6%

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

Alternative 3: 66.6% accurate, 0.2× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (if (<= (/ (pow x_m -1.0) (* y_m (+ 1.0 (* z z)))) 1e-317)
     (/ y_m (* (* y_m x_m) y_m))
     (pow (* y_m x_m) -1.0)))))

C

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

Fortran

y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, x_m, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (((x_m ** (-1.0d0)) / (y_m * (1.0d0 + (z * z)))) <= 1d-317) then
        tmp = y_m / ((y_m * x_m) * y_m)
    else
        tmp = (y_m * x_m) ** (-1.0d0)
    end if
    code = x_s * (y_s * tmp)
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
	double tmp;
	if ((Math.pow(x_m, -1.0) / (y_m * (1.0 + (z * z)))) <= 1e-317) {
		tmp = y_m / ((y_m * x_m) * y_m);
	} else {
		tmp = Math.pow((y_m * x_m), -1.0);
	}
	return x_s * (y_s * tmp);
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(x_s, y_s, x_m, y_m, z):
	tmp = 0
	if (math.pow(x_m, -1.0) / (y_m * (1.0 + (z * z)))) <= 1e-317:
		tmp = y_m / ((y_m * x_m) * y_m)
	else:
		tmp = math.pow((y_m * x_m), -1.0)
	return x_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0
	if (Float64((x_m ^ -1.0) / Float64(y_m * Float64(1.0 + Float64(z * z)))) <= 1e-317)
		tmp = Float64(y_m / Float64(Float64(y_m * x_m) * y_m));
	else
		tmp = Float64(y_m * x_m) ^ -1.0;
	end
	return Float64(x_s * Float64(y_s * tmp))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0;
	if (((x_m ^ -1.0) / (y_m * (1.0 + (z * z)))) <= 1e-317)
		tmp = y_m / ((y_m * x_m) * y_m);
	else
		tmp = (y_m * x_m) ^ -1.0;
	end
	tmp_2 = x_s * (y_s * tmp);
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(N[Power[x$95$m, -1.0], $MachinePrecision] / N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-317], N[(y$95$m / N[(N[(y$95$m * x$95$m), $MachinePrecision] * y$95$m), $MachinePrecision]), $MachinePrecision], N[Power[N[(y$95$m * x$95$m), $MachinePrecision], -1.0], $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (/.f64 #s(literal 1 binary64) x) (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))) < 1.00000023e-317

   1. Initial program 83.0%

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

   3. Taylor expanded in z around 0

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

      1. associate-/r* N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 50.0

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

   5. Applied rewrites 50.0%

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

   7. Applied rewrites 50.5%

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

   9. Applied rewrites 43.4%

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

   11. Applied rewrites 46.3%

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

   if 1.00000023e-317 < (/.f64 (/.f64 #s(literal 1 binary64) x) (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))))

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

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

      1. associate-/r* N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 74.0

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

   5. Applied rewrites 74.0%

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

   7. Applied rewrites 74.1%

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

4. Final simplification 56.5%

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

Alternative 4: 69.0% accurate, 0.3× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (if (<= (* y_m (+ 1.0 (* z z))) 2e+299)
     (/ (pow x_m -1.0) y_m)
     (/ y_m (* (* y_m y_m) x_m))))))

C

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

Fortran

y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, x_m, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y_m * (1.0d0 + (z * z))) <= 2d+299) then
        tmp = (x_m ** (-1.0d0)) / y_m
    else
        tmp = y_m / ((y_m * y_m) * x_m)
    end if
    code = x_s * (y_s * tmp)
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
	double tmp;
	if ((y_m * (1.0 + (z * z))) <= 2e+299) {
		tmp = Math.pow(x_m, -1.0) / y_m;
	} else {
		tmp = y_m / ((y_m * y_m) * x_m);
	}
	return x_s * (y_s * tmp);
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(x_s, y_s, x_m, y_m, z):
	tmp = 0
	if (y_m * (1.0 + (z * z))) <= 2e+299:
		tmp = math.pow(x_m, -1.0) / y_m
	else:
		tmp = y_m / ((y_m * y_m) * x_m)
	return x_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0
	if (Float64(y_m * Float64(1.0 + Float64(z * z))) <= 2e+299)
		tmp = Float64((x_m ^ -1.0) / y_m);
	else
		tmp = Float64(y_m / Float64(Float64(y_m * y_m) * x_m));
	end
	return Float64(x_s * Float64(y_s * tmp))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0;
	if ((y_m * (1.0 + (z * z))) <= 2e+299)
		tmp = (x_m ^ -1.0) / y_m;
	else
		tmp = y_m / ((y_m * y_m) * x_m);
	end
	tmp_2 = x_s * (y_s * tmp);
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e+299], N[(N[Power[x$95$m, -1.0], $MachinePrecision] / y$95$m), $MachinePrecision], N[(y$95$m / N[(N[(y$95$m * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 2.0000000000000001e299

   1. Initial program 93.2%

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

   3. Taylor expanded in z around 0

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

      1. associate-/r* N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 67.5

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

   5. Applied rewrites 67.5%

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

   if 2.0000000000000001e299 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))

   1. Initial program 67.6%

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

   3. Taylor expanded in z around 0

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

      1. associate-/r* N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 13.0

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

   5. Applied rewrites 13.0%

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

   7. Applied rewrites 15.7%

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

   9. Applied rewrites 32.0%

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

4. Final simplification 61.8%

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

Alternative 5: 69.0% accurate, 0.3× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (if (<= (* y_m (+ 1.0 (* z z))) 2e+299)
     (/ (pow y_m -1.0) x_m)
     (/ y_m (* (* y_m y_m) x_m))))))

C

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

Fortran

y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, x_m, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y_m * (1.0d0 + (z * z))) <= 2d+299) then
        tmp = (y_m ** (-1.0d0)) / x_m
    else
        tmp = y_m / ((y_m * y_m) * x_m)
    end if
    code = x_s * (y_s * tmp)
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
	double tmp;
	if ((y_m * (1.0 + (z * z))) <= 2e+299) {
		tmp = Math.pow(y_m, -1.0) / x_m;
	} else {
		tmp = y_m / ((y_m * y_m) * x_m);
	}
	return x_s * (y_s * tmp);
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(x_s, y_s, x_m, y_m, z):
	tmp = 0
	if (y_m * (1.0 + (z * z))) <= 2e+299:
		tmp = math.pow(y_m, -1.0) / x_m
	else:
		tmp = y_m / ((y_m * y_m) * x_m)
	return x_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0
	if (Float64(y_m * Float64(1.0 + Float64(z * z))) <= 2e+299)
		tmp = Float64((y_m ^ -1.0) / x_m);
	else
		tmp = Float64(y_m / Float64(Float64(y_m * y_m) * x_m));
	end
	return Float64(x_s * Float64(y_s * tmp))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp_2 = code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0;
	if ((y_m * (1.0 + (z * z))) <= 2e+299)
		tmp = (y_m ^ -1.0) / x_m;
	else
		tmp = y_m / ((y_m * y_m) * x_m);
	end
	tmp_2 = x_s * (y_s * tmp);
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(y$95$m * N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2e+299], N[(N[Power[y$95$m, -1.0], $MachinePrecision] / x$95$m), $MachinePrecision], N[(y$95$m / N[(N[(y$95$m * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z))) < 2.0000000000000001e299

   1. Initial program 93.2%

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

   3. Taylor expanded in z around 0

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

      1. associate-*r/ N/A

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

      2. div-add-rev N/A

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

      3. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. mul-1-neg N/A

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

      8. /-rgt-identity N/A

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

      9. /-rgt-identity N/A

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

      10. unpow2 N/A

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

      11. distribute-lft-neg-in N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-neg.f64 61.8

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

   5. Applied rewrites 61.8%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 67.6%

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

   if 2.0000000000000001e299 < (*.f64 y (+.f64 #s(literal 1 binary64) (*.f64 z z)))

   1. Initial program 67.6%

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

   3. Taylor expanded in z around 0

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

      1. associate-/r* N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 13.0

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

   5. Applied rewrites 13.0%

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

   7. Applied rewrites 15.7%

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

   9. Applied rewrites 32.0%

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

4. Final simplification 61.9%

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

Alternative 6: 92.0% accurate, 0.3× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (if (<= (+ 1.0 (* z z)) 2.0)
     (/ (fma (- z) z 1.0) (* y_m x_m))
     (pow (* (* (* z z) x_m) y_m) -1.0)))))

C

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

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0
	if (Float64(1.0 + Float64(z * z)) <= 2.0)
		tmp = Float64(fma(Float64(-z), z, 1.0) / Float64(y_m * x_m));
	else
		tmp = Float64(Float64(Float64(z * z) * x_m) * y_m) ^ -1.0;
	end
	return Float64(x_s * Float64(y_s * tmp))
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision], 2.0], N[(N[((-z) * z + 1.0), $MachinePrecision] / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(N[(z * z), $MachinePrecision] * x$95$m), $MachinePrecision] * y$95$m), $MachinePrecision], -1.0], $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (+.f64 #s(literal 1 binary64) (*.f64 z z)) < 2

   1. Initial program 99.6%

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

   3. Taylor expanded in z around 0

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

      1. associate-*r/ N/A

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

      2. div-add-rev N/A

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

      3. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. mul-1-neg N/A

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

      8. /-rgt-identity N/A

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

      9. /-rgt-identity N/A

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

      10. unpow2 N/A

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

      11. distribute-lft-neg-in N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-neg.f64 98.5

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

   5. Applied rewrites 98.5%

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

   7. Applied rewrites 98.3%

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

   if 2 < (+.f64 #s(literal 1 binary64) (*.f64 z z))

   1. Initial program 78.0%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lower-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 77.8

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

      7. lift-*.f64 N/A

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. distribute-lft-in N/A

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

      11. *-rgt-identity N/A

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

      12. lower-fma.f64 77.8

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

   4. Applied rewrites 77.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt1-in N/A

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

      7. lift-*.f64 N/A

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

      8. lift-fma.f64 N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 N/A

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

      12. lower-*.f64 80.8

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

   6. Applied rewrites 80.8%

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

   7. Taylor expanded in z around inf

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

      1. unpow2 N/A

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

      2. lower-*.f64 79.3

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

   9. Applied rewrites 79.3%

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

4. Final simplification 89.1%

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

Alternative 7: 72.1% accurate, 0.3× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (if (<= z 0.88)
     (/ (fma (- z) z 1.0) (* y_m x_m))
     (pow (* (* z z) (* y_m x_m)) -1.0)))))

C

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

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 0.88)
		tmp = Float64(fma(Float64(-z), z, 1.0) / Float64(y_m * x_m));
	else
		tmp = Float64(Float64(z * z) * Float64(y_m * x_m)) ^ -1.0;
	end
	return Float64(x_s * Float64(y_s * tmp))
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[z, 0.88], N[(N[((-z) * z + 1.0), $MachinePrecision] / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(z * z), $MachinePrecision] * N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 0.880000000000000004

   1. Initial program 93.7%

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

   3. Taylor expanded in z around 0

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

      1. associate-*r/ N/A

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

      2. div-add-rev N/A

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

      3. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. mul-1-neg N/A

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

      8. /-rgt-identity N/A

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

      9. /-rgt-identity N/A

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

      10. unpow2 N/A

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

      11. distribute-lft-neg-in N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-neg.f64 69.1

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

   5. Applied rewrites 69.1%

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

   7. Applied rewrites 70.6%

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

   if 0.880000000000000004 < z

   1. Initial program 75.4%

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

   4. Applied rewrites 79.7%

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

   5. Taylor expanded in z around inf

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

      1. unpow2 N/A

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

      2. lower-*.f64 79.5

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

   7. Applied rewrites 79.5%

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

      1. lift-/.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/l/ N/A

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

      4. lift-/.f64 N/A

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

      5. associate-/l/ N/A

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

      6. frac-2neg N/A

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

      7. metadata-eval N/A

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

      8. associate-*r* N/A

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

      9. distribute-rgt-neg-out N/A

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

      10. lift-neg.f64 N/A

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

      11. remove-double-neg N/A

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

      12. lower-/.f64 N/A

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

   9. Applied rewrites 72.0%

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

4. Final simplification 71.0%

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

Alternative 8: 71.0% accurate, 0.3× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (if (<= z 0.88)
     (/ (fma (- z) z 1.0) (* y_m x_m))
     (pow (* (* (* z z) y_m) x_m) -1.0)))))

C

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

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 0.88)
		tmp = Float64(fma(Float64(-z), z, 1.0) / Float64(y_m * x_m));
	else
		tmp = Float64(Float64(Float64(z * z) * y_m) * x_m) ^ -1.0;
	end
	return Float64(x_s * Float64(y_s * tmp))
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[z, 0.88], N[(N[((-z) * z + 1.0), $MachinePrecision] / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision], N[Power[N[(N[(N[(z * z), $MachinePrecision] * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision], -1.0], $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 0.880000000000000004

   1. Initial program 93.7%

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

   3. Taylor expanded in z around 0

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

      1. associate-*r/ N/A

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

      2. div-add-rev N/A

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

      3. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. mul-1-neg N/A

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

      8. /-rgt-identity N/A

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

      9. /-rgt-identity N/A

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

      10. unpow2 N/A

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

      11. distribute-lft-neg-in N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-neg.f64 69.1

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

   5. Applied rewrites 69.1%

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

   7. Applied rewrites 70.6%

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

   if 0.880000000000000004 < z

   1. Initial program 75.4%

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

   3. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 75.2

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

   5. Applied rewrites 75.2%

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

4. Final simplification 71.8%

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

Alternative 9: 92.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ [x_m, y_m, z] = \mathsf{sort}([x_m, y_m, z])\\ \\ x\_s \cdot \left(y\_s \cdot {\left(\left(\mathsf{fma}\left(z, z, 1\right) \cdot x\_m\right) \cdot y\_m\right)}^{-1}\right) \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (* x_s (* y_s (pow (* (* (fma z z 1.0) x_m) y_m) -1.0))))

C

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

Julia

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

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[Power[N[(N[(N[(z * z + 1.0), $MachinePrecision] * x$95$m), $MachinePrecision] * y$95$m), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 89.1%

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

   1. lift-/.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. associate-/l/ N/A

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

   4. lower-/.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-*.f64 88.9

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

   7. lift-*.f64 N/A

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

   8. lift-+.f64 N/A

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

   9. +-commutative N/A

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

   10. distribute-lft-in N/A

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

   11. *-rgt-identity N/A

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

   12. lower-fma.f64 89.0

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

4. Applied rewrites 89.0%

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

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lift-fma.f64 N/A

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

   4. +-commutative N/A

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

   5. *-commutative N/A

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

   6. distribute-rgt1-in N/A

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

   7. lift-*.f64 N/A

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

   8. lift-fma.f64 N/A

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

   9. associate-*r* N/A

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

   10. *-commutative N/A

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

   11. lift-*.f64 N/A

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

   12. lower-*.f64 90.4

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

6. Applied rewrites 90.4%

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

7. Final simplification 90.4%

   \[\leadsto {\left(\left(\mathsf{fma}\left(z, z, 1\right) \cdot x\right) \cdot y\right)}^{-1} \]
8. Add Preprocessing

Alternative 10: 59.0% accurate, 0.3× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (* x_s (* y_s (pow (* y_m x_m) -1.0))))

C

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

Fortran

y\_m =     private
y\_s =     private
x\_m =     private
x\_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(x_s, y_s, x_m, y_m, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = x_s * (y_s * ((y_m * x_m) ** (-1.0d0)))
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y_m && y_m < z;
public static double code(double x_s, double y_s, double x_m, double y_m, double z) {
	return x_s * (y_s * Math.pow((y_m * x_m), -1.0));
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y_m, z] = sort([x_m, y_m, z])
def code(x_s, y_s, x_m, y_m, z):
	return x_s * (y_s * math.pow((y_m * x_m), -1.0))

Julia

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

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y_m, z = num2cell(sort([x_m, y_m, z])){:}
function tmp = code(x_s, y_s, x_m, y_m, z)
	tmp = x_s * (y_s * ((y_m * x_m) ^ -1.0));
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * N[Power[N[(y$95$m * x$95$m), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 89.1%

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

3. Taylor expanded in z around 0

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

   1. associate-/r* N/A

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

   2. lower-/.f64 N/A

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

   3. lower-/.f64 58.8

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

5. Applied rewrites 58.8%

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

7. Applied rewrites 59.1%

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

8. Final simplification 59.1%

   \[\leadsto {\left(y \cdot x\right)}^{-1} \]
9. Add Preprocessing

Alternative 11: 62.0% accurate, 1.2× speedup

Math

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

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m, y_m, and z should be sorted in increasing order before calling this function.
(FPCore (x_s y_s x_m y_m z)
 :precision binary64
 (*
  x_s
  (*
   y_s
   (if (<= z 1.0)
     (/ (fma (- z) z 1.0) (* y_m x_m))
     (/ y_m (* (* y_m y_m) x_m))))))

C

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

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y_m, z = sort([x_m, y_m, z])
function code(x_s, y_s, x_m, y_m, z)
	tmp = 0.0
	if (z <= 1.0)
		tmp = Float64(fma(Float64(-z), z, 1.0) / Float64(y_m * x_m));
	else
		tmp = Float64(y_m / Float64(Float64(y_m * y_m) * x_m));
	end
	return Float64(x_s * Float64(y_s * tmp))
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, 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[x$95$s_, y$95$s_, x$95$m_, y$95$m_, z_] := N[(x$95$s * N[(y$95$s * If[LessEqual[z, 1.0], N[(N[((-z) * z + 1.0), $MachinePrecision] / N[(y$95$m * x$95$m), $MachinePrecision]), $MachinePrecision], N[(y$95$m / N[(N[(y$95$m * y$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 1

   1. Initial program 93.7%

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

   3. Taylor expanded in z around 0

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

      1. associate-*r/ N/A

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

      2. div-add-rev N/A

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

      3. *-commutative N/A

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

      4. associate-/r* N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. mul-1-neg N/A

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

      8. /-rgt-identity N/A

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

      9. /-rgt-identity N/A

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

      10. unpow2 N/A

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

      11. distribute-lft-neg-in N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-neg.f64 69.1

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

   5. Applied rewrites 69.1%

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

   7. Applied rewrites 70.6%

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

   if 1 < z

   1. Initial program 75.4%

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

   3. Taylor expanded in z around 0

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

      1. associate-/r* N/A

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

      2. lower-/.f64 N/A

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

      3. lower-/.f64 14.2

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

   5. Applied rewrites 14.2%

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

   7. Applied rewrites 15.1%

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

   9. Applied rewrites 25.3%

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

Developer Target 1: 93.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + z \cdot z\\ t_1 := y \cdot t\_0\\ t_2 := \frac{\frac{1}{y}}{t\_0 \cdot x}\\ \mathbf{if}\;t\_1 < -\infty:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 < 8.680743250567252 \cdot 10^{+305}:\\ \;\;\;\;\frac{\frac{1}{x}}{t\_0 \cdot y}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ 1.0 (* z z))) (t_1 (* y t_0)) (t_2 (/ (/ 1.0 y) (* t_0 x))))
   (if (< t_1 (- INFINITY))
     t_2
     (if (< t_1 8.680743250567252e+305) (/ (/ 1.0 x) (* t_0 y)) t_2))))

C

double code(double x, double y, double z) {
	double t_0 = 1.0 + (z * z);
	double t_1 = y * t_0;
	double t_2 = (1.0 / y) / (t_0 * x);
	double tmp;
	if (t_1 < -((double) INFINITY)) {
		tmp = t_2;
	} else if (t_1 < 8.680743250567252e+305) {
		tmp = (1.0 / x) / (t_0 * y);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = 1.0 + (z * z);
	double t_1 = y * t_0;
	double t_2 = (1.0 / y) / (t_0 * x);
	double tmp;
	if (t_1 < -Double.POSITIVE_INFINITY) {
		tmp = t_2;
	} else if (t_1 < 8.680743250567252e+305) {
		tmp = (1.0 / x) / (t_0 * y);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = 1.0 + (z * z)
	t_1 = y * t_0
	t_2 = (1.0 / y) / (t_0 * x)
	tmp = 0
	if t_1 < -math.inf:
		tmp = t_2
	elif t_1 < 8.680743250567252e+305:
		tmp = (1.0 / x) / (t_0 * y)
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(1.0 + Float64(z * z))
	t_1 = Float64(y * t_0)
	t_2 = Float64(Float64(1.0 / y) / Float64(t_0 * x))
	tmp = 0.0
	if (t_1 < Float64(-Inf))
		tmp = t_2;
	elseif (t_1 < 8.680743250567252e+305)
		tmp = Float64(Float64(1.0 / x) / Float64(t_0 * y));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = 1.0 + (z * z);
	t_1 = y * t_0;
	t_2 = (1.0 / y) / (t_0 * x);
	tmp = 0.0;
	if (t_1 < -Inf)
		tmp = t_2;
	elseif (t_1 < 8.680743250567252e+305)
		tmp = (1.0 / x) / (t_0 * y);
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(1.0 + N[(z * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(y * t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(1.0 / y), $MachinePrecision] / N[(t$95$0 * x), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$1, (-Infinity)], t$95$2, If[Less[t$95$1, 8.680743250567252e+305], N[(N[(1.0 / x), $MachinePrecision] / N[(t$95$0 * y), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Reproduce

herbie shell --seed 2024354 
(FPCore (x y z)
  :name "Statistics.Distribution.CauchyLorentz:$cdensity from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (* y (+ 1 (* z z))) -inf.0) (/ (/ 1 y) (* (+ 1 (* z z)) x)) (if (< (* y (+ 1 (* z z))) 868074325056725200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (/ 1 x) (* (+ 1 (* z z)) y)) (/ (/ 1 y) (* (+ 1 (* z z)) x)))))

  (/ (/ 1.0 x) (* y (+ 1.0 (* z z)))))