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

Percentage Accurate: 99.8% → 99.8%

Time: 8.9s

Alternatives: 8

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.8% 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.8% 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]

Derivation

1. Initial program 99.8%

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

Alternative 2: 85.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.4 \cdot 10^{+68} \lor \neg \left(x \leq 2.26 \cdot 10^{+80}\right):\\ \;\;\;\;x \cdot \log y - y\\ \mathbf{else}:\\ \;\;\;\;\left(-z\right) - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -5.4e+68) (not (<= x 2.26e+80)))
   (- (* x (log y)) y)
   (- (- z) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.4e+68) || !(x <= 2.26e+80)) {
		tmp = (x * log(y)) - y;
	} else {
		tmp = -z - y;
	}
	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) :: tmp
    if ((x <= (-5.4d+68)) .or. (.not. (x <= 2.26d+80))) then
        tmp = (x * log(y)) - y
    else
        tmp = -z - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.4e+68) || !(x <= 2.26e+80)) {
		tmp = (x * Math.log(y)) - y;
	} else {
		tmp = -z - y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -5.4e+68) or not (x <= 2.26e+80):
		tmp = (x * math.log(y)) - y
	else:
		tmp = -z - y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -5.4e+68) || !(x <= 2.26e+80))
		tmp = Float64(Float64(x * log(y)) - y);
	else
		tmp = Float64(Float64(-z) - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -5.4e+68) || ~((x <= 2.26e+80)))
		tmp = (x * log(y)) - y;
	else
		tmp = -z - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -5.4e+68], N[Not[LessEqual[x, 2.26e+80]], $MachinePrecision]], N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision], N[((-z) - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -5.39999999999999982e68 or 2.26e80 < x

   1. Initial program 99.7%

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

   3. Taylor expanded in z around 0 86.6%

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

   if -5.39999999999999982e68 < x < 2.26e80

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 91.7%

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

      1. neg-mul-1 91.7%

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

      2. +-commutative 91.7%

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

      3. distribute-neg-in 91.7%

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

      4. sub-neg 91.7%

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

   5. Simplified 91.7%

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

4. Final simplification 89.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.4 \cdot 10^{+68} \lor \neg \left(x \leq 2.26 \cdot 10^{+80}\right):\\ \;\;\;\;x \cdot \log y - y\\ \mathbf{else}:\\ \;\;\;\;\left(-z\right) - y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 80.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6 \cdot 10^{+119} \lor \neg \left(x \leq 4 \cdot 10^{+105}\right):\\ \;\;\;\;x \cdot \log y\\ \mathbf{else}:\\ \;\;\;\;\left(-z\right) - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -6e+119) (not (<= x 4e+105))) (* x (log y)) (- (- z) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -6e+119) || !(x <= 4e+105)) {
		tmp = x * log(y);
	} else {
		tmp = -z - y;
	}
	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) :: tmp
    if ((x <= (-6d+119)) .or. (.not. (x <= 4d+105))) then
        tmp = x * log(y)
    else
        tmp = -z - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -6e+119) || !(x <= 4e+105)) {
		tmp = x * Math.log(y);
	} else {
		tmp = -z - y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -6e+119) or not (x <= 4e+105):
		tmp = x * math.log(y)
	else:
		tmp = -z - y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -6e+119) || !(x <= 4e+105))
		tmp = Float64(x * log(y));
	else
		tmp = Float64(Float64(-z) - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -6e+119) || ~((x <= 4e+105)))
		tmp = x * log(y);
	else
		tmp = -z - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -6e+119], N[Not[LessEqual[x, 4e+105]], $MachinePrecision]], N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision], N[((-z) - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -6.00000000000000002e119 or 3.9999999999999998e105 < x

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf 71.8%

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

   if -6.00000000000000002e119 < x < 3.9999999999999998e105

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 87.0%

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

      1. neg-mul-1 87.0%

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

      2. +-commutative 87.0%

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

      3. distribute-neg-in 87.0%

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

      4. sub-neg 87.0%

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

   5. Simplified 87.0%

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

4. Final simplification 82.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6 \cdot 10^{+119} \lor \neg \left(x \leq 4 \cdot 10^{+105}\right):\\ \;\;\;\;x \cdot \log y\\ \mathbf{else}:\\ \;\;\;\;\left(-z\right) - y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 51.7% accurate, 15.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 2.25 \cdot 10^{+95}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (if (<= y 2.25e+95) (- z) (- y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 2.25e+95) {
		tmp = -z;
	} else {
		tmp = -y;
	}
	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) :: tmp
    if (y <= 2.25d+95) then
        tmp = -z
    else
        tmp = -y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 2.25e+95) {
		tmp = -z;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= 2.25e+95:
		tmp = -z
	else:
		tmp = -y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 2.25e+95)
		tmp = Float64(-z);
	else
		tmp = Float64(-y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 2.25e+95)
		tmp = -z;
	else
		tmp = -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 2.25e+95], (-z), (-y)]

