Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, B

Percentage Accurate: 85.1% → 85.1%

Time: 3.5s

Alternatives: 7

Speedup: 1.0×

Specification

\[\mathsf{TRUE}\left(\right)\]

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 85.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.6%

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

Alternative 2: 5.1% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((((x * log(y)) + (z * log((1.0 - y)))) - t) <= -2e-190) {
		tmp = log(y);
	} else {
		tmp = 1.0 - 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 ((((x * log(y)) + (z * log((1.0d0 - y)))) - t) <= (-2d-190)) then
        tmp = log(y)
    else
        tmp = 1.0d0 - y
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.f64 (*.f64 x (log.f64 y)) (*.f64 z (log.f64 (-.f64 #s(literal 1 binary64) y)))) t) < -2e-190

   1. Initial program 88.3%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 87.1%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 5.0%

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

   if -2e-190 < (-.f64 (+.f64 (*.f64 x (log.f64 y)) (*.f64 z (log.f64 (-.f64 #s(literal 1 binary64) y)))) t)

   1. Initial program 80.6%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 78.8%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 5.0%

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

Alternative 3: 64.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \log y\\ \mathbf{if}\;x \leq -64000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 6.7 \cdot 10^{+125}:\\ \;\;\;\;\log \left(1 - y\right) - t\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (log y))))
   (if (<= x -64000000.0) t_1 (if (<= x 6.7e+125) (- (log (- 1.0 y)) t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * log(y);
	double tmp;
	if (x <= -64000000.0) {
		tmp = t_1;
	} else if (x <= 6.7e+125) {
		tmp = log((1.0 - y)) - t;
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = x * log(y)
    if (x <= (-64000000.0d0)) then
        tmp = t_1
    else if (x <= 6.7d+125) then
        tmp = log((1.0d0 - y)) - t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	t_1 = x * math.log(y)
	tmp = 0
	if x <= -64000000.0:
		tmp = t_1
	elif x <= 6.7e+125:
		tmp = math.log((1.0 - y)) - t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x * log(y))
	tmp = 0.0
	if (x <= -64000000.0)
		tmp = t_1;
	elseif (x <= 6.7e+125)
		tmp = Float64(log(Float64(1.0 - y)) - t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x * log(y);
	tmp = 0.0;
	if (x <= -64000000.0)
		tmp = t_1;
	elseif (x <= 6.7e+125)
		tmp = log((1.0 - y)) - t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -64000000.0], t$95$1, If[LessEqual[x, 6.7e+125], N[(N[Log[N[(1.0 - y), $MachinePrecision]], $MachinePrecision] - t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.4e7 or 6.7000000000000003e125 < x

   1. Initial program 97.8%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 97.8%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 79.6%

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

   if -6.4e7 < x < 6.7000000000000003e125

   1. Initial program 75.9%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 73.5%

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

   6. Taylor expanded in x around -inf

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

   8. Applied rewrites 57.5%

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

Alternative 4: 64.0% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \log y - t\\ \mathbf{if}\;t \leq -1.36 \cdot 10^{+63}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 9 \cdot 10^{+68}:\\ \;\;\;\;x \cdot \log y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- (log y) t)))
   (if (<= t -1.36e+63) t_1 (if (<= t 9e+68) (* x (log y)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = log(y) - t;
	double tmp;
	if (t <= -1.36e+63) {
		tmp = t_1;
	} else if (t <= 9e+68) {
		tmp = x * log(y);
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = log(y) - t
    if (t <= (-1.36d+63)) then
        tmp = t_1
    else if (t <= 9d+68) then
        tmp = x * log(y)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = Math.log(y) - t;
	double tmp;
	if (t <= -1.36e+63) {
		tmp = t_1;
	} else if (t <= 9e+68) {
		tmp = x * Math.log(y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = math.log(y) - t
	tmp = 0
	if t <= -1.36e+63:
		tmp = t_1
	elif t <= 9e+68:
		tmp = x * math.log(y)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(log(y) - t)
	tmp = 0.0
	if (t <= -1.36e+63)
		tmp = t_1;
	elseif (t <= 9e+68)
		tmp = Float64(x * log(y));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = log(y) - t;
	tmp = 0.0;
	if (t <= -1.36e+63)
		tmp = t_1;
	elseif (t <= 9e+68)
		tmp = x * log(y);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Log[y], $MachinePrecision] - t), $MachinePrecision]}, If[LessEqual[t, -1.36e+63], t$95$1, If[LessEqual[t, 9e+68], N[(x * N[Log[y], $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -1.36000000000000006e63 or 9.0000000000000007e68 < t

   1. Initial program 98.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 78.2%

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

   if -1.36000000000000006e63 < t < 9.0000000000000007e68

   1. Initial program 75.5%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 73.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 57.5%

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

Alternative 5: 84.0% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.6%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 83.1%

   \[\leadsto \color{blue}{x \cdot \log y} - t \]
6. Add Preprocessing

Alternative 6: 35.5% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.6%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 35.6%

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

Alternative 7: 3.3% accurate, 55.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.6%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 83.1%

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

6. Taylor expanded in y around 0

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

8. Applied rewrites 3.1%

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

Developer Target 1: 99.6% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024321 
(FPCore (x y z t)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, B"
  :precision binary64
  :pre (TRUE)

  :alt
  (! :herbie-platform default (- (* (- z) (+ (+ (* 1/2 (* y y)) y) (* (/ 1/3 (* 1 (* 1 1))) (* y (* y y))))) (- t (* x (log y)))))

  (- (+ (* x (log y)) (* z (log (- 1.0 y)))) t))