Statistics.Distribution.Poisson:$clogProbability from math-functions-0.1.5.2

Percentage Accurate: 99.9% → 99.9%

Time: 7.8s

Alternatives: 6

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot \log y - z\right) - y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (- (* x (log y)) z) y))

C

double code(double x, double y, double z) {
	return ((x * log(y)) - z) - y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x * log(y)) - z) - y
end function

Java

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

Python

def code(x, y, z):
	return ((x * math.log(y)) - z) - y

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x * log(y)) - z) - y)
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x * log(y)) - z) - y;
end

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot \log y - z\right) - y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (- (* x (log y)) z) y))

C

double code(double x, double y, double z) {
	return ((x * log(y)) - z) - y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x * log(y)) - z) - y
end function

Java

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

Python

def code(x, y, z):
	return ((x * math.log(y)) - z) - y

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x * log(y)) - z) - y)
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x * log(y)) - z) - y;
end

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\log y \cdot x - z\right) - y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (- (* (log y) x) z) y))

C

double code(double x, double y, double z) {
	return ((log(y) * x) - z) - y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((log(y) * x) - z) - y
end function

Java

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

Python

def code(x, y, z):
	return ((math.log(y) * x) - z) - y

Julia

function code(x, y, z)
	return Float64(Float64(Float64(log(y) * x) - z) - y)
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((log(y) * x) - z) - y;
end

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(x \cdot \log y - z\right) - y \]
2. Add Preprocessing

3. Final simplification 99.9%

   \[\leadsto \left(\log y \cdot x - z\right) - y \]
4. Add Preprocessing