Derivation

1. Split input into 2 regimes

2. if y < 2.25000000000000008e95

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf 45.4%

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

      1. neg-mul-1 45.4%

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

   5. Simplified 45.4%

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

   if 2.25000000000000008e95 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 72.4%

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

      1. neg-mul-1 72.4%

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

   5. Simplified 72.4%

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

Alternative 5: 66.0% accurate, 26.8× 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.8%

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

3. Taylor expanded in x around 0 69.1%

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

   1. neg-mul-1 69.1%

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

   2. +-commutative 69.1%

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

   3. distribute-neg-in 69.1%

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

   4. sub-neg 69.1%

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

5. Simplified 69.1%

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

Alternative 6: 33.8% accurate, 53.5× 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.8%

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

3. Taylor expanded in y around inf 35.7%

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

   1. neg-mul-1 35.7%

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

5. Simplified 35.7%

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

Alternative 7: 2.3% accurate, 107.0× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := z

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in z around inf 34.5%

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

   1. neg-mul-1 34.5%

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

5. Simplified 34.5%

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

   1. neg-sub0 34.5%

      \[\leadsto \color{blue}{0 - z} \]

   2. sub-neg 34.5%

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

   3. add-sqr-sqrt 16.9%

      \[\leadsto 0 + \color{blue}{\sqrt{-z} \cdot \sqrt{-z}} \]

   4. sqrt-unprod 9.0%

      \[\leadsto 0 + \color{blue}{\sqrt{\left(-z\right) \cdot \left(-z\right)}} \]

   5. sqr-neg 9.0%

      \[\leadsto 0 + \sqrt{\color{blue}{z \cdot z}} \]

   6. sqrt-unprod 0.9%

      \[\leadsto 0 + \color{blue}{\sqrt{z} \cdot \sqrt{z}} \]

   7. add-sqr-sqrt 2.2%

      \[\leadsto 0 + \color{blue}{z} \]

7. Applied egg-rr 2.2%

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

   1. +-lft-identity 2.2%

      \[\leadsto \color{blue}{z} \]

9. Simplified 2.2%

   \[\leadsto \color{blue}{z} \]
10. Add Preprocessing

Alternative 8: 2.2% accurate, 107.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.8%

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

3. Taylor expanded in y around inf 35.7%

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

   1. neg-mul-1 35.7%

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

5. Simplified 35.7%

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

   1. neg-sub0 35.7%

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

   2. sub-neg 35.7%

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

   3. add-sqr-sqrt 0.0%

      \[\leadsto 0 + \color{blue}{\sqrt{-y} \cdot \sqrt{-y}} \]

   4. sqrt-unprod 2.2%

      \[\leadsto 0 + \color{blue}{\sqrt{\left(-y\right) \cdot \left(-y\right)}} \]

   5. sqr-neg 2.2%

      \[\leadsto 0 + \sqrt{\color{blue}{y \cdot y}} \]

   6. sqrt-unprod 2.2%

      \[\leadsto 0 + \color{blue}{\sqrt{y} \cdot \sqrt{y}} \]

   7. add-sqr-sqrt 2.2%

      \[\leadsto 0 + \color{blue}{y} \]

7. Applied egg-rr 2.2%

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

   1. +-lft-identity 2.2%

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

9. Simplified 2.2%

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

Reproduce

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