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

Percentage Accurate: 78.0% → 99.4%

Time: 10.8s

Alternatives: 5

Speedup: 17.4×

• Could not converge on a ground truth

  1. x = -1.2187158870658048e+239
  2. y = -2.041544848804552e-38

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.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+57} \lor \neg \left(x \leq 1.85 \cdot 10^{-7}\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 -1e+57) (not (<= x 1.85e-7)))
   (/ (exp (- y)) x)
   (/ (pow (exp x) (log (/ x (+ x y)))) x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1e+57) || !(x <= 1.85e-7)) {
		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 <= (-1d+57)) .or. (.not. (x <= 1.85d-7))) 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 <= -1e+57) || !(x <= 1.85e-7)) {
		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 <= -1e+57) or not (x <= 1.85e-7):
		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 <= -1e+57) || !(x <= 1.85e-7))
		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 <= -1e+57) || ~((x <= 1.85e-7)))
		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, -1e+57], N[Not[LessEqual[x, 1.85e-7]], $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 < -1.00000000000000005e57 or 1.85000000000000002e-7 < x

   1. Initial program 64.7%

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

      1. *-commutative 64.7%

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

      2. exp-to-pow 64.7%

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

   3. Simplified 64.7%

      \[\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 -1.00000000000000005e57 < x < 1.85000000000000002e-7

   1. Initial program 84.1%

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

      1. exp-prod 99.8%

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

   3. Simplified 99.8%

      \[\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 -1 \cdot 10^{+57} \lor \neg \left(x \leq 1.85 \cdot 10^{-7}\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.4% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -210.0) (not (<= x 1.85e-7))) (/ (exp (- y)) x) (/ 1.0 x)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -210 or 1.85000000000000002e-7 < x

   1. Initial program 66.7%

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

      1. *-commutative 66.7%

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

      2. exp-to-pow 66.7%

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

   3. Simplified 66.7%

      \[\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 -210 < x < 1.85000000000000002e-7

   1. Initial program 83.0%

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

      1. exp-prod 99.8%

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

   3. Simplified 99.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 99.2%

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

4. Final simplification 99.6%

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

Alternative 3: 82.3% accurate, 11.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -5.5e+108)
   (/ (+ 1.0 (* y (+ (* y (* y -0.16666666666666666)) -1.0))) x)
   (if (<= y 4.2e+78) (/ 1.0 x) (* y (/ 1.0 (* x y))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -5.5e+108) {
		tmp = (1.0 + (y * ((y * (y * -0.16666666666666666)) + -1.0))) / x;
	} else if (y <= 4.2e+78) {
		tmp = 1.0 / x;
	} else {
		tmp = y * (1.0 / (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 <= (-5.5d+108)) then
        tmp = (1.0d0 + (y * ((y * (y * (-0.16666666666666666d0))) + (-1.0d0)))) / x
    else if (y <= 4.2d+78) then
        tmp = 1.0d0 / x
    else
        tmp = y * (1.0d0 / (x * y))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := If[LessEqual[y, -5.5e+108], 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, 4.2e+78], N[(1.0 / x), $MachinePrecision], N[(y * N[(1.0 / N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -5.4999999999999998e108

   1. Initial program 39.0%

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

      1. *-commutative 39.0%

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

      2. exp-to-pow 39.0%

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

   3. Simplified 39.0%

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

   5. Taylor expanded in x around inf 68.6%

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

      1. mul-1-neg 68.6%

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

   7. Simplified 68.6%

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

   8. Taylor expanded in y around 0 68.6%

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

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

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

   11. Simplified 68.6%

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

   if -5.4999999999999998e108 < y < 4.2000000000000002e78

   1. Initial program 88.6%

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

      1. exp-prod 89.1%

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

   3. Simplified 89.1%

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

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

   if 4.2000000000000002e78 < y

   1. Initial program 30.1%

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

      1. exp-prod 57.4%

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

   3. Simplified 57.4%

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

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

      1. +-commutative 2.5%

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

      2. mul-1-neg 2.5%

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

      3. unsub-neg 2.5%

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

   7. Simplified 2.5%

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

      1. clear-num 2.5%

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

      2. frac-sub 36.7%

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

      3. *-un-lft-identity 36.7%

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

   9. Applied egg-rr 36.7%

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

   10. Taylor expanded in x around 0 2.5%

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

       1. associate-/l* 2.5%

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

       2. sub-neg 2.5%

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

       3. metadata-eval 2.5%

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

   12. Simplified 2.5%

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

   13. Taylor expanded in y around 0 93.6%

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

       1. *-commutative 93.6%

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

   15. Simplified 93.6%

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

4. Final simplification 85.7%

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

Alternative 4: 80.4% accurate, 17.4× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= 4.2e+78) {
		tmp = 1.0 / x;
	} else {
		tmp = y * (1.0 / (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 <= 4.2d+78) then
        tmp = 1.0d0 / x
    else
        tmp = y * (1.0d0 / (x * y))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 4.2000000000000002e78

   1. Initial program 81.7%

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

      1. exp-prod 85.6%

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

   3. Simplified 85.6%

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

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

   if 4.2000000000000002e78 < y

   1. Initial program 30.1%

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

      1. exp-prod 57.4%

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

   3. Simplified 57.4%

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

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

      1. +-commutative 2.5%

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

      2. mul-1-neg 2.5%

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

      3. unsub-neg 2.5%

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

   7. Simplified 2.5%

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

      1. clear-num 2.5%

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

      2. frac-sub 36.7%

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

      3. *-un-lft-identity 36.7%

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

   9. Applied egg-rr 36.7%

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

   10. Taylor expanded in x around 0 2.5%

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

       1. associate-/l* 2.5%

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

       2. sub-neg 2.5%

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

       3. metadata-eval 2.5%

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

   12. Simplified 2.5%

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

   13. Taylor expanded in y around 0 93.6%

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

       1. *-commutative 93.6%

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

   15. Simplified 93.6%

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

4. Final simplification 81.8%

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

Alternative 5: 75.1% 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 73.9%

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

   1. exp-prod 81.3%

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

3. Simplified 81.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 74.6%

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

Developer Target 1: 78.4% 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 2024165 
(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))