Numeric.SpecFunctions:incompleteBetaWorker from math-functions-0.1.5.2, A

Percentage Accurate: 98.3% → 98.3%

Time: 34.2s

Alternatives: 5

Speedup: 1.0×

• 21.5% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (/ (* x (exp (- (+ (* y (log z)) (* (- t 1.0) (log a))) b))) y))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (/ (* x (exp (- (+ (* y (log z)) (* (- t 1.0) (log a))) b))) y))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (/ (* x (exp (- (+ (* y (log z)) (* (- t 1.0) (log a))) b))) y))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.8%

   \[\frac{x \cdot e^{\left(y \cdot \log z + \left(t - 1\right) \cdot \log a\right) - b}}{y} \]

Alternative 2: 98.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (/ x (/ y (exp (- (fma y (log z) (* (+ t -1.0) (log a))) b)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return x / (y / exp((fma(y, log(z), ((t + -1.0) * log(a))) - b)));
}

Julia

function code(x, y, z, t, a, b)
	return Float64(x / Float64(y / exp(Float64(fma(y, log(z), Float64(Float64(t + -1.0) * log(a))) - b))))
end

Wolfram

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

Derivation

1. Initial program 97.5%

   \[\frac{x}{\frac{y}{e^{\mathsf{fma}\left(y, \log z, \left(t + -1\right) \cdot \log a\right) - b}}} \]

Alternative 3: 87.6% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (* (/ x y) (exp (fma y (log z) (fma (+ t -1.0) (log a) (- b))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (x / y) * exp(fma(y, log(z), fma((t + -1.0), log(a), -b)));
}

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(x / y) * exp(fma(y, log(z), fma(Float64(t + -1.0), log(a), Float64(-b)))))
end

Wolfram

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

Derivation

1. Initial program 89.2%

   \[\frac{x}{y} \cdot e^{\mathsf{fma}\left(y, \log z, \mathsf{fma}\left(t + -1, \log a, -b\right)\right)} \]

Alternative 4: 63.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{{z}^{y} \cdot {a}^{\left(t + -1\right)}}{\frac{y}{x} \cdot e^{b}} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (/ (* (pow z y) (pow a (+ t -1.0))) (* (/ y x) (exp b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (pow(z, y) * pow(a, (t + -1.0))) / ((y / x) * exp(b));
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return (Math.pow(z, y) * Math.pow(a, (t + -1.0))) / ((y / x) * Math.exp(b));
}

Python

def code(x, y, z, t, a, b):
	return (math.pow(z, y) * math.pow(a, (t + -1.0))) / ((y / x) * math.exp(b))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64((z ^ y) * (a ^ Float64(t + -1.0))) / Float64(Float64(y / x) * exp(b)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((z ^ y) * (a ^ (t + -1.0))) / ((y / x) * exp(b));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[Power[z, y], $MachinePrecision] * N[Power[a, N[(t + -1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(N[(y / x), $MachinePrecision] * N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 66.6%

   \[\frac{{z}^{y} \cdot {a}^{\left(t + -1\right)}}{\frac{y}{x} \cdot e^{b}} \]

Alternative 5: 63.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left({a}^{\left(t + -1\right)} \cdot \frac{{z}^{y}}{e^{b}}\right) \cdot \frac{x}{y} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (* (* (pow a (+ t -1.0)) (/ (pow z y) (exp b))) (/ x y)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (pow(a, (t + -1.0)) * (pow(z, y) / exp(b))) * (x / y);
}

Fortran

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return (Math.pow(a, (t + -1.0)) * (Math.pow(z, y) / Math.exp(b))) * (x / y);
}

Python

def code(x, y, z, t, a, b):
	return (math.pow(a, (t + -1.0)) * (math.pow(z, y) / math.exp(b))) * (x / y)

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64((a ^ Float64(t + -1.0)) * Float64((z ^ y) / exp(b))) * Float64(x / y))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((a ^ (t + -1.0)) * ((z ^ y) / exp(b))) * (x / y);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[Power[a, N[(t + -1.0), $MachinePrecision]], $MachinePrecision] * N[(N[Power[z, y], $MachinePrecision] / N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 67.1%

   \[\left({a}^{\left(t + -1\right)} \cdot \frac{{z}^{y}}{e^{b}}\right) \cdot \frac{x}{y} \]

Developer target: 71.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := {a}^{\left(t - 1\right)}\\ t_2 := \frac{x \cdot \frac{t_1}{y}}{\left(b + 1\right) - y \cdot \log z}\\ \mathbf{if}\;t < -0.8845848504127471:\\ \;\;\;\;t_2\\ \mathbf{elif}\;t < 852031.2288374073:\\ \;\;\;\;\frac{\frac{x}{y} \cdot t_1}{e^{b - \log z \cdot y}}\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (pow a (- t 1.0)))
        (t_2 (/ (* x (/ t_1 y)) (- (+ b 1.0) (* y (log z))))))
   (if (< t -0.8845848504127471)
     t_2
     (if (< t 852031.2288374073)
       (/ (* (/ x y) t_1) (exp (- b (* (log z) y))))
       t_2))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = pow(a, (t - 1.0));
	double t_2 = (x * (t_1 / y)) / ((b + 1.0) - (y * log(z)));
	double tmp;
	if (t < -0.8845848504127471) {
		tmp = t_2;
	} else if (t < 852031.2288374073) {
		tmp = ((x / y) * t_1) / exp((b - (log(z) * y)));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = a ** (t - 1.0d0)
    t_2 = (x * (t_1 / y)) / ((b + 1.0d0) - (y * log(z)))
    if (t < (-0.8845848504127471d0)) then
        tmp = t_2
    else if (t < 852031.2288374073d0) then
        tmp = ((x / y) * t_1) / exp((b - (log(z) * y)))
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = Math.pow(a, (t - 1.0));
	double t_2 = (x * (t_1 / y)) / ((b + 1.0) - (y * Math.log(z)));
	double tmp;
	if (t < -0.8845848504127471) {
		tmp = t_2;
	} else if (t < 852031.2288374073) {
		tmp = ((x / y) * t_1) / Math.exp((b - (Math.log(z) * y)));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = math.pow(a, (t - 1.0))
	t_2 = (x * (t_1 / y)) / ((b + 1.0) - (y * math.log(z)))
	tmp = 0
	if t < -0.8845848504127471:
		tmp = t_2
	elif t < 852031.2288374073:
		tmp = ((x / y) * t_1) / math.exp((b - (math.log(z) * y)))
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = a ^ Float64(t - 1.0)
	t_2 = Float64(Float64(x * Float64(t_1 / y)) / Float64(Float64(b + 1.0) - Float64(y * log(z))))
	tmp = 0.0
	if (t < -0.8845848504127471)
		tmp = t_2;
	elseif (t < 852031.2288374073)
		tmp = Float64(Float64(Float64(x / y) * t_1) / exp(Float64(b - Float64(log(z) * y))));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = a ^ (t - 1.0);
	t_2 = (x * (t_1 / y)) / ((b + 1.0) - (y * log(z)));
	tmp = 0.0;
	if (t < -0.8845848504127471)
		tmp = t_2;
	elseif (t < 852031.2288374073)
		tmp = ((x / y) * t_1) / exp((b - (log(z) * y)));
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[Power[a, N[(t - 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * N[(t$95$1 / y), $MachinePrecision]), $MachinePrecision] / N[(N[(b + 1.0), $MachinePrecision] - N[(y * N[Log[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t, -0.8845848504127471], t$95$2, If[Less[t, 852031.2288374073], N[(N[(N[(x / y), $MachinePrecision] * t$95$1), $MachinePrecision] / N[Exp[N[(b - N[(N[Log[z], $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Reproduce

herbie shell --seed 2023276 
(FPCore (x y z t a b)
  :name "Numeric.SpecFunctions:incompleteBetaWorker from math-functions-0.1.5.2, A"
  :precision binary64

  :herbie-target
  (if (< t -0.8845848504127471) (/ (* x (/ (pow a (- t 1.0)) y)) (- (+ b 1.0) (* y (log z)))) (if (< t 852031.2288374073) (/ (* (/ x y) (pow a (- t 1.0))) (exp (- b (* (log z) y)))) (/ (* x (/ (pow a (- t 1.0)) y)) (- (+ b 1.0) (* y (log z))))))

  (/ (* x (exp (- (+ (* y (log z)) (* (- t 1.0) (log a))) b))) y))