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

Percentage Accurate: 89.0% → 99.8%

Time: 14.4s

Alternatives: 7

Speedup: 1.9×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 89.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(z + -1, \mathsf{log1p}\left(-y\right), \left(-1 + x\right) \cdot \log y\right) - t \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (- (fma (+ z -1.0) (log1p (- y)) (* (+ -1.0 x) (log y))) t))

C

double code(double x, double y, double z, double t) {
	return fma((z + -1.0), log1p(-y), ((-1.0 + x) * log(y))) - t;
}

Julia

function code(x, y, z, t)
	return Float64(fma(Float64(z + -1.0), log1p(Float64(-y)), Float64(Float64(-1.0 + x) * log(y))) - t)
end

Wolfram

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

Derivation

1. Initial program 88.8%

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

   1. +-commutative 88.8%

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

   2. fma-def 88.8%

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

   3. sub-neg 88.8%

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

   4. metadata-eval 88.8%

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

   5. sub-neg 88.8%

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

   6. log1p-def 99.8%

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

   7. sub-neg 99.8%

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

   8. metadata-eval 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z + -1, \mathsf{log1p}\left(-y\right), \left(x + -1\right) \cdot \log y\right) - t} \]
4. Add Preprocessing

5. Final simplification 99.8%

   \[\leadsto \mathsf{fma}\left(z + -1, \mathsf{log1p}\left(-y\right), \left(-1 + x\right) \cdot \log y\right) - t \]
6. Add Preprocessing

Alternative 2: 99.1% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.8%

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

3. Taylor expanded in y around 0 99.6%

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

   1. mul-1-neg 99.6%

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

5. Simplified 99.6%

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

6. Final simplification 99.6%

   \[\leadsto \left(\left(-1 + x\right) \cdot \log y - y \cdot \left(z + -1\right)\right) - t \]
7. Add Preprocessing

Alternative 3: 88.0% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(-1.0 + x), $MachinePrecision] * N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]

Derivation

1. Initial program 88.8%

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

3. Taylor expanded in y around 0 88.4%

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

4. Final simplification 88.4%

   \[\leadsto \left(-1 + x\right) \cdot \log y - t \]
5. Add Preprocessing

Alternative 4: 53.4% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.8%

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

3. Taylor expanded in y around 0 88.4%

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

4. Taylor expanded in t around 0 58.2%

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

5. Final simplification 58.2%

   \[\leadsto \left(-1 + x\right) \cdot \log y \]
6. Add Preprocessing

Alternative 5: 70.0% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \log y - t \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.8%

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

3. Taylor expanded in y around 0 88.4%

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

4. Taylor expanded in x around inf 65.6%

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

5. Final simplification 65.6%

   \[\leadsto x \cdot \log y - t \]
6. Add Preprocessing

Alternative 6: 35.9% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ x \cdot \log y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.8%

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

3. Taylor expanded in y around 0 99.6%

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

   1. mul-1-neg 99.6%

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

5. Simplified 99.6%

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

6. Taylor expanded in x around inf 35.4%

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

   1. *-commutative 35.4%

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

8. Simplified 35.4%

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

9. Final simplification 35.4%

   \[\leadsto x \cdot \log y \]
10. Add Preprocessing

Alternative 7: 36.1% accurate, 107.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 88.8%

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

3. Taylor expanded in t around inf 32.4%

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

   1. neg-mul-1 32.4%

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

5. Simplified 32.4%

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

6. Final simplification 32.4%

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

Reproduce

herbie shell --seed 2024033 
(FPCore (x y z t)
  :name "Statistics.Distribution.Beta:$cdensity from math-functions-0.1.5.2"
  :precision binary64
  (- (+ (* (- x 1.0) (log y)) (* (- z 1.0) (log (- 1.0 y)))) t))