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

Percentage Accurate: 77.9% → 99.9%

Time: 11.9s

Alternatives: 6

Speedup: 11.6×

• Could not converge on a ground truth

  1. x = 2.1744226673625363e+163
  2. y = 3.2209082984892355e-240

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: 77.9% 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.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4000 \lor \neg \left(x \leq 4.3\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 -4000.0) (not (<= x 4.3)))
   (/ (exp (- y)) x)
   (/ (pow (exp x) (log (/ x (+ x y)))) x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -4000.0) || !(x <= 4.3)) {
		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 <= (-4000.0d0)) .or. (.not. (x <= 4.3d0))) 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 <= -4000.0) || !(x <= 4.3)) {
		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 <= -4000.0) or not (x <= 4.3):
		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 <= -4000.0) || !(x <= 4.3))
		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 <= -4000.0) || ~((x <= 4.3)))
		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, -4000.0], N[Not[LessEqual[x, 4.3]], $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 < -4e3 or 4.29999999999999982 < x

   1. Initial program 77.8%

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

      1. *-commutative 77.8%

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

      2. exp-to-pow 77.8%

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

   3. Simplified 77.8%

      \[\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 \color{blue}{\frac{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 \color{blue}{\frac{e^{-y}}{x}} \]

   if -4e3 < x < 4.29999999999999982

   1. Initial program 79.1%

      \[\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
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4000 \lor \neg \left(x \leq 4.3\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.5% accurate, 1.8× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((x <= -11.0) || !(x <= 1.0)) {
		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 <= (-11.0d0)) .or. (.not. (x <= 1.0d0))) 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 <= -11.0) || !(x <= 1.0)) {
		tmp = Math.exp(-y) / x;
	} else {
		tmp = 1.0 / x;
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -11.0) || !(x <= 1.0))
		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 <= -11.0) || ~((x <= 1.0)))
		tmp = exp(-y) / x;
	else
		tmp = 1.0 / x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -11 or 1 < x

   1. Initial program 77.8%

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

      1. *-commutative 77.8%

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

      2. exp-to-pow 77.8%

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

   3. Simplified 77.8%

      \[\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 \color{blue}{\frac{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 \color{blue}{\frac{e^{-y}}{x}} \]

   if -11 < x < 1

   1. Initial program 79.1%

      \[\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 x around 0 99.4%

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

4. Final simplification 99.8%

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

Alternative 3: 79.3% accurate, 11.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.5 \cdot 10^{+105}:\\ \;\;\;\;\frac{1 + y \cdot \left(y \cdot \left(y \cdot -0.16666666666666666\right) + -1\right)}{x}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{+51}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x \cdot x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -3.5e+105)
   (/ (+ 1.0 (* y (+ (* y (* y -0.16666666666666666)) -1.0))) x)
   (if (<= y 5.5e+51) (/ 1.0 x) (/ x (* x x)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -3.5e+105) {
		tmp = (1.0 + (y * ((y * (y * -0.16666666666666666)) + -1.0))) / x;
	} else if (y <= 5.5e+51) {
		tmp = 1.0 / x;
	} else {
		tmp = x / (x * x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-3.5d+105)) then
        tmp = (1.0d0 + (y * ((y * (y * (-0.16666666666666666d0))) + (-1.0d0)))) / x
    else if (y <= 5.5d+51) then
        tmp = 1.0d0 / x
    else
        tmp = x / (x * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -3.5e+105) {
		tmp = (1.0 + (y * ((y * (y * -0.16666666666666666)) + -1.0))) / x;
	} else if (y <= 5.5e+51) {
		tmp = 1.0 / x;
	} else {
		tmp = x / (x * x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -3.5e+105:
		tmp = (1.0 + (y * ((y * (y * -0.16666666666666666)) + -1.0))) / x
	elif y <= 5.5e+51:
		tmp = 1.0 / x
	else:
		tmp = x / (x * x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -3.5e+105)
		tmp = Float64(Float64(1.0 + Float64(y * Float64(Float64(y * Float64(y * -0.16666666666666666)) + -1.0))) / x);
	elseif (y <= 5.5e+51)
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(x / Float64(x * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -3.5e+105)
		tmp = (1.0 + (y * ((y * (y * -0.16666666666666666)) + -1.0))) / x;
	elseif (y <= 5.5e+51)
		tmp = 1.0 / x;
	else
		tmp = x / (x * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -3.5e+105], N[(N[(1.0 + N[(y * N[(N[(y * N[(y * -0.16666666666666666), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 5.5e+51], N[(1.0 / x), $MachinePrecision], N[(x / N[(x * x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -3.49999999999999991e105

   1. Initial program 49.4%

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

      1. *-commutative 49.4%

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

      2. exp-to-pow 49.4%

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

   3. Simplified 49.4%

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

   5. Taylor expanded in x around inf 65.8%

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

      1. mul-1-neg 65.8%

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

   7. Simplified 65.8%

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

   8. Taylor expanded in y around 0 65.8%

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

   9. Taylor expanded in y around inf 65.8%

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

       1. *-commutative 65.8%

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

   11. Simplified 65.8%

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

   if -3.49999999999999991e105 < y < 5.5e51

   1. Initial program 94.2%

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

      1. exp-prod 95.3%

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

   3. Simplified 95.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 95.0%

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

   if 5.5e51 < y

   1. Initial program 45.0%

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

      1. exp-prod 62.6%

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

   3. Simplified 62.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 2.4%

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

      1. +-commutative 2.4%

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

      2. mul-1-neg 2.4%

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

      3. unsub-neg 2.4%

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

   7. Simplified 2.4%

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

      1. frac-2neg 2.4%

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

      2. frac-sub 12.7%

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

      3. *-un-lft-identity 12.7%

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

      4. add-sqr-sqrt 0.0%

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

      5. sqrt-unprod 14.3%

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

      6. sqr-neg 14.3%

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

      7. sqrt-unprod 14.4%

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

      8. add-sqr-sqrt 14.4%

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

      9. *-commutative 14.4%

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

   9. Applied egg-rr 14.4%

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

   10. Taylor expanded in x around 0 14.4%

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

       1. distribute-rgt-in 14.4%

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

       2. *-lft-identity 14.4%

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

       3. distribute-lft-in 14.4%

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

       4. neg-mul-1 14.4%

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

       5. sub-neg 14.4%

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

       6. distribute-rgt-out-- 14.4%

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

   12. Simplified 14.4%

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

   13. Taylor expanded in y around 0 62.3%

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

       1. mul-1-neg 62.3%

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

   15. Simplified 62.3%

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

4. Final simplification 84.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.5 \cdot 10^{+105}:\\ \;\;\;\;\frac{1 + y \cdot \left(y \cdot \left(y \cdot -0.16666666666666666\right) + -1\right)}{x}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{+51}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x \cdot x}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 77.5% accurate, 13.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4 \cdot 10^{+105}:\\ \;\;\;\;\frac{\frac{x \cdot \left(-y\right)}{x}}{x}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{+51}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x \cdot x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -4e+105)
   (/ (/ (* x (- y)) x) x)
   (if (<= y 5.5e+51) (/ 1.0 x) (/ x (* x x)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -4e+105) {
		tmp = ((x * -y) / x) / x;
	} else if (y <= 5.5e+51) {
		tmp = 1.0 / x;
	} else {
		tmp = x / (x * x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-4d+105)) then
        tmp = ((x * -y) / x) / x
    else if (y <= 5.5d+51) then
        tmp = 1.0d0 / x
    else
        tmp = x / (x * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -4e+105) {
		tmp = ((x * -y) / x) / x;
	} else if (y <= 5.5e+51) {
		tmp = 1.0 / x;
	} else {
		tmp = x / (x * x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -4e+105:
		tmp = ((x * -y) / x) / x
	elif y <= 5.5e+51:
		tmp = 1.0 / x
	else:
		tmp = x / (x * x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -4e+105)
		tmp = Float64(Float64(Float64(x * Float64(-y)) / x) / x);
	elseif (y <= 5.5e+51)
		tmp = Float64(1.0 / x);
	else
		tmp = Float64(x / Float64(x * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -4e+105)
		tmp = ((x * -y) / x) / x;
	elseif (y <= 5.5e+51)
		tmp = 1.0 / x;
	else
		tmp = x / (x * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -4e+105], N[(N[(N[(x * (-y)), $MachinePrecision] / x), $MachinePrecision] / x), $MachinePrecision], If[LessEqual[y, 5.5e+51], N[(1.0 / x), $MachinePrecision], N[(x / N[(x * x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -3.9999999999999998e105

   1. Initial program 49.4%

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

      1. exp-prod 78.2%

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

   3. Simplified 78.2%

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

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

      1. +-commutative 4.2%

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

      2. mul-1-neg 4.2%

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

      3. unsub-neg 4.2%

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

   7. Simplified 4.2%

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

      1. frac-sub 19.1%

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

      2. associate-/r* 49.7%

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

      3. *-un-lft-identity 49.7%

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

      4. *-commutative 49.7%

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

   9. Applied egg-rr 49.7%

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

   10. Taylor expanded in y around inf 49.7%

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

       1. mul-1-neg 49.7%

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

       2. *-commutative 49.7%

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

       3. distribute-lft-neg-in 49.7%

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

   12. Simplified 49.7%

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

   if -3.9999999999999998e105 < y < 5.5e51

   1. Initial program 94.2%

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

      1. exp-prod 95.3%

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

   3. Simplified 95.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 95.0%

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

   if 5.5e51 < y

   1. Initial program 45.0%

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

      1. exp-prod 62.6%

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

   3. Simplified 62.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 2.4%

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

      1. +-commutative 2.4%

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

      2. mul-1-neg 2.4%

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

      3. unsub-neg 2.4%

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

   7. Simplified 2.4%

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

      1. frac-2neg 2.4%

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

      2. frac-sub 12.7%

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

      3. *-un-lft-identity 12.7%

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

      4. add-sqr-sqrt 0.0%

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

      5. sqrt-unprod 14.3%

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

      6. sqr-neg 14.3%

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

      7. sqrt-unprod 14.4%

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

      8. add-sqr-sqrt 14.4%

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

      9. *-commutative 14.4%

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

   9. Applied egg-rr 14.4%

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

   10. Taylor expanded in x around 0 14.4%

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

       1. distribute-rgt-in 14.4%

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

       2. *-lft-identity 14.4%

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

       3. distribute-lft-in 14.4%

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

       4. neg-mul-1 14.4%

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

       5. sub-neg 14.4%

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

       6. distribute-rgt-out-- 14.4%

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

   12. Simplified 14.4%

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

   13. Taylor expanded in y around 0 62.3%

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

       1. mul-1-neg 62.3%

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

   15. Simplified 62.3%

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

4. Final simplification 82.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4 \cdot 10^{+105}:\\ \;\;\;\;\frac{\frac{x \cdot \left(-y\right)}{x}}{x}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{+51}:\\ \;\;\;\;\frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x \cdot x}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 77.3% accurate, 20.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 5.5e51

   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 92.3%

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

   3. Simplified 92.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 84.9%

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

   if 5.5e51 < y

   1. Initial program 45.0%

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

      1. exp-prod 62.6%

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

   3. Simplified 62.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 2.4%

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

      1. +-commutative 2.4%

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

      2. mul-1-neg 2.4%

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

      3. unsub-neg 2.4%

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

   7. Simplified 2.4%

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

      1. frac-2neg 2.4%

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

      2. frac-sub 12.7%

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

      3. *-un-lft-identity 12.7%

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

      4. add-sqr-sqrt 0.0%

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

      5. sqrt-unprod 14.3%

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

      6. sqr-neg 14.3%

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

      7. sqrt-unprod 14.4%

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

      8. add-sqr-sqrt 14.4%

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

      9. *-commutative 14.4%

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

   9. Applied egg-rr 14.4%

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

   10. Taylor expanded in x around 0 14.4%

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

       1. distribute-rgt-in 14.4%

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

       2. *-lft-identity 14.4%

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

       3. distribute-lft-in 14.4%

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

       4. neg-mul-1 14.4%

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

       5. sub-neg 14.4%

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

       6. distribute-rgt-out-- 14.4%

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

   12. Simplified 14.4%

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

   13. Taylor expanded in y around 0 62.3%

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

       1. mul-1-neg 62.3%

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

   15. Simplified 62.3%

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

4. Final simplification 80.5%

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

Alternative 6: 74.9% 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.5%

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

3. Simplified 86.5%

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

   \[\leadsto \color{blue}{\frac{1}{x}} \]
6. Add Preprocessing

Developer Target 1: 77.7% 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 2024181 
(FPCore (x y)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, F"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< y -37311844206647956000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (exp (/ -1 y)) x) (if (< y 28179592427282880000000000000000000000) (/ (pow (/ x (+ y x)) x) x) (if (< y 23473874151669980000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (log (exp (/ (pow (/ x (+ y x)) x) x))) (/ (exp (/ -1 y)) x)))))

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