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

Percentage Accurate: 99.9% → 99.9%

Time: 9.0s

Alternatives: 7

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(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. Final simplification 99.8%

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

Alternative 2: 84.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.5 \cdot 10^{+16} \lor \neg \left(z \leq 7 \cdot 10^{+127}\right):\\ \;\;\;\;\left(-z\right) - y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \log y - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.5e+16) (not (<= z 7e+127))) (- (- z) y) (- (* x (log y)) y)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.5e+16) || !(z <= 7e+127)) {
		tmp = -z - y;
	} else {
		tmp = (x * Math.log(y)) - y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.5e+16) or not (z <= 7e+127):
		tmp = -z - y
	else:
		tmp = (x * math.log(y)) - y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.5e+16) || !(z <= 7e+127))
		tmp = Float64(Float64(-z) - y);
	else
		tmp = Float64(Float64(x * log(y)) - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.5e+16) || ~((z <= 7e+127)))
		tmp = -z - y;
	else
		tmp = (x * log(y)) - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.5e+16], N[Not[LessEqual[z, 7e+127]], $MachinePrecision]], N[((-z) - y), $MachinePrecision], N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.5e16 or 6.99999999999999956e127 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 87.3%

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

      1. neg-mul-1 87.3%

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

   5. Simplified 87.3%

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

   if -1.5e16 < z < 6.99999999999999956e127

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0 89.0%

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

4. Final simplification 88.4%

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

Alternative 3: 85.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \log y\\ \mathbf{if}\;z \leq -8.8 \cdot 10^{-41} \lor \neg \left(z \leq 1420000\right):\\ \;\;\;\;t_0 - z\\ \mathbf{else}:\\ \;\;\;\;t_0 - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (log y))))
   (if (or (<= z -8.8e-41) (not (<= z 1420000.0))) (- t_0 z) (- t_0 y))))

C

double code(double x, double y, double z) {
	double t_0 = x * log(y);
	double tmp;
	if ((z <= -8.8e-41) || !(z <= 1420000.0)) {
		tmp = t_0 - z;
	} else {
		tmp = t_0 - 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) :: t_0
    real(8) :: tmp
    t_0 = x * log(y)
    if ((z <= (-8.8d-41)) .or. (.not. (z <= 1420000.0d0))) then
        tmp = t_0 - z
    else
        tmp = t_0 - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x * Math.log(y);
	double tmp;
	if ((z <= -8.8e-41) || !(z <= 1420000.0)) {
		tmp = t_0 - z;
	} else {
		tmp = t_0 - y;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * math.log(y)
	tmp = 0
	if (z <= -8.8e-41) or not (z <= 1420000.0):
		tmp = t_0 - z
	else:
		tmp = t_0 - y
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * log(y))
	tmp = 0.0
	if ((z <= -8.8e-41) || !(z <= 1420000.0))
		tmp = Float64(t_0 - z);
	else
		tmp = Float64(t_0 - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * log(y);
	tmp = 0.0;
	if ((z <= -8.8e-41) || ~((z <= 1420000.0)))
		tmp = t_0 - z;
	else
		tmp = t_0 - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[z, -8.8e-41], N[Not[LessEqual[z, 1420000.0]], $MachinePrecision]], N[(t$95$0 - z), $MachinePrecision], N[(t$95$0 - y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -8.7999999999999999e-41 or 1.42e6 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf 99.9%

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

   4. Taylor expanded in y around 0 86.5%

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

   if -8.7999999999999999e-41 < z < 1.42e6

   1. Initial program 99.7%

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

   3. Taylor expanded in z around 0 95.4%

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

4. Final simplification 91.2%

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

Alternative 4: 77.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.22 \cdot 10^{+143} \lor \neg \left(x \leq 1.55 \cdot 10^{-21}\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 -1.22e+143) (not (<= x 1.55e-21))) (* x (log y)) (- (- z) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.22e+143) || !(x <= 1.55e-21)) {
		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 <= (-1.22d+143)) .or. (.not. (x <= 1.55d-21))) 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 <= -1.22e+143) || !(x <= 1.55e-21)) {
		tmp = x * Math.log(y);
	} else {
		tmp = -z - y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.22e+143) or not (x <= 1.55e-21):
		tmp = x * math.log(y)
	else:
		tmp = -z - y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.22e+143) || !(x <= 1.55e-21))
		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 <= -1.22e+143) || ~((x <= 1.55e-21)))
		tmp = x * log(y);
	else
		tmp = -z - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.22e+143], N[Not[LessEqual[x, 1.55e-21]], $MachinePrecision]], N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision], N[((-z) - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.22000000000000004e143 or 1.5499999999999999e-21 < x

   1. Initial program 99.6%

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

   3. Taylor expanded in y around inf 98.6%

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

   4. Taylor expanded in x around inf 72.6%

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

      1. mul-1-neg 72.6%

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

      2. distribute-rgt-neg-in 72.6%

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

      3. log-rec 73.6%

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

      4. remove-double-neg 73.6%

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

   6. Simplified 73.6%

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

   if -1.22000000000000004e143 < x < 1.5499999999999999e-21

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 88.0%

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

      1. neg-mul-1 88.0%

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

   5. Simplified 88.0%

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

4. Final simplification 82.7%

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

Alternative 5: 51.6% accurate, 8.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.8 \cdot 10^{-57} \lor \neg \left(z \leq 580000\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -3.8e-57) (not (<= z 580000.0))) (- z) (- y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.8e-57) || !(z <= 580000.0)) {
		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 ((z <= (-3.8d-57)) .or. (.not. (z <= 580000.0d0))) 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 ((z <= -3.8e-57) || !(z <= 580000.0)) {
		tmp = -z;
	} else {
		tmp = -y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -3.8e-57) or not (z <= 580000.0):
		tmp = -z
	else:
		tmp = -y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -3.8e-57) || !(z <= 580000.0))
		tmp = Float64(-z);
	else
		tmp = Float64(-y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -3.8e-57) || ~((z <= 580000.0)))
		tmp = -z;
	else
		tmp = -y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -3.8e-57], N[Not[LessEqual[z, 580000.0]], $MachinePrecision]], (-z), (-y)]

Derivation

1. Split input into 2 regimes

2. if z < -3.7999999999999997e-57 or 5.8e5 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf 99.9%

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

   4. Taylor expanded in z around inf 63.7%

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

      1. neg-mul-1 63.7%

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

   6. Simplified 63.7%

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

   if -3.7999999999999997e-57 < z < 5.8e5

   1. Initial program 99.8%

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

   3. Taylor expanded in y around inf 50.9%

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

      1. mul-1-neg 50.9%

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

   5. Simplified 50.9%

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

4. Final simplification 57.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.8 \cdot 10^{-57} \lor \neg \left(z \leq 580000\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;-y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 66.3% 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 65.6%

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

   1. neg-mul-1 65.6%

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

5. Simplified 65.6%

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

6. Final simplification 65.6%

   \[\leadsto \left(-z\right) - y \]
7. Add Preprocessing

Alternative 7: 33.9% 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 33.3%

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

   1. mul-1-neg 33.3%

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

5. Simplified 33.3%

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

6. Final simplification 33.3%

   \[\leadsto -y \]
7. Add Preprocessing

Reproduce

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