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

Percentage Accurate: 88.8% → 99.8%

Time: 14.4s

Alternatives: 14

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: 88.8% 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.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 87.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. sub-neg 87.4%

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

   2. +-commutative 87.4%

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

   3. associate-+l+ 87.4%

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

   4. fma-define 87.4%

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

   5. sub-neg 87.4%

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

   6. metadata-eval 87.4%

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

   7. sub-neg 87.4%

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

   8. log1p-define 99.8%

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

   9. fma-define 99.9%

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

   10. sub-neg 99.9%

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

   11. metadata-eval 99.9%

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

3. Simplified 99.9%

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

5. Final simplification 99.9%

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

Alternative 2: 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 87.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 87.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-define 87.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 87.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 87.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 87.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-define 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 3: 99.6% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.4%

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

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

4. Final simplification 99.8%

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

Alternative 4: 99.6% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.4%

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

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

4. Final simplification 99.8%

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

Alternative 5: 99.5% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.4%

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

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

4. Final simplification 99.7%

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

Alternative 6: 89.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.5 \cdot 10^{+195}:\\ \;\;\;\;z \cdot \mathsf{log1p}\left(-y\right) - t\\ \mathbf{elif}\;z \leq 1.2 \cdot 10^{+180}:\\ \;\;\;\;\left(-1 + x\right) \cdot \log y - t\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(z \cdot \left(-1 + y \cdot -0.5\right)\right) - t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -5.5e+195)
   (- (* z (log1p (- y))) t)
   (if (<= z 1.2e+180)
     (- (* (+ -1.0 x) (log y)) t)
     (- (* y (* z (+ -1.0 (* y -0.5)))) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -5.5e+195) {
		tmp = (z * log1p(-y)) - t;
	} else if (z <= 1.2e+180) {
		tmp = ((-1.0 + x) * log(y)) - t;
	} else {
		tmp = (y * (z * (-1.0 + (y * -0.5)))) - t;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -5.5e+195) {
		tmp = (z * Math.log1p(-y)) - t;
	} else if (z <= 1.2e+180) {
		tmp = ((-1.0 + x) * Math.log(y)) - t;
	} else {
		tmp = (y * (z * (-1.0 + (y * -0.5)))) - t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -5.5e+195:
		tmp = (z * math.log1p(-y)) - t
	elif z <= 1.2e+180:
		tmp = ((-1.0 + x) * math.log(y)) - t
	else:
		tmp = (y * (z * (-1.0 + (y * -0.5)))) - t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -5.5e+195)
		tmp = Float64(Float64(z * log1p(Float64(-y))) - t);
	elseif (z <= 1.2e+180)
		tmp = Float64(Float64(Float64(-1.0 + x) * log(y)) - t);
	else
		tmp = Float64(Float64(y * Float64(z * Float64(-1.0 + Float64(y * -0.5)))) - t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -5.5e+195], N[(N[(z * N[Log[1 + (-y)], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision], If[LessEqual[z, 1.2e+180], N[(N[(N[(-1.0 + x), $MachinePrecision] * N[Log[y], $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision], N[(N[(y * N[(z * N[(-1.0 + N[(y * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -5.49999999999999994e195

   1. Initial program 58.6%

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

      1. add-sqr-sqrt 9.0%

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

      2. pow2 9.0%

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

      3. sub-neg 9.0%

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

      4. metadata-eval 9.0%

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

   4. Applied egg-rr 9.0%

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

   5. Taylor expanded in z around inf 44.9%

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

      1. sub-neg 44.9%

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

      2. log1p-undefine 86.9%

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

   7. Simplified 86.9%

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

   if -5.49999999999999994e195 < z < 1.1999999999999999e180

   1. Initial program 95.3%

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

         \[\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-define 95.3%

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

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

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

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

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

   if 1.1999999999999999e180 < z

   1. Initial program 48.4%

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

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

   4. Taylor expanded in z around inf 99.9%

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

   5. Taylor expanded in z around inf 75.9%

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

4. Final simplification 91.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5.5 \cdot 10^{+195}:\\ \;\;\;\;z \cdot \mathsf{log1p}\left(-y\right) - t\\ \mathbf{elif}\;z \leq 1.2 \cdot 10^{+180}:\\ \;\;\;\;\left(-1 + x\right) \cdot \log y - t\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(z \cdot \left(-1 + y \cdot -0.5\right)\right) - t\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 99.3% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

function tmp = code(x, y, z, t)
	tmp = (((-1.0 + x) * log(y)) + (y * (z * (-1.0 + (y * -0.5))))) - 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 * N[(-1.0 + N[(y * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision]

Derivation

1. Initial program 87.4%

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

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

4. Taylor expanded in z around inf 99.7%

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

5. Final simplification 99.7%

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

Alternative 8: 78.4% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -250000000000.0) (not (<= t 1.52e+38)))
   (- (* y (* z (+ -1.0 (* y -0.5)))) t)
   (* (+ -1.0 x) (log y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -250000000000.0) || !(t <= 1.52e+38)) {
		tmp = (y * (z * (-1.0 + (y * -0.5)))) - t;
	} else {
		tmp = (-1.0 + x) * log(y);
	}
	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 ((t <= (-250000000000.0d0)) .or. (.not. (t <= 1.52d+38))) then
        tmp = (y * (z * ((-1.0d0) + (y * (-0.5d0))))) - t
    else
        tmp = ((-1.0d0) + x) * log(y)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.5e11 or 1.51999999999999996e38 < t

   1. Initial program 95.0%

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

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

   4. Taylor expanded in z around inf 99.9%

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

   5. Taylor expanded in z around inf 80.6%

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

   if -2.5e11 < t < 1.51999999999999996e38

   1. Initial program 81.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 81.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-define 81.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 81.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 81.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 81.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-define 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 64.1%

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

      1. associate--l+ 64.1%

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

      2. sub-neg 64.1%

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

      3. metadata-eval 64.1%

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

      4. associate-/l* 64.0%

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

      5. +-commutative 64.0%

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

      6. sub-neg 64.0%

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

      7. metadata-eval 64.0%

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

      8. associate-/l* 56.3%

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

      9. +-commutative 56.3%

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

   7. Simplified 56.3%

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

   8. Taylor expanded in y around 0 62.4%

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

   9. Taylor expanded in t around 0 78.4%

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

4. Final simplification 79.4%

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

Alternative 9: 65.6% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -1.28e+17) (not (<= x 100000000.0)))
   (* x (log y))
   (- (* y (* z (+ -1.0 (* y -0.5)))) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -1.28e+17) || !(x <= 100000000.0)) {
		tmp = x * log(y);
	} else {
		tmp = (y * (z * (-1.0 + (y * -0.5)))) - 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.28d+17)) .or. (.not. (x <= 100000000.0d0))) then
        tmp = x * log(y)
    else
        tmp = (y * (z * ((-1.0d0) + (y * (-0.5d0))))) - 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.28e+17) || !(x <= 100000000.0)) {
		tmp = x * Math.log(y);
	} else {
		tmp = (y * (z * (-1.0 + (y * -0.5)))) - t;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.28e17 or 1e8 < x

   1. Initial program 95.3%

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

         \[\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-define 95.3%

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

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

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

         \[\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-define 99.7%

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

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

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

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

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

      1. associate--l+ 72.3%

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

      2. sub-neg 72.3%

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

      3. metadata-eval 72.3%

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

      4. associate-/l* 72.2%

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

      5. +-commutative 72.2%

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

      6. sub-neg 72.2%

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

      7. metadata-eval 72.2%

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

      8. associate-/l* 68.9%

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

      9. +-commutative 68.9%

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

   7. Simplified 68.9%

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

   8. Taylor expanded in y around 0 72.3%

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

   9. Taylor expanded in x around inf 73.3%

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

       1. *-commutative 73.3%

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

   11. Simplified 73.3%

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

   if -1.28e17 < x < 1e8

   1. Initial program 81.6%

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

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

   4. Taylor expanded in z around inf 99.7%

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

   5. Taylor expanded in z around inf 63.5%

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

4. Final simplification 67.7%

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

Alternative 10: 54.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -2.2 \cdot 10^{-14} \lor \neg \left(t \leq 5.2 \cdot 10^{-58}\right):\\ \;\;\;\;y \cdot \left(z \cdot \left(-1 + y \cdot -0.5\right)\right) - t\\ \mathbf{else}:\\ \;\;\;\;-\log y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -2.2e-14) (not (<= t 5.2e-58)))
   (- (* y (* z (+ -1.0 (* y -0.5)))) t)
   (- (log y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -2.2e-14) || !(t <= 5.2e-58)) {
		tmp = (y * (z * (-1.0 + (y * -0.5)))) - t;
	} else {
		tmp = -log(y);
	}
	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 ((t <= (-2.2d-14)) .or. (.not. (t <= 5.2d-58))) then
        tmp = (y * (z * ((-1.0d0) + (y * (-0.5d0))))) - t
    else
        tmp = -log(y)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if (t <= -2.2e-14) or not (t <= 5.2e-58):
		tmp = (y * (z * (-1.0 + (y * -0.5)))) - t
	else:
		tmp = -math.log(y)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -2.2e-14) || !(t <= 5.2e-58))
		tmp = Float64(Float64(y * Float64(z * Float64(-1.0 + Float64(y * -0.5)))) - t);
	else
		tmp = Float64(-log(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((t <= -2.2e-14) || ~((t <= 5.2e-58)))
		tmp = (y * (z * (-1.0 + (y * -0.5)))) - t;
	else
		tmp = -log(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[t, -2.2e-14], N[Not[LessEqual[t, 5.2e-58]], $MachinePrecision]], N[(N[(y * N[(z * N[(-1.0 + N[(y * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - t), $MachinePrecision], (-N[Log[y], $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if t < -2.2000000000000001e-14 or 5.20000000000000013e-58 < t

   1. Initial program 90.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 99.9%

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

   4. Taylor expanded in z around inf 99.9%

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

   5. Taylor expanded in z around inf 71.6%

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

   if -2.2000000000000001e-14 < t < 5.20000000000000013e-58

   1. Initial program 84.0%

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

         \[\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-define 84.0%

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

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

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

         \[\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-define 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 63.1%

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

      1. associate--l+ 63.1%

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

      2. sub-neg 63.1%

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

      3. metadata-eval 63.1%

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

      4. associate-/l* 63.0%

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

      5. +-commutative 63.0%

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

      6. sub-neg 63.0%

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

      7. metadata-eval 63.0%

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

      8. associate-/l* 53.5%

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

      9. +-commutative 53.5%

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

   7. Simplified 53.5%

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

   8. Taylor expanded in y around 0 61.7%

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

   9. Taylor expanded in t around 0 82.5%

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

   10. Taylor expanded in x around 0 43.1%

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

       1. mul-1-neg 43.1%

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

   12. Simplified 43.1%

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

4. Final simplification 58.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -2.2 \cdot 10^{-14} \lor \neg \left(t \leq 5.2 \cdot 10^{-58}\right):\\ \;\;\;\;y \cdot \left(z \cdot \left(-1 + y \cdot -0.5\right)\right) - t\\ \mathbf{else}:\\ \;\;\;\;-\log y\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 99.0% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.4%

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

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

4. Taylor expanded in z around inf 99.7%

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

5. Taylor expanded in y around 0 99.3%

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

   1. +-commutative 99.3%

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

   2. sub-neg 99.3%

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

   3. metadata-eval 99.3%

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

   4. +-commutative 99.3%

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

   5. mul-1-neg 99.3%

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

   6. unsub-neg 99.3%

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

   7. +-commutative 99.3%

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

7. Simplified 99.3%

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

8. Final simplification 99.3%

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

Alternative 12: 46.3% accurate, 19.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 87.4%

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

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

4. Taylor expanded in z around inf 99.7%

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

5. Taylor expanded in z around inf 48.0%

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

6. Final simplification 48.0%

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

Alternative 13: 35.4% 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 87.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 87.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-define 87.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 87.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 87.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 87.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-define 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 35.1%

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

   1. mul-1-neg 35.1%

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

7. Simplified 35.1%

   \[\leadsto \color{blue}{-t} \]
8. Add Preprocessing

Alternative 14: 2.3% accurate, 215.0× speedup

Math

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

FPCore

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

C

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

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 = 0.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := 0.0

Derivation

1. Initial program 87.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 87.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-define 87.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 87.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 87.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 87.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-define 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 35.1%

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

   1. mul-1-neg 35.1%

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

7. Simplified 35.1%

   \[\leadsto \color{blue}{-t} \]
8. Step-by-step derivation

   1. expm1-log1p-u 15.2%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(-t\right)\right)} \]

   2. expm1-undefine 15.1%

      \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(-t\right)} - 1} \]

9. Applied egg-rr 15.1%

   \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(-t\right)} - 1} \]
10. Step-by-step derivation

    1. sub-neg 15.1%

       \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(-t\right)} + \left(-1\right)} \]

    2. log1p-undefine 15.1%

       \[\leadsto e^{\color{blue}{\log \left(1 + \left(-t\right)\right)}} + \left(-1\right) \]

    3. rem-exp-log 35.0%

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

    4. unsub-neg 35.0%

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

    5. metadata-eval 35.0%

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

11. Simplified 35.0%

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

12. Taylor expanded in t around 0 2.4%

    \[\leadsto \color{blue}{1} + -1 \]
13. Step-by-step derivation

    1. metadata-eval 2.4%

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

14. Applied egg-rr 2.4%

    \[\leadsto \color{blue}{0} \]
15. Add Preprocessing

Reproduce

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