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

Percentage Accurate: 78.0% → 99.8%

Time: 12.8s

Alternatives: 7

Speedup: 20.9×

Specification

Math

\[\begin{array}{l} \\ \frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (exp (* x (log (/ x (+ x y))))) x))

C

double code(double x, double y) {
	return exp((x * log((x / (x + y))))) / x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = exp((x * log((x / (x + y))))) / x
end function

Java

public static double code(double x, double y) {
	return Math.exp((x * Math.log((x / (x + y))))) / x;
}

Python

def code(x, y):
	return math.exp((x * math.log((x / (x + y))))) / x

Julia

function code(x, y)
	return Float64(exp(Float64(x * log(Float64(x / Float64(x + y))))) / x)
end

MATLAB

function tmp = code(x, y)
	tmp = exp((x * log((x / (x + y))))) / x;
end

Wolfram

code[x_, y_] := N[(N[Exp[N[(x * N[Log[N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / x), $MachinePrecision]

Initial Program: 78.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (exp (* x (log (/ x (+ x y))))) x))

C

double code(double x, double y) {
	return exp((x * log((x / (x + y))))) / x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = exp((x * log((x / (x + y))))) / x
end function

Java

public static double code(double x, double y) {
	return Math.exp((x * Math.log((x / (x + y))))) / x;
}

Python

def code(x, y):
	return math.exp((x * math.log((x / (x + y))))) / x

Julia

function code(x, y)
	return Float64(exp(Float64(x * log(Float64(x / Float64(x + y))))) / x)
end

MATLAB

function tmp = code(x, y)
	tmp = exp((x * log((x / (x + y))))) / x;
end

Wolfram

code[x_, y_] := N[(N[Exp[N[(x * N[Log[N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / x), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -400000000000 \lor \neg \left(x \leq 20\right):\\ \;\;\;\;\frac{e^{-y}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -400000000000.0) (not (<= x 20.0)))
   (/ (exp (- y)) x)
   (/ (pow (exp x) (log (/ x (+ x y)))) x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -400000000000.0) || !(x <= 20.0)) {
		tmp = exp(-y) / x;
	} else {
		tmp = pow(exp(x), log((x / (x + y)))) / x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-400000000000.0d0)) .or. (.not. (x <= 20.0d0))) then
        tmp = exp(-y) / x
    else
        tmp = (exp(x) ** log((x / (x + y)))) / x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -400000000000.0) || !(x <= 20.0)) {
		tmp = Math.exp(-y) / x;
	} else {
		tmp = Math.pow(Math.exp(x), Math.log((x / (x + y)))) / x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -400000000000.0) or not (x <= 20.0):
		tmp = math.exp(-y) / x
	else:
		tmp = math.pow(math.exp(x), math.log((x / (x + y)))) / x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -400000000000.0) || !(x <= 20.0))
		tmp = Float64(exp(Float64(-y)) / x);
	else
		tmp = Float64((exp(x) ^ log(Float64(x / Float64(x + y)))) / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -400000000000.0) || ~((x <= 20.0)))
		tmp = exp(-y) / x;
	else
		tmp = (exp(x) ^ log((x / (x + y)))) / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -400000000000.0], N[Not[LessEqual[x, 20.0]], $MachinePrecision]], N[(N[Exp[(-y)], $MachinePrecision] / x), $MachinePrecision], N[(N[Power[N[Exp[x], $MachinePrecision], N[Log[N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4e11 or 20 < x

   1. Initial program 75.4%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. *-commutative 75.4%

         \[\leadsto \frac{e^{\color{blue}{\log \left(\frac{x}{x + y}\right) \cdot x}}}{x} \]

      2. exp-to-pow 75.4%

         \[\leadsto \frac{\color{blue}{{\left(\frac{x}{x + y}\right)}^{x}}}{x} \]

   3. Simplified 75.4%

      \[\leadsto \color{blue}{\frac{{\left(\frac{x}{x + y}\right)}^{x}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 100.0%

      \[\leadsto \frac{\color{blue}{e^{-1 \cdot y}}}{x} \]
   6. Step-by-step derivation

      1. mul-1-neg 100.0%

         \[\leadsto \frac{e^{\color{blue}{-y}}}{x} \]

   7. Simplified 100.0%

      \[\leadsto \frac{\color{blue}{e^{-y}}}{x} \]

   if -4e11 < x < 20

   1. Initial program 81.6%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 99.7%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -400000000000 \lor \neg \left(x \leq 20\right):\\ \;\;\;\;\frac{e^{-y}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1000000000 \lor \neg \left(x \leq 0.58\right):\\ \;\;\;\;\frac{e^{-y}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1000000000.0) (not (<= x 0.58))) (/ (exp (- y)) x) (/ 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1000000000.0) || !(x <= 0.58)) {
		tmp = exp(-y) / x;
	} else {
		tmp = 1.0 / x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-1000000000.0d0)) .or. (.not. (x <= 0.58d0))) then
        tmp = exp(-y) / x
    else
        tmp = 1.0d0 / x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -1000000000.0) || !(x <= 0.58)) {
		tmp = Math.exp(-y) / x;
	} else {
		tmp = 1.0 / x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1000000000.0) or not (x <= 0.58):
		tmp = math.exp(-y) / x
	else:
		tmp = 1.0 / x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1000000000.0) || !(x <= 0.58))
		tmp = Float64(exp(Float64(-y)) / x);
	else
		tmp = Float64(1.0 / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1000000000.0) || ~((x <= 0.58)))
		tmp = exp(-y) / x;
	else
		tmp = 1.0 / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1000000000.0], N[Not[LessEqual[x, 0.58]], $MachinePrecision]], N[(N[Exp[(-y)], $MachinePrecision] / x), $MachinePrecision], N[(1.0 / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1e9 or 0.57999999999999996 < x

   1. Initial program 75.4%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. *-commutative 75.4%

         \[\leadsto \frac{e^{\color{blue}{\log \left(\frac{x}{x + y}\right) \cdot x}}}{x} \]

      2. exp-to-pow 75.4%

         \[\leadsto \frac{\color{blue}{{\left(\frac{x}{x + y}\right)}^{x}}}{x} \]

   3. Simplified 75.4%

      \[\leadsto \color{blue}{\frac{{\left(\frac{x}{x + y}\right)}^{x}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 100.0%

      \[\leadsto \frac{\color{blue}{e^{-1 \cdot y}}}{x} \]
   6. Step-by-step derivation

      1. mul-1-neg 100.0%

         \[\leadsto \frac{e^{\color{blue}{-y}}}{x} \]

   7. Simplified 100.0%

      \[\leadsto \frac{\color{blue}{e^{-y}}}{x} \]

   if -1e9 < x < 0.57999999999999996

   1. Initial program 81.6%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 99.7%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 98.8%

      \[\leadsto \frac{\color{blue}{1}}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1000000000 \lor \neg \left(x \leq 0.58\right):\\ \;\;\;\;\frac{e^{-y}}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 84.4% accurate, 9.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1000000000:\\ \;\;\;\;\frac{1}{x} + \frac{y \cdot \left(y \cdot \left(0.5 + y \cdot -0.16666666666666666\right) + -1\right)}{x}\\ \mathbf{elif}\;x \leq 1000000000000:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{1 - y}{x \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1000000000.0)
   (+ (/ 1.0 x) (/ (* y (+ (* y (+ 0.5 (* y -0.16666666666666666))) -1.0)) x))
   (if (<= x 1000000000000.0) (/ 1.0 x) (* y (/ (- 1.0 y) (* x y))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1000000000.0) {
		tmp = (1.0 / x) + ((y * ((y * (0.5 + (y * -0.16666666666666666))) + -1.0)) / x);
	} else if (x <= 1000000000000.0) {
		tmp = 1.0 / x;
	} else {
		tmp = y * ((1.0 - y) / (x * y));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-1000000000.0d0)) then
        tmp = (1.0d0 / x) + ((y * ((y * (0.5d0 + (y * (-0.16666666666666666d0)))) + (-1.0d0))) / x)
    else if (x <= 1000000000000.0d0) then
        tmp = 1.0d0 / x
    else
        tmp = y * ((1.0d0 - y) / (x * y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1000000000.0) {
		tmp = (1.0 / x) + ((y * ((y * (0.5 + (y * -0.16666666666666666))) + -1.0)) / x);
	} else if (x <= 1000000000000.0) {
		tmp = 1.0 / x;
	} else {
		tmp = y * ((1.0 - y) / (x * y));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1000000000.0:
		tmp = (1.0 / x) + ((y * ((y * (0.5 + (y * -0.16666666666666666))) + -1.0)) / x)
	elif x <= 1000000000000.0:
		tmp = 1.0 / x
	else:
		tmp = y * ((1.0 - y) / (x * y))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1000000000.0)
		tmp = Float64(Float64(1.0 / x) + Float64(Float64(y * Float64(Float64(y * Float64(0.5 + Float64(y * -0.16666666666666666))) + -1.0)) / x));
	elseif (x <= 1000000000000.0)
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(y * Float64(Float64(1.0 - y) / Float64(x * y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1000000000.0)
		tmp = (1.0 / x) + ((y * ((y * (0.5 + (y * -0.16666666666666666))) + -1.0)) / x);
	elseif (x <= 1000000000000.0)
		tmp = 1.0 / x;
	else
		tmp = y * ((1.0 - y) / (x * y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1000000000.0], N[(N[(1.0 / x), $MachinePrecision] + N[(N[(y * N[(N[(y * N[(0.5 + N[(y * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1000000000000.0], N[(1.0 / x), $MachinePrecision], N[(y * N[(N[(1.0 - y), $MachinePrecision] / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1e9

   1. Initial program 73.5%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. *-commutative 73.5%

         \[\leadsto \frac{e^{\color{blue}{\log \left(\frac{x}{x + y}\right) \cdot x}}}{x} \]

      2. exp-to-pow 73.5%

         \[\leadsto \frac{\color{blue}{{\left(\frac{x}{x + y}\right)}^{x}}}{x} \]

   3. Simplified 73.5%

      \[\leadsto \color{blue}{\frac{{\left(\frac{x}{x + y}\right)}^{x}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 100.0%

      \[\leadsto \frac{\color{blue}{e^{-1 \cdot y}}}{x} \]
   6. Step-by-step derivation

      1. mul-1-neg 100.0%

         \[\leadsto \frac{e^{\color{blue}{-y}}}{x} \]

   7. Simplified 100.0%

      \[\leadsto \frac{\color{blue}{e^{-y}}}{x} \]

   8. Taylor expanded in y around 0 74.7%

      \[\leadsto \color{blue}{y \cdot \left(y \cdot \left(-0.16666666666666666 \cdot \frac{y}{x} + 0.5 \cdot \frac{1}{x}\right) - \frac{1}{x}\right) + \frac{1}{x}} \]

   9. Taylor expanded in x around 0 76.2%

      \[\leadsto \color{blue}{\frac{y \cdot \left(y \cdot \left(0.5 + -0.16666666666666666 \cdot y\right) - 1\right)}{x}} + \frac{1}{x} \]

   if -1e9 < x < 1e12

   1. Initial program 81.6%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 99.7%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 98.8%

      \[\leadsto \frac{\color{blue}{1}}{x} \]

   if 1e12 < x

   1. Initial program 77.1%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 77.1%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 77.1%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 56.2%

      \[\leadsto \color{blue}{-1 \cdot \frac{y}{x} + \frac{1}{x}} \]
   6. Step-by-step derivation

      1. +-commutative 56.2%

         \[\leadsto \color{blue}{\frac{1}{x} + -1 \cdot \frac{y}{x}} \]

      2. mul-1-neg 56.2%

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

      3. unsub-neg 56.2%

         \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]

   7. Simplified 56.2%

      \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]

   8. Taylor expanded in y around inf 55.9%

      \[\leadsto \color{blue}{y \cdot \left(\frac{1}{x \cdot y} - \frac{1}{x}\right)} \]
   9. Step-by-step derivation

      1. frac-sub 51.7%

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

      2. *-commutative 51.7%

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

      3. *-un-lft-identity 51.7%

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

      4. *-rgt-identity 51.7%

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

      5. *-commutative 51.7%

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

   10. Applied egg-rr 51.7%

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

   11. Taylor expanded in x around 0 70.5%

       \[\leadsto y \cdot \color{blue}{\frac{1 - y}{x \cdot y}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 85.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1000000000:\\ \;\;\;\;\frac{1}{x} + \frac{y \cdot \left(y \cdot \left(0.5 + y \cdot -0.16666666666666666\right) + -1\right)}{x}\\ \mathbf{elif}\;x \leq 1000000000000:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{1 - y}{x \cdot y}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 83.0% accurate, 11.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1000000000:\\ \;\;\;\;\frac{1 + y \cdot \left(y \cdot 0.5 + -1\right)}{x}\\ \mathbf{elif}\;x \leq 12:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{1 - y}{x \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1000000000.0)
   (/ (+ 1.0 (* y (+ (* y 0.5) -1.0))) x)
   (if (<= x 12.0) (/ 1.0 x) (* y (/ (- 1.0 y) (* x y))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1000000000.0) {
		tmp = (1.0 + (y * ((y * 0.5) + -1.0))) / x;
	} else if (x <= 12.0) {
		tmp = 1.0 / x;
	} else {
		tmp = y * ((1.0 - y) / (x * y));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-1000000000.0d0)) then
        tmp = (1.0d0 + (y * ((y * 0.5d0) + (-1.0d0)))) / x
    else if (x <= 12.0d0) then
        tmp = 1.0d0 / x
    else
        tmp = y * ((1.0d0 - y) / (x * y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1000000000.0) {
		tmp = (1.0 + (y * ((y * 0.5) + -1.0))) / x;
	} else if (x <= 12.0) {
		tmp = 1.0 / x;
	} else {
		tmp = y * ((1.0 - y) / (x * y));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1000000000.0:
		tmp = (1.0 + (y * ((y * 0.5) + -1.0))) / x
	elif x <= 12.0:
		tmp = 1.0 / x
	else:
		tmp = y * ((1.0 - y) / (x * y))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1000000000.0)
		tmp = Float64(Float64(1.0 + Float64(y * Float64(Float64(y * 0.5) + -1.0))) / x);
	elseif (x <= 12.0)
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(y * Float64(Float64(1.0 - y) / Float64(x * y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1000000000.0)
		tmp = (1.0 + (y * ((y * 0.5) + -1.0))) / x;
	elseif (x <= 12.0)
		tmp = 1.0 / x;
	else
		tmp = y * ((1.0 - y) / (x * y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1000000000.0], N[(N[(1.0 + N[(y * N[(N[(y * 0.5), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[x, 12.0], N[(1.0 / x), $MachinePrecision], N[(y * N[(N[(1.0 - y), $MachinePrecision] / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1e9

   1. Initial program 73.5%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 73.5%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 73.5%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 74.6%

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

   6. Taylor expanded in x around inf 74.6%

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

      1. *-commutative 74.6%

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

   8. Simplified 74.6%

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

   if -1e9 < x < 12

   1. Initial program 81.6%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 99.7%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 98.8%

      \[\leadsto \frac{\color{blue}{1}}{x} \]

   if 12 < x

   1. Initial program 77.1%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 77.1%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 77.1%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 56.2%

      \[\leadsto \color{blue}{-1 \cdot \frac{y}{x} + \frac{1}{x}} \]
   6. Step-by-step derivation

      1. +-commutative 56.2%

         \[\leadsto \color{blue}{\frac{1}{x} + -1 \cdot \frac{y}{x}} \]

      2. mul-1-neg 56.2%

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

      3. unsub-neg 56.2%

         \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]

   7. Simplified 56.2%

      \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]

   8. Taylor expanded in y around inf 55.9%

      \[\leadsto \color{blue}{y \cdot \left(\frac{1}{x \cdot y} - \frac{1}{x}\right)} \]
   9. Step-by-step derivation

      1. frac-sub 51.7%

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

      2. *-commutative 51.7%

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

      3. *-un-lft-identity 51.7%

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

      4. *-rgt-identity 51.7%

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

      5. *-commutative 51.7%

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

   10. Applied egg-rr 51.7%

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

   11. Taylor expanded in x around 0 70.5%

       \[\leadsto y \cdot \color{blue}{\frac{1 - y}{x \cdot y}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 84.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1000000000:\\ \;\;\;\;\frac{1 + y \cdot \left(y \cdot 0.5 + -1\right)}{x}\\ \mathbf{elif}\;x \leq 12:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{1 - y}{x \cdot y}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 80.4% accurate, 13.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.42 \cdot 10^{+256}:\\ \;\;\;\;\frac{\frac{x - x \cdot y}{x}}{x}\\ \mathbf{elif}\;y \leq 5 \cdot 10^{+35}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{x \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.42e+256)
   (/ (/ (- x (* x y)) x) x)
   (if (<= y 5e+35) (/ 1.0 x) (/ y (* x y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.42e+256) {
		tmp = ((x - (x * y)) / x) / x;
	} else if (y <= 5e+35) {
		tmp = 1.0 / x;
	} else {
		tmp = y / (x * y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-1.42d+256)) then
        tmp = ((x - (x * y)) / x) / x
    else if (y <= 5d+35) then
        tmp = 1.0d0 / x
    else
        tmp = y / (x * y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.42e+256) {
		tmp = ((x - (x * y)) / x) / x;
	} else if (y <= 5e+35) {
		tmp = 1.0 / x;
	} else {
		tmp = y / (x * y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.42e+256:
		tmp = ((x - (x * y)) / x) / x
	elif y <= 5e+35:
		tmp = 1.0 / x
	else:
		tmp = y / (x * y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.42e+256)
		tmp = Float64(Float64(Float64(x - Float64(x * y)) / x) / x);
	elseif (y <= 5e+35)
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(y / Float64(x * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.42e+256)
		tmp = ((x - (x * y)) / x) / x;
	elseif (y <= 5e+35)
		tmp = 1.0 / x;
	else
		tmp = y / (x * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.42e+256], N[(N[(N[(x - N[(x * y), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 5e+35], N[(1.0 / x), $MachinePrecision], N[(y / N[(x * y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.42e256

   1. Initial program 86.4%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 100.0%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 4.7%

      \[\leadsto \color{blue}{-1 \cdot \frac{y}{x} + \frac{1}{x}} \]
   6. Step-by-step derivation

      1. +-commutative 4.7%

         \[\leadsto \color{blue}{\frac{1}{x} + -1 \cdot \frac{y}{x}} \]

      2. mul-1-neg 4.7%

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

      3. unsub-neg 4.7%

         \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]

   7. Simplified 4.7%

      \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]
   8. Step-by-step derivation

      1. frac-sub 29.3%

         \[\leadsto \color{blue}{\frac{1 \cdot x - x \cdot y}{x \cdot x}} \]

      2. associate-/r* 86.4%

         \[\leadsto \color{blue}{\frac{\frac{1 \cdot x - x \cdot y}{x}}{x}} \]

      3. *-un-lft-identity 86.4%

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

      4. *-commutative 86.4%

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

   9. Applied egg-rr 86.4%

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

   if -1.42e256 < y < 5.00000000000000021e35

   1. Initial program 83.7%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 88.9%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 88.9%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 85.7%

      \[\leadsto \frac{\color{blue}{1}}{x} \]

   if 5.00000000000000021e35 < y

   1. Initial program 58.6%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 77.6%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 77.6%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 1.9%

      \[\leadsto \color{blue}{-1 \cdot \frac{y}{x} + \frac{1}{x}} \]
   6. Step-by-step derivation

      1. +-commutative 1.9%

         \[\leadsto \color{blue}{\frac{1}{x} + -1 \cdot \frac{y}{x}} \]

      2. mul-1-neg 1.9%

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

      3. unsub-neg 1.9%

         \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]

   7. Simplified 1.9%

      \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]

   8. Taylor expanded in y around inf 1.9%

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

   9. Taylor expanded in y around 0 80.6%

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

       1. *-commutative 80.6%

          \[\leadsto y \cdot \frac{1}{\color{blue}{y \cdot x}} \]

   11. Simplified 80.6%

       \[\leadsto y \cdot \color{blue}{\frac{1}{y \cdot x}} \]
   12. Step-by-step derivation

       1. un-div-inv 80.7%

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

   13. Applied egg-rr 80.7%

       \[\leadsto \color{blue}{\frac{y}{y \cdot x}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 84.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.42 \cdot 10^{+256}:\\ \;\;\;\;\frac{\frac{x - x \cdot y}{x}}{x}\\ \mathbf{elif}\;y \leq 5 \cdot 10^{+35}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{x \cdot y}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 80.4% accurate, 20.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1.5 \cdot 10^{+34}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{x \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 1.5e+34) (/ 1.0 x) (/ y (* x y))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 1.5e+34) {
		tmp = 1.0 / x;
	} else {
		tmp = y / (x * y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 1.5d+34) then
        tmp = 1.0d0 / x
    else
        tmp = y / (x * y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 1.5e+34) {
		tmp = 1.0 / x;
	} else {
		tmp = y / (x * y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 1.5e+34:
		tmp = 1.0 / x
	else:
		tmp = y / (x * y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 1.5e+34)
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(y / Float64(x * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1.5e+34)
		tmp = 1.0 / x;
	else
		tmp = y / (x * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 1.5e+34], N[(1.0 / x), $MachinePrecision], N[(y / N[(x * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.50000000000000009e34

   1. Initial program 83.8%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 89.3%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 89.3%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 83.2%

      \[\leadsto \frac{\color{blue}{1}}{x} \]

   if 1.50000000000000009e34 < y

   1. Initial program 58.6%

      \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
   2. Step-by-step derivation

      1. exp-prod 77.6%

         \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

   3. Simplified 77.6%

      \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 1.9%

      \[\leadsto \color{blue}{-1 \cdot \frac{y}{x} + \frac{1}{x}} \]
   6. Step-by-step derivation

      1. +-commutative 1.9%

         \[\leadsto \color{blue}{\frac{1}{x} + -1 \cdot \frac{y}{x}} \]

      2. mul-1-neg 1.9%

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

      3. unsub-neg 1.9%

         \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]

   7. Simplified 1.9%

      \[\leadsto \color{blue}{\frac{1}{x} - \frac{y}{x}} \]

   8. Taylor expanded in y around inf 1.9%

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

   9. Taylor expanded in y around 0 80.6%

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

       1. *-commutative 80.6%

          \[\leadsto y \cdot \frac{1}{\color{blue}{y \cdot x}} \]

   11. Simplified 80.6%

       \[\leadsto y \cdot \color{blue}{\frac{1}{y \cdot x}} \]
   12. Step-by-step derivation

       1. un-div-inv 80.7%

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

   13. Applied egg-rr 80.7%

       \[\leadsto \color{blue}{\frac{y}{y \cdot x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1.5 \cdot 10^{+34}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{x \cdot y}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 74.7% accurate, 69.7× speedup

Math

\[\begin{array}{l} \\ \frac{1}{x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ 1.0 x))

C

double code(double x, double y) {
	return 1.0 / x;
}

Fortran

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

Java

public static double code(double x, double y) {
	return 1.0 / x;
}

Python

def code(x, y):
	return 1.0 / x

Julia

function code(x, y)
	return Float64(1.0 / x)
end

MATLAB

function tmp = code(x, y)
	tmp = 1.0 / x;
end

Wolfram

code[x_, y_] := N[(1.0 / x), $MachinePrecision]

Derivation

1. Initial program 78.3%

   \[\frac{e^{x \cdot \log \left(\frac{x}{x + y}\right)}}{x} \]
2. Step-by-step derivation

   1. exp-prod 86.8%

      \[\leadsto \frac{\color{blue}{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}}{x} \]

3. Simplified 86.8%

   \[\leadsto \color{blue}{\frac{{\left(e^{x}\right)}^{\log \left(\frac{x}{x + y}\right)}}{x}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 76.9%

   \[\leadsto \frac{\color{blue}{1}}{x} \]

6. Final simplification 76.9%

   \[\leadsto \frac{1}{x} \]
7. Add Preprocessing

Developer target: 77.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{e^{\frac{-1}{y}}}{x}\\ t_1 := \frac{{\left(\frac{x}{y + x}\right)}^{x}}{x}\\ \mathbf{if}\;y < -3.7311844206647956 \cdot 10^{+94}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y < 2.817959242728288 \cdot 10^{+37}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y < 2.347387415166998 \cdot 10^{+178}:\\ \;\;\;\;\log \left(e^{t\_1}\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (exp (/ -1.0 y)) x)) (t_1 (/ (pow (/ x (+ y x)) x) x)))
   (if (< y -3.7311844206647956e+94)
     t_0
     (if (< y 2.817959242728288e+37)
       t_1
       (if (< y 2.347387415166998e+178) (log (exp t_1)) t_0)))))

C

double code(double x, double y) {
	double t_0 = exp((-1.0 / y)) / x;
	double t_1 = pow((x / (y + x)), x) / x;
	double tmp;
	if (y < -3.7311844206647956e+94) {
		tmp = t_0;
	} else if (y < 2.817959242728288e+37) {
		tmp = t_1;
	} else if (y < 2.347387415166998e+178) {
		tmp = log(exp(t_1));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = exp(((-1.0d0) / y)) / x
    t_1 = ((x / (y + x)) ** x) / x
    if (y < (-3.7311844206647956d+94)) then
        tmp = t_0
    else if (y < 2.817959242728288d+37) then
        tmp = t_1
    else if (y < 2.347387415166998d+178) then
        tmp = log(exp(t_1))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = Math.exp((-1.0 / y)) / x;
	double t_1 = Math.pow((x / (y + x)), x) / x;
	double tmp;
	if (y < -3.7311844206647956e+94) {
		tmp = t_0;
	} else if (y < 2.817959242728288e+37) {
		tmp = t_1;
	} else if (y < 2.347387415166998e+178) {
		tmp = Math.log(Math.exp(t_1));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = math.exp((-1.0 / y)) / x
	t_1 = math.pow((x / (y + x)), x) / x
	tmp = 0
	if y < -3.7311844206647956e+94:
		tmp = t_0
	elif y < 2.817959242728288e+37:
		tmp = t_1
	elif y < 2.347387415166998e+178:
		tmp = math.log(math.exp(t_1))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(exp(Float64(-1.0 / y)) / x)
	t_1 = Float64((Float64(x / Float64(y + x)) ^ x) / x)
	tmp = 0.0
	if (y < -3.7311844206647956e+94)
		tmp = t_0;
	elseif (y < 2.817959242728288e+37)
		tmp = t_1;
	elseif (y < 2.347387415166998e+178)
		tmp = log(exp(t_1));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = exp((-1.0 / y)) / x;
	t_1 = ((x / (y + x)) ^ x) / x;
	tmp = 0.0;
	if (y < -3.7311844206647956e+94)
		tmp = t_0;
	elseif (y < 2.817959242728288e+37)
		tmp = t_1;
	elseif (y < 2.347387415166998e+178)
		tmp = log(exp(t_1));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[Exp[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision] / x), $MachinePrecision]}, Block[{t$95$1 = N[(N[Power[N[(x / N[(y + x), $MachinePrecision]), $MachinePrecision], x], $MachinePrecision] / x), $MachinePrecision]}, If[Less[y, -3.7311844206647956e+94], t$95$0, If[Less[y, 2.817959242728288e+37], t$95$1, If[Less[y, 2.347387415166998e+178], N[Log[N[Exp[t$95$1], $MachinePrecision]], $MachinePrecision], t$95$0]]]]]

Reproduce

herbie shell --seed 2024066 
(FPCore (x y)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, F"
  :precision binary64

  :alt
  (if (< y -3.7311844206647956e+94) (/ (exp (/ -1.0 y)) x) (if (< y 2.817959242728288e+37) (/ (pow (/ x (+ y x)) x) x) (if (< y 2.347387415166998e+178) (log (exp (/ (pow (/ x (+ y x)) x) x))) (/ (exp (/ -1.0 y)) x))))

  (/ (exp (* x (log (/ x (+ x y))))) x))