Alternative 2: 85.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\log y, x, -y\right)\\ \mathbf{if}\;x \leq -1.04 \cdot 10^{+21}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 1.75 \cdot 10^{+31}:\\ \;\;\;\;\left(-z\right) - y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (log y) x (- y))))
   (if (<= x -1.04e+21) t_0 (if (<= x 1.75e+31) (- (- z) y) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(log(y), x, -y);
	double tmp;
	if (x <= -1.04e+21) {
		tmp = t_0;
	} else if (x <= 1.75e+31) {
		tmp = -z - y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(log(y), x, Float64(-y))
	tmp = 0.0
	if (x <= -1.04e+21)
		tmp = t_0;
	elseif (x <= 1.75e+31)
		tmp = Float64(Float64(-z) - y);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Log[y], $MachinePrecision] * x + (-y)), $MachinePrecision]}, If[LessEqual[x, -1.04e+21], t$95$0, If[LessEqual[x, 1.75e+31], N[((-z) - y), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.04e21 or 1.75e31 < x

   1. Initial program 99.9%

      \[\left(x \cdot \log y - z\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. sub-neg N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-log.f64 N/A

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

      5. lower-neg.f64 83.1

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

   5. Applied rewrites 83.1%

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

   if -1.04e21 < x < 1.75e31

   1. Initial program 99.9%

      \[\left(x \cdot \log y - z\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 90.2

         \[\leadsto \color{blue}{\left(-z\right)} - y \]

   5. Applied rewrites 90.2%

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

Alternative 3: 78.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \log y \cdot x\\ \mathbf{if}\;x \leq -1.7 \cdot 10^{+70}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 8.2 \cdot 10^{+135}:\\ \;\;\;\;\left(-z\right) - y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (log y) x)))
   (if (<= x -1.7e+70) t_0 (if (<= x 8.2e+135) (- (- z) y) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = log(y) * x;
	double tmp;
	if (x <= -1.7e+70) {
		tmp = t_0;
	} else if (x <= 8.2e+135) {
		tmp = -z - y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = log(y) * x
    if (x <= (-1.7d+70)) then
        tmp = t_0
    else if (x <= 8.2d+135) then
        tmp = -z - y
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = Math.log(y) * x;
	double tmp;
	if (x <= -1.7e+70) {
		tmp = t_0;
	} else if (x <= 8.2e+135) {
		tmp = -z - y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = math.log(y) * x
	tmp = 0
	if x <= -1.7e+70:
		tmp = t_0
	elif x <= 8.2e+135:
		tmp = -z - y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(log(y) * x)
	tmp = 0.0
	if (x <= -1.7e+70)
		tmp = t_0;
	elseif (x <= 8.2e+135)
		tmp = Float64(Float64(-z) - y);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = log(y) * x;
	tmp = 0.0;
	if (x <= -1.7e+70)
		tmp = t_0;
	elseif (x <= 8.2e+135)
		tmp = -z - y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Log[y], $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[x, -1.7e+70], t$95$0, If[LessEqual[x, 8.2e+135], N[((-z) - y), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.7e70 or 8.2e135 < x

   1. Initial program 99.9%

      \[\left(x \cdot \log y - z\right) - y \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. flip-- N/A

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

      3. div-sub N/A

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

      4. sub-neg N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*l* N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

   4. Applied rewrites 97.4%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 95.7%

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

   8. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \log y} \]
   9. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\log y \cdot x} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\log y \cdot x} \]

      3. lower-log.f64 75.8

         \[\leadsto \color{blue}{\log y} \cdot x \]

   10. Applied rewrites 75.8%

       \[\leadsto \color{blue}{\log y \cdot x} \]

   if -1.7e70 < x < 8.2e135

   1. Initial program 99.9%

      \[\left(x \cdot \log y - z\right) - y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 83.2

         \[\leadsto \color{blue}{\left(-z\right)} - y \]

   5. Applied rewrites 83.2%

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

Alternative 4: 66.6% accurate, 18.7× speedup

Math

\[\begin{array}{l} \\ \left(-z\right) - y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (- z) y))

C

double code(double x, double y, double z) {
	return -z - y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = -z - y
end function

Java

public static double code(double x, double y, double z) {
	return -z - y;
}

Python

def code(x, y, z):
	return -z - y

Julia

function code(x, y, z)
	return Float64(Float64(-z) - y)
end

MATLAB

function tmp = code(x, y, z)
	tmp = -z - y;
end

Wolfram

code[x_, y_, z_] := N[((-z) - y), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(x \cdot \log y - z\right) - y \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 63.9

      \[\leadsto \color{blue}{\left(-z\right)} - y \]

5. Applied rewrites 63.9%

   \[\leadsto \color{blue}{\left(-z\right)} - y \]
6. Add Preprocessing

Alternative 5: 34.1% accurate, 37.3× speedup

Math

\[\begin{array}{l} \\ -y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- y))

C

double code(double x, double y, double z) {
	return -y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = -y
end function

Java

public static double code(double x, double y, double z) {
	return -y;
}

Python

def code(x, y, z):
	return -y

Julia

function code(x, y, z)
	return Float64(-y)
end

MATLAB

function tmp = code(x, y, z)
	tmp = -y;
end

Wolfram

code[x_, y_, z_] := (-y)

Derivation

1. Initial program 99.9%

   \[\left(x \cdot \log y - z\right) - y \]
2. Add Preprocessing

3. Taylor expanded in y around inf

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(y\right)} \]

   2. lower-neg.f64 32.2

      \[\leadsto \color{blue}{-y} \]

5. Applied rewrites 32.2%

   \[\leadsto \color{blue}{-y} \]
6. Add Preprocessing

Alternative 6: 2.3% accurate, 112.0× speedup

Math

\[\begin{array}{l} \\ y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 y)

C

double code(double x, double y, double z) {
	return y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = y
end function

Java

public static double code(double x, double y, double z) {
	return y;
}

Python

def code(x, y, z):
	return y

Julia

function code(x, y, z)
	return y
end

MATLAB

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

Wolfram

code[x_, y_, z_] := y

Derivation

1. Initial program 99.9%

   \[\left(x \cdot \log y - z\right) - y \]
2. Add Preprocessing

3. Taylor expanded in y around inf

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(y\right)} \]

   2. lower-neg.f64 32.2

      \[\leadsto \color{blue}{-y} \]

5. Applied rewrites 32.2%

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

7. Applied rewrites 18.0%

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

9. Applied rewrites 2.2%

   \[\leadsto y \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024332 
(FPCore (x y z)
  :name "Statistics.Distribution.Poisson:$clogProbability from math-functions-0.1.5.2"
  :precision binary64
  (- (- (* x (log y)) z) y))