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

Percentage Accurate: 89.6% → 99.6%

Time: 21.3s

Alternatives: 11

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.6% 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.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 90.5%

   \[\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 z around inf 90.5%

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

   1. *-commutative 90.5%

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

   2. sub-neg 90.5%

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

   3. mul-1-neg 90.5%

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

   4. log1p-def 99.8%

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

   5. mul-1-neg 99.8%

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

5. Simplified 99.8%

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

6. Final simplification 99.8%

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

Alternative 2: 95.9% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + -1 \leq -1000000000000 \lor \neg \left(x + -1 \leq -1\right):\\ \;\;\;\;\left(x + -1\right) \cdot \log y - t\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot \left(1 - z\right) - \log y\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (+ x -1.0) -1000000000000.0) (not (<= (+ x -1.0) -1.0)))
   (- (* (+ x -1.0) (log y)) t)
   (- (- (* y (- 1.0 z)) (log y)) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x + -1.0) <= -1000000000000.0) || !((x + -1.0) <= -1.0)) {
		tmp = ((x + -1.0) * log(y)) - t;
	} else {
		tmp = ((y * (1.0 - z)) - log(y)) - t;
	}
	return tmp;
}

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
    real(8) :: tmp
    if (((x + (-1.0d0)) <= (-1000000000000.0d0)) .or. (.not. ((x + (-1.0d0)) <= (-1.0d0)))) then
        tmp = ((x + (-1.0d0)) * log(y)) - t
    else
        tmp = ((y * (1.0d0 - z)) - log(y)) - t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((x + -1.0) <= -1000000000000.0) || !((x + -1.0) <= -1.0)) {
		tmp = ((x + -1.0) * Math.log(y)) - t;
	} else {
		tmp = ((y * (1.0 - z)) - Math.log(y)) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((x + -1.0) <= -1000000000000.0) or not ((x + -1.0) <= -1.0):
		tmp = ((x + -1.0) * math.log(y)) - t
	else:
		tmp = ((y * (1.0 - z)) - math.log(y)) - t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(x + -1.0) <= -1000000000000.0) || !(Float64(x + -1.0) <= -1.0))
		tmp = Float64(Float64(Float64(x + -1.0) * log(y)) - t);
	else
		tmp = Float64(Float64(Float64(y * Float64(1.0 - z)) - log(y)) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x + -1.0) <= -1000000000000.0) || ~(((x + -1.0) <= -1.0)))
		tmp = ((x + -1.0) * log(y)) - t;
	else
		tmp = ((y * (1.0 - z)) - log(y)) - t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 x 1) < -1e12 or -1 < (-.f64 x 1)

   1. Initial program 94.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 94.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 94.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 94.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 94.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 94.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. Taylor expanded in y around 0 94.8%

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

   if -1e12 < (-.f64 x 1) < -1

   1. Initial program 85.7%

      \[\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 98.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 98.6%

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

   5. Simplified 98.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 0 98.6%

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

      1. neg-mul-1 98.6%

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

      2. log-rec 98.6%

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

      3. +-commutative 98.6%

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

      4. log-rec 98.6%

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

      5. unsub-neg 98.6%

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

      6. mul-1-neg 98.6%

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

      7. distribute-rgt-neg-in 98.6%

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

      8. sub-neg 98.6%

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

      9. metadata-eval 98.6%

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

      10. +-commutative 98.6%

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

      11. distribute-neg-in 98.6%

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

      12. metadata-eval 98.6%

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

      13. unsub-neg 98.6%

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

   8. Simplified 98.6%

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

4. Final simplification 96.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + -1 \leq -1000000000000 \lor \neg \left(x + -1 \leq -1\right):\\ \;\;\;\;\left(x + -1\right) \cdot \log y - t\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot \left(1 - z\right) - \log y\right) - t\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 95.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + -1 \leq -1000000000000 \lor \neg \left(x + -1 \leq -1\right):\\ \;\;\;\;\left(x + -1\right) \cdot \log y - t\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot \left(-z\right) - \log y\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (+ x -1.0) -1000000000000.0) (not (<= (+ x -1.0) -1.0)))
   (- (* (+ x -1.0) (log y)) t)
   (- (- (* y (- z)) (log y)) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x + -1.0) <= -1000000000000.0) || !((x + -1.0) <= -1.0)) {
		tmp = ((x + -1.0) * log(y)) - t;
	} else {
		tmp = ((y * -z) - log(y)) - t;
	}
	return tmp;
}

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
    real(8) :: tmp
    if (((x + (-1.0d0)) <= (-1000000000000.0d0)) .or. (.not. ((x + (-1.0d0)) <= (-1.0d0)))) then
        tmp = ((x + (-1.0d0)) * log(y)) - t
    else
        tmp = ((y * -z) - log(y)) - t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((x + -1.0) <= -1000000000000.0) || !((x + -1.0) <= -1.0)) {
		tmp = ((x + -1.0) * Math.log(y)) - t;
	} else {
		tmp = ((y * -z) - Math.log(y)) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((x + -1.0) <= -1000000000000.0) or not ((x + -1.0) <= -1.0):
		tmp = ((x + -1.0) * math.log(y)) - t
	else:
		tmp = ((y * -z) - math.log(y)) - t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(x + -1.0) <= -1000000000000.0) || !(Float64(x + -1.0) <= -1.0))
		tmp = Float64(Float64(Float64(x + -1.0) * log(y)) - t);
	else
		tmp = Float64(Float64(Float64(y * Float64(-z)) - log(y)) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((x + -1.0) <= -1000000000000.0) || ~(((x + -1.0) <= -1.0)))
		tmp = ((x + -1.0) * log(y)) - t;
	else
		tmp = ((y * -z) - log(y)) - t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 x 1) < -1e12 or -1 < (-.f64 x 1)

   1. Initial program 94.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 94.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 94.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 94.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 94.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 94.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. Taylor expanded in y around 0 94.8%

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

   if -1e12 < (-.f64 x 1) < -1

   1. Initial program 85.7%

      \[\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 98.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 98.6%

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

   5. Simplified 98.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 0 98.6%

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

      1. neg-mul-1 98.6%

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

      2. log-rec 98.6%

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

      3. +-commutative 98.6%

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

      4. log-rec 98.6%

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

      5. unsub-neg 98.6%

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

      6. mul-1-neg 98.6%

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

      7. distribute-rgt-neg-in 98.6%

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

      8. sub-neg 98.6%

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

      9. metadata-eval 98.6%

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

      10. +-commutative 98.6%

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

      11. distribute-neg-in 98.6%

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

      12. metadata-eval 98.6%

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

      13. unsub-neg 98.6%

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

   8. Simplified 98.6%

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

   9. Taylor expanded in z around inf 98.6%

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

       1. mul-1-neg 98.6%

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

       2. distribute-rgt-neg-out 98.6%

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

   11. Simplified 98.6%

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

4. Final simplification 96.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + -1 \leq -1000000000000 \lor \neg \left(x + -1 \leq -1\right):\\ \;\;\;\;\left(x + -1\right) \cdot \log y - t\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot \left(-z\right) - \log y\right) - t\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 87.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.25 \cdot 10^{-25} \lor \neg \left(x \leq 1\right):\\ \;\;\;\;x \cdot \log y - t\\ \mathbf{else}:\\ \;\;\;\;\left(-\log y\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -3.25e-25) (not (<= x 1.0)))
   (- (* x (log y)) t)
   (- (- (log y)) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -3.25e-25) || !(x <= 1.0)) {
		tmp = (x * log(y)) - t;
	} else {
		tmp = -log(y) - t;
	}
	return tmp;
}

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
    real(8) :: tmp
    if ((x <= (-3.25d-25)) .or. (.not. (x <= 1.0d0))) then
        tmp = (x * log(y)) - t
    else
        tmp = -log(y) - t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -3.25e-25) || !(x <= 1.0)) {
		tmp = (x * Math.log(y)) - t;
	} else {
		tmp = -Math.log(y) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x <= -3.25e-25) or not (x <= 1.0):
		tmp = (x * math.log(y)) - t
	else:
		tmp = -math.log(y) - t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((x <= -3.25e-25) || !(x <= 1.0))
		tmp = Float64(Float64(x * log(y)) - t);
	else
		tmp = Float64(Float64(-log(y)) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x <= -3.25e-25) || ~((x <= 1.0)))
		tmp = (x * log(y)) - t;
	else
		tmp = -log(y) - t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[x, -3.25e-25], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[(N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision], N[((-N[Log[y], $MachinePrecision]) - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.25e-25 or 1 < x

   1. Initial program 92.7%

      \[\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 z around inf 92.7%

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

      1. *-commutative 92.7%

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

      2. sub-neg 92.7%

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

      3. mul-1-neg 92.7%

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

      4. log1p-def 99.8%

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

      5. mul-1-neg 99.8%

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

   5. Simplified 99.8%

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

   6. Taylor expanded in x around inf 92.1%

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

      1. *-commutative 92.1%

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

   8. Simplified 92.1%

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

   if -3.25e-25 < x < 1

   1. Initial program 87.9%

      \[\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 87.9%

         \[\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 87.9%

         \[\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 87.9%

         \[\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 87.9%

         \[\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 87.9%

         \[\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.9%

         \[\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.9%

         \[\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.9%

         \[\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.9%

      \[\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. Taylor expanded in y around 0 85.9%

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

   6. Taylor expanded in x around 0 84.6%

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

      1. mul-1-neg 84.6%

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

   8. Simplified 84.6%

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

4. Final simplification 88.7%

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

Alternative 5: 60.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.6 \cdot 10^{+150} \lor \neg \left(z \leq 2.65 \cdot 10^{+119}\right):\\ \;\;\;\;y \cdot \left(-z\right) - t\\ \mathbf{else}:\\ \;\;\;\;\left(-\log y\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -1.6e+150) (not (<= z 2.65e+119)))
   (- (* y (- z)) t)
   (- (- (log y)) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.6e+150) || !(z <= 2.65e+119)) {
		tmp = (y * -z) - t;
	} else {
		tmp = -log(y) - t;
	}
	return tmp;
}

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
    real(8) :: tmp
    if ((z <= (-1.6d+150)) .or. (.not. (z <= 2.65d+119))) then
        tmp = (y * -z) - t
    else
        tmp = -log(y) - t
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -1.6e+150) or not (z <= 2.65e+119):
		tmp = (y * -z) - t
	else:
		tmp = -math.log(y) - t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -1.6e+150) || !(z <= 2.65e+119))
		tmp = Float64(Float64(y * Float64(-z)) - t);
	else
		tmp = Float64(Float64(-log(y)) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -1.6e+150) || ~((z <= 2.65e+119)))
		tmp = (y * -z) - t;
	else
		tmp = -log(y) - t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -1.6e+150], N[Not[LessEqual[z, 2.65e+119]], $MachinePrecision]], N[(N[(y * (-z)), $MachinePrecision] - t), $MachinePrecision], N[((-N[Log[y], $MachinePrecision]) - t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.60000000000000008e150 or 2.64999999999999986e119 < z

   1. Initial program 64.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 98.4%

      \[\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 98.4%

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

   5. Simplified 98.4%

      \[\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 z around inf 63.0%

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

      1. mul-1-neg 63.0%

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

      2. *-commutative 63.0%

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

      3. distribute-rgt-neg-in 63.0%

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

   8. Simplified 63.0%

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

   if -1.60000000000000008e150 < z < 2.64999999999999986e119

   1. Initial program 99.6%

      \[\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 99.6%

         \[\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 99.6%

         \[\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 99.6%

         \[\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 99.6%

         \[\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 99.6%

         \[\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. Taylor expanded in y around 0 99.2%

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

   6. Taylor expanded in x around 0 57.9%

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

      1. mul-1-neg 57.9%

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

   8. Simplified 57.9%

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

4. Final simplification 59.2%

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

Alternative 6: 99.2% accurate, 1.9× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return (((x + -1.0) * 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 = (((x + (-1.0d0)) * log(y)) - (y * (z + (-1.0d0)))) - t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 90.5%

   \[\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.2%

   \[\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.2%

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

5. Simplified 99.2%

   \[\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.2%

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

Alternative 7: 89.5% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.75 \cdot 10^{+236}:\\ \;\;\;\;y \cdot \left(-z\right) - t\\ \mathbf{else}:\\ \;\;\;\;\left(x + -1\right) \cdot \log y - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1.75e+236) (- (* y (- z)) t) (- (* (+ x -1.0) (log y)) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.75e+236) {
		tmp = (y * -z) - t;
	} else {
		tmp = ((x + -1.0) * log(y)) - t;
	}
	return tmp;
}

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
    real(8) :: tmp
    if (z <= (-1.75d+236)) then
        tmp = (y * -z) - t
    else
        tmp = ((x + (-1.0d0)) * log(y)) - t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.75e+236) {
		tmp = (y * -z) - t;
	} else {
		tmp = ((x + -1.0) * Math.log(y)) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -1.75e+236:
		tmp = (y * -z) - t
	else:
		tmp = ((x + -1.0) * math.log(y)) - t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -1.75e+236)
		tmp = Float64(Float64(y * Float64(-z)) - t);
	else
		tmp = Float64(Float64(Float64(x + -1.0) * log(y)) - t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -1.75e+236)
		tmp = (y * -z) - t;
	else
		tmp = ((x + -1.0) * log(y)) - t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.7499999999999999e236

   1. Initial program 43.2%

      \[\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 100.0%

      \[\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 100.0%

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

   5. Simplified 100.0%

      \[\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 z around inf 90.9%

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

      1. mul-1-neg 90.9%

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

      2. *-commutative 90.9%

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

      3. distribute-rgt-neg-in 90.9%

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

   8. Simplified 90.9%

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

   if -1.7499999999999999e236 < z

   1. Initial program 92.4%

      \[\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 92.4%

         \[\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 92.4%

         \[\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 92.4%

         \[\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 92.4%

         \[\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 92.4%

         \[\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. Taylor expanded in y around 0 91.5%

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

4. Final simplification 91.4%

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

Alternative 8: 45.7% accurate, 30.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return (y * (1.0 - z)) - 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 = (y * (1.0d0 - z)) - t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 90.5%

   \[\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.2%

   \[\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.2%

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

5. Simplified 99.2%

   \[\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 y around inf 42.4%

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

   1. mul-1-neg 42.4%

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

   2. distribute-rgt-neg-in 42.4%

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

   3. sub-neg 42.4%

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

   4. metadata-eval 42.4%

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

   5. +-commutative 42.4%

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

   6. distribute-neg-in 42.4%

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

   7. metadata-eval 42.4%

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

   8. unsub-neg 42.4%

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

8. Simplified 42.4%

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

9. Final simplification 42.4%

   \[\leadsto y \cdot \left(1 - z\right) - t \]
10. Add Preprocessing

Alternative 9: 45.5% accurate, 35.8× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return (y * -z) - 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 = (y * -z) - t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 90.5%

   \[\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.2%

   \[\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.2%

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

5. Simplified 99.2%

   \[\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 z around inf 42.2%

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

   1. mul-1-neg 42.2%

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

   2. *-commutative 42.2%

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

   3. distribute-rgt-neg-in 42.2%

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

8. Simplified 42.2%

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

9. Final simplification 42.2%

   \[\leadsto y \cdot \left(-z\right) - t \]
10. Add Preprocessing

Alternative 10: 35.9% accurate, 71.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return 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 = y - t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 90.5%

   \[\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.2%

   \[\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.2%

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

5. Simplified 99.2%

   \[\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 y around inf 42.4%

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

   1. mul-1-neg 42.4%

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

   2. distribute-rgt-neg-in 42.4%

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

   3. sub-neg 42.4%

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

   4. metadata-eval 42.4%

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

   5. +-commutative 42.4%

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

   6. distribute-neg-in 42.4%

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

   7. metadata-eval 42.4%

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

   8. unsub-neg 42.4%

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

8. Simplified 42.4%

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

9. Taylor expanded in z around 0 33.1%

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

10. Final simplification 33.1%

    \[\leadsto y - t \]
11. Add Preprocessing

Alternative 11: 35.6% 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 90.5%

   \[\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 90.5%

      \[\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 90.5%

      \[\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 90.5%

      \[\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 90.5%

      \[\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 90.5%

      \[\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. Taylor expanded in t around inf 32.9%

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

   1. neg-mul-1 32.9%

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

7. Simplified 32.9%

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

8. Final simplification 32.9%

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

Reproduce

herbie shell --seed 2024021 
(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))