Diagrams.Trail:splitAtParam from diagrams-lib-1.3.0.3, D

Percentage Accurate: 66.7% → 99.9%

Time: 9.6s

Alternatives: 14

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y) :precision binary64 (- 1.0 (/ (* (- 1.0 x) y) (+ y 1.0))))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0 - (((1.0 - x) * y) / (y + 1.0))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 66.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- 1.0 (/ (* (- 1.0 x) y) (+ y 1.0))))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0 - (((1.0 - x) * y) / (y + 1.0))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -12600:\\ \;\;\;\;x + \left(\left(\frac{1}{y} + \frac{1}{{y}^{3}}\right) + \left(\frac{x}{{y}^{2}} + \left(\left(\frac{-1}{{y}^{2}} - \frac{x}{{y}^{3}}\right) - \frac{x}{y}\right)\right)\right)\\ \mathbf{elif}\;y \leq 19000:\\ \;\;\;\;1 - \frac{y \cdot \left(1 - x\right)}{y + 1}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{\frac{\left(x + -1\right) + \frac{1 - x}{y}}{y} + \left(1 - x\right)}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -12600.0)
   (+
    x
    (+
     (+ (/ 1.0 y) (/ 1.0 (pow y 3.0)))
     (+
      (/ x (pow y 2.0))
      (- (- (/ -1.0 (pow y 2.0)) (/ x (pow y 3.0))) (/ x y)))))
   (if (<= y 19000.0)
     (- 1.0 (/ (* y (- 1.0 x)) (+ y 1.0)))
     (+ x (/ (+ (/ (+ (+ x -1.0) (/ (- 1.0 x) y)) y) (- 1.0 x)) y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -12600.0) {
		tmp = x + (((1.0 / y) + (1.0 / pow(y, 3.0))) + ((x / pow(y, 2.0)) + (((-1.0 / pow(y, 2.0)) - (x / pow(y, 3.0))) - (x / y))));
	} else if (y <= 19000.0) {
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	} else {
		tmp = x + (((((x + -1.0) + ((1.0 - x) / y)) / 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 <= (-12600.0d0)) then
        tmp = x + (((1.0d0 / y) + (1.0d0 / (y ** 3.0d0))) + ((x / (y ** 2.0d0)) + ((((-1.0d0) / (y ** 2.0d0)) - (x / (y ** 3.0d0))) - (x / y))))
    else if (y <= 19000.0d0) then
        tmp = 1.0d0 - ((y * (1.0d0 - x)) / (y + 1.0d0))
    else
        tmp = x + (((((x + (-1.0d0)) + ((1.0d0 - x) / y)) / y) + (1.0d0 - x)) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -12600.0) {
		tmp = x + (((1.0 / y) + (1.0 / Math.pow(y, 3.0))) + ((x / Math.pow(y, 2.0)) + (((-1.0 / Math.pow(y, 2.0)) - (x / Math.pow(y, 3.0))) - (x / y))));
	} else if (y <= 19000.0) {
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	} else {
		tmp = x + (((((x + -1.0) + ((1.0 - x) / y)) / y) + (1.0 - x)) / y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -12600.0:
		tmp = x + (((1.0 / y) + (1.0 / math.pow(y, 3.0))) + ((x / math.pow(y, 2.0)) + (((-1.0 / math.pow(y, 2.0)) - (x / math.pow(y, 3.0))) - (x / y))))
	elif y <= 19000.0:
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0))
	else:
		tmp = x + (((((x + -1.0) + ((1.0 - x) / y)) / y) + (1.0 - x)) / y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -12600.0)
		tmp = Float64(x + Float64(Float64(Float64(1.0 / y) + Float64(1.0 / (y ^ 3.0))) + Float64(Float64(x / (y ^ 2.0)) + Float64(Float64(Float64(-1.0 / (y ^ 2.0)) - Float64(x / (y ^ 3.0))) - Float64(x / y)))));
	elseif (y <= 19000.0)
		tmp = Float64(1.0 - Float64(Float64(y * Float64(1.0 - x)) / Float64(y + 1.0)));
	else
		tmp = Float64(x + Float64(Float64(Float64(Float64(Float64(x + -1.0) + Float64(Float64(1.0 - x) / y)) / y) + Float64(1.0 - x)) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -12600.0)
		tmp = x + (((1.0 / y) + (1.0 / (y ^ 3.0))) + ((x / (y ^ 2.0)) + (((-1.0 / (y ^ 2.0)) - (x / (y ^ 3.0))) - (x / y))));
	elseif (y <= 19000.0)
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	else
		tmp = x + (((((x + -1.0) + ((1.0 - x) / y)) / y) + (1.0 - x)) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -12600.0], N[(x + N[(N[(N[(1.0 / y), $MachinePrecision] + N[(1.0 / N[Power[y, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(x / N[Power[y, 2.0], $MachinePrecision]), $MachinePrecision] + N[(N[(N[(-1.0 / N[Power[y, 2.0], $MachinePrecision]), $MachinePrecision] - N[(x / N[Power[y, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 19000.0], N[(1.0 - N[(N[(y * N[(1.0 - x), $MachinePrecision]), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(N[(N[(N[(x + -1.0), $MachinePrecision] + N[(N[(1.0 - x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] + N[(1.0 - x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -12600

   1. Initial program 38.0%

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

      1. associate-/l* 48.4%

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

      2. remove-double-neg 48.4%

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

      3. remove-double-neg 48.4%

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

      4. +-commutative 48.4%

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

   3. Simplified 48.4%

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

   5. Taylor expanded in y around inf 100.0%

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

      1. associate--l+ 100.0%

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

      2. +-commutative 100.0%

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

      3. mul-1-neg 100.0%

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

      4. unsub-neg 100.0%

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

      5. associate-+r+ 100.0%

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

      6. +-commutative 100.0%

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

      7. associate-+l+ 100.0%

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

   7. Simplified 100.0%

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

   if -12600 < y < 19000

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing

   if 19000 < y

   1. Initial program 30.8%

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

      1. associate-/l* 55.6%

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

      2. remove-double-neg 55.6%

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

      3. remove-double-neg 55.6%

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

      4. +-commutative 55.6%

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

   3. Simplified 55.6%

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

   5. Taylor expanded in y around -inf 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 99.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y \cdot \left(1 - x\right)}{y + 1}\\ \mathbf{if}\;t\_0 \leq 0.4 \lor \neg \left(t\_0 \leq 1.000005\right):\\ \;\;\;\;1 - \left(x + -1\right) \cdot \frac{y}{-1 - y}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{\frac{1}{y} + -1}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* y (- 1.0 x)) (+ y 1.0))))
   (if (or (<= t_0 0.4) (not (<= t_0 1.000005)))
     (- 1.0 (* (+ x -1.0) (/ y (- -1.0 y))))
     (- x (/ (+ (/ 1.0 y) -1.0) y)))))

C

double code(double x, double y) {
	double t_0 = (y * (1.0 - x)) / (y + 1.0);
	double tmp;
	if ((t_0 <= 0.4) || !(t_0 <= 1.000005)) {
		tmp = 1.0 - ((x + -1.0) * (y / (-1.0 - y)));
	} else {
		tmp = x - (((1.0 / y) + -1.0) / y);
	}
	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) :: tmp
    t_0 = (y * (1.0d0 - x)) / (y + 1.0d0)
    if ((t_0 <= 0.4d0) .or. (.not. (t_0 <= 1.000005d0))) then
        tmp = 1.0d0 - ((x + (-1.0d0)) * (y / ((-1.0d0) - y)))
    else
        tmp = x - (((1.0d0 / y) + (-1.0d0)) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (y * (1.0 - x)) / (y + 1.0);
	double tmp;
	if ((t_0 <= 0.4) || !(t_0 <= 1.000005)) {
		tmp = 1.0 - ((x + -1.0) * (y / (-1.0 - y)));
	} else {
		tmp = x - (((1.0 / y) + -1.0) / y);
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (y * (1.0 - x)) / (y + 1.0)
	tmp = 0
	if (t_0 <= 0.4) or not (t_0 <= 1.000005):
		tmp = 1.0 - ((x + -1.0) * (y / (-1.0 - y)))
	else:
		tmp = x - (((1.0 / y) + -1.0) / y)
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(y * Float64(1.0 - x)) / Float64(y + 1.0))
	tmp = 0.0
	if ((t_0 <= 0.4) || !(t_0 <= 1.000005))
		tmp = Float64(1.0 - Float64(Float64(x + -1.0) * Float64(y / Float64(-1.0 - y))));
	else
		tmp = Float64(x - Float64(Float64(Float64(1.0 / y) + -1.0) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (y * (1.0 - x)) / (y + 1.0);
	tmp = 0.0;
	if ((t_0 <= 0.4) || ~((t_0 <= 1.000005)))
		tmp = 1.0 - ((x + -1.0) * (y / (-1.0 - y)));
	else
		tmp = x - (((1.0 / y) + -1.0) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(y * N[(1.0 - x), $MachinePrecision]), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 0.4], N[Not[LessEqual[t$95$0, 1.000005]], $MachinePrecision]], N[(1.0 - N[(N[(x + -1.0), $MachinePrecision] * N[(y / N[(-1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[(N[(1.0 / y), $MachinePrecision] + -1.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64))) < 0.40000000000000002 or 1.00000500000000003 < (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64)))

   1. Initial program 87.5%

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

      1. associate-/l* 99.8%

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

      2. remove-double-neg 99.8%

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

      3. remove-double-neg 99.8%

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

      4. +-commutative 99.8%

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

   3. Simplified 99.8%

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

   if 0.40000000000000002 < (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64))) < 1.00000500000000003

   1. Initial program 11.0%

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

      1. associate-/l* 11.0%

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

      2. remove-double-neg 11.0%

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

      3. remove-double-neg 11.0%

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

      4. +-commutative 11.0%

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

   3. Simplified 11.0%

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

   5. Taylor expanded in y around -inf 99.5%

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

   7. Simplified 99.5%

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

   8. Taylor expanded in x around 0 99.5%

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

4. Final simplification 99.7%

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

Alternative 3: 99.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -12600 \lor \neg \left(y \leq 16000\right):\\ \;\;\;\;x + \frac{\frac{\left(x + -1\right) + \frac{1 - x}{y}}{y} + \left(1 - x\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{y \cdot \left(1 - x\right)}{y + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -12600.0) (not (<= y 16000.0)))
   (+ x (/ (+ (/ (+ (+ x -1.0) (/ (- 1.0 x) y)) y) (- 1.0 x)) y))
   (- 1.0 (/ (* y (- 1.0 x)) (+ y 1.0)))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -12600.0) || !(y <= 16000.0)) {
		tmp = x + (((((x + -1.0) + ((1.0 - x) / y)) / y) + (1.0 - x)) / y);
	} else {
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-12600.0d0)) .or. (.not. (y <= 16000.0d0))) then
        tmp = x + (((((x + (-1.0d0)) + ((1.0d0 - x) / y)) / y) + (1.0d0 - x)) / y)
    else
        tmp = 1.0d0 - ((y * (1.0d0 - x)) / (y + 1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -12600.0) || !(y <= 16000.0)) {
		tmp = x + (((((x + -1.0) + ((1.0 - x) / y)) / y) + (1.0 - x)) / y);
	} else {
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -12600.0) or not (y <= 16000.0):
		tmp = x + (((((x + -1.0) + ((1.0 - x) / y)) / y) + (1.0 - x)) / y)
	else:
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -12600.0) || !(y <= 16000.0))
		tmp = Float64(x + Float64(Float64(Float64(Float64(Float64(x + -1.0) + Float64(Float64(1.0 - x) / y)) / y) + Float64(1.0 - x)) / y));
	else
		tmp = Float64(1.0 - Float64(Float64(y * Float64(1.0 - x)) / Float64(y + 1.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -12600.0) || ~((y <= 16000.0)))
		tmp = x + (((((x + -1.0) + ((1.0 - x) / y)) / y) + (1.0 - x)) / y);
	else
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -12600.0], N[Not[LessEqual[y, 16000.0]], $MachinePrecision]], N[(x + N[(N[(N[(N[(N[(x + -1.0), $MachinePrecision] + N[(N[(1.0 - x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision] + N[(1.0 - x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(N[(y * N[(1.0 - x), $MachinePrecision]), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -12600 or 16000 < y

   1. Initial program 34.0%

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

      1. associate-/l* 52.5%

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

      2. remove-double-neg 52.5%

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

      3. remove-double-neg 52.5%

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

      4. +-commutative 52.5%

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

   3. Simplified 52.5%

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

   5. Taylor expanded in y around -inf 100.0%

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

   7. Simplified 100.0%

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

   if -12600 < y < 16000

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

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

Alternative 4: 99.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -225000 \lor \neg \left(y \leq 320000\right):\\ \;\;\;\;x - \frac{-1}{\frac{y}{\frac{x + -1}{y} + \left(1 - x\right)}}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{y \cdot \left(1 - x\right)}{y + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -225000.0) (not (<= y 320000.0)))
   (- x (/ -1.0 (/ y (+ (/ (+ x -1.0) y) (- 1.0 x)))))
   (- 1.0 (/ (* y (- 1.0 x)) (+ y 1.0)))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -225000.0) || !(y <= 320000.0)) {
		tmp = x - (-1.0 / (y / (((x + -1.0) / y) + (1.0 - x))));
	} else {
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-225000.0d0)) .or. (.not. (y <= 320000.0d0))) then
        tmp = x - ((-1.0d0) / (y / (((x + (-1.0d0)) / y) + (1.0d0 - x))))
    else
        tmp = 1.0d0 - ((y * (1.0d0 - x)) / (y + 1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -225000.0) || !(y <= 320000.0)) {
		tmp = x - (-1.0 / (y / (((x + -1.0) / y) + (1.0 - x))));
	} else {
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -225000.0) or not (y <= 320000.0):
		tmp = x - (-1.0 / (y / (((x + -1.0) / y) + (1.0 - x))))
	else:
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -225000.0) || !(y <= 320000.0))
		tmp = Float64(x - Float64(-1.0 / Float64(y / Float64(Float64(Float64(x + -1.0) / y) + Float64(1.0 - x)))));
	else
		tmp = Float64(1.0 - Float64(Float64(y * Float64(1.0 - x)) / Float64(y + 1.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -225000.0) || ~((y <= 320000.0)))
		tmp = x - (-1.0 / (y / (((x + -1.0) / y) + (1.0 - x))));
	else
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -225000.0], N[Not[LessEqual[y, 320000.0]], $MachinePrecision]], N[(x - N[(-1.0 / N[(y / N[(N[(N[(x + -1.0), $MachinePrecision] / y), $MachinePrecision] + N[(1.0 - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(N[(y * N[(1.0 - x), $MachinePrecision]), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -225000 or 3.2e5 < y

   1. Initial program 33.7%

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

      1. associate-/l* 52.3%

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

      2. remove-double-neg 52.3%

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

      3. remove-double-neg 52.3%

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

      4. +-commutative 52.3%

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

   3. Simplified 52.3%

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

   5. Taylor expanded in y around -inf 99.7%

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

   7. Simplified 99.7%

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

      1. clear-num 99.7%

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

      2. inv-pow 99.7%

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

      3. associate-+l+ 99.7%

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

   9. Applied egg-rr 99.7%

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

       1. unpow-1 99.7%

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

       2. +-commutative 99.7%

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

       3. +-commutative 99.7%

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

       4. associate-+r+ 99.7%

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

       5. +-commutative 99.7%

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

   11. Simplified 99.7%

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

   if -225000 < y < 3.2e5

   1. Initial program 99.8%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.8%

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

Alternative 5: 99.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -300000 \lor \neg \left(y \leq 310000\right):\\ \;\;\;\;x + \frac{\frac{x + -1}{y} + \left(1 - x\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{y \cdot \left(1 - x\right)}{y + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -300000.0) (not (<= y 310000.0)))
   (+ x (/ (+ (/ (+ x -1.0) y) (- 1.0 x)) y))
   (- 1.0 (/ (* y (- 1.0 x)) (+ y 1.0)))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -300000.0) || !(y <= 310000.0)) {
		tmp = x + ((((x + -1.0) / y) + (1.0 - x)) / y);
	} else {
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-300000.0d0)) .or. (.not. (y <= 310000.0d0))) then
        tmp = x + ((((x + (-1.0d0)) / y) + (1.0d0 - x)) / y)
    else
        tmp = 1.0d0 - ((y * (1.0d0 - x)) / (y + 1.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -300000.0) || !(y <= 310000.0)) {
		tmp = x + ((((x + -1.0) / y) + (1.0 - x)) / y);
	} else {
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -300000.0) or not (y <= 310000.0):
		tmp = x + ((((x + -1.0) / y) + (1.0 - x)) / y)
	else:
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -300000.0) || !(y <= 310000.0))
		tmp = Float64(x + Float64(Float64(Float64(Float64(x + -1.0) / y) + Float64(1.0 - x)) / y));
	else
		tmp = Float64(1.0 - Float64(Float64(y * Float64(1.0 - x)) / Float64(y + 1.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -300000.0) || ~((y <= 310000.0)))
		tmp = x + ((((x + -1.0) / y) + (1.0 - x)) / y);
	else
		tmp = 1.0 - ((y * (1.0 - x)) / (y + 1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -300000.0], N[Not[LessEqual[y, 310000.0]], $MachinePrecision]], N[(x + N[(N[(N[(N[(x + -1.0), $MachinePrecision] / y), $MachinePrecision] + N[(1.0 - x), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(1.0 - N[(N[(y * N[(1.0 - x), $MachinePrecision]), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3e5 or 3.1e5 < y

   1. Initial program 33.7%

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

      1. associate-/l* 52.3%

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

      2. remove-double-neg 52.3%

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

      3. remove-double-neg 52.3%

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

      4. +-commutative 52.3%

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

   3. Simplified 52.3%

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

   5. Taylor expanded in y around -inf 99.7%

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

   7. Simplified 99.7%

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

   if -3e5 < y < 3.1e5

   1. Initial program 99.8%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.8%

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

Alternative 6: 85.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{+56}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq -1:\\ \;\;\;\;\frac{1}{y}\\ \mathbf{elif}\;y \leq 1.16 \cdot 10^{+15}:\\ \;\;\;\;1 + y \cdot x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -6e+56)
   x
   (if (<= y -1.0) (/ 1.0 y) (if (<= y 1.16e+15) (+ 1.0 (* y x)) x))))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -6e+56) {
		tmp = x;
	} else if (y <= -1.0) {
		tmp = 1.0 / y;
	} else if (y <= 1.16e+15) {
		tmp = 1.0 + (y * x);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -6e+56:
		tmp = x
	elif y <= -1.0:
		tmp = 1.0 / y
	elif y <= 1.16e+15:
		tmp = 1.0 + (y * x)
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -6e+56)
		tmp = x;
	elseif (y <= -1.0)
		tmp = Float64(1.0 / y);
	elseif (y <= 1.16e+15)
		tmp = Float64(1.0 + Float64(y * x));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -6e+56)
		tmp = x;
	elseif (y <= -1.0)
		tmp = 1.0 / y;
	elseif (y <= 1.16e+15)
		tmp = 1.0 + (y * x);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -6e+56], x, If[LessEqual[y, -1.0], N[(1.0 / y), $MachinePrecision], If[LessEqual[y, 1.16e+15], N[(1.0 + N[(y * x), $MachinePrecision]), $MachinePrecision], x]]]

Derivation

1. Split input into 3 regimes

2. if y < -6.00000000000000012e56 or 1.16e15 < y

   1. Initial program 32.0%

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

      1. associate-/l* 53.8%

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

      2. remove-double-neg 53.8%

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

      3. remove-double-neg 53.8%

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

      4. +-commutative 53.8%

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

   3. Simplified 53.8%

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

   5. Taylor expanded in y around inf 77.7%

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

   if -6.00000000000000012e56 < y < -1

   1. Initial program 45.1%

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

      1. associate-/l* 45.1%

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

      2. remove-double-neg 45.1%

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

      3. remove-double-neg 45.1%

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

      4. +-commutative 45.1%

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

   3. Simplified 45.1%

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

   5. Taylor expanded in y around -inf 86.4%

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

      1. mul-1-neg 86.4%

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

      2. unsub-neg 86.4%

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

      3. sub-neg 86.4%

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

      4. metadata-eval 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in x around 0 58.7%

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

   if -1 < y < 1.16e15

   1. Initial program 99.1%

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

      1. associate-/l* 99.1%

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

      2. remove-double-neg 99.1%

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

      3. remove-double-neg 99.1%

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

      4. +-commutative 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in y around 0 97.4%

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

   6. Taylor expanded in x around inf 96.8%

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

      1. neg-mul-1 96.8%

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

   8. Simplified 96.8%

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

      1. cancel-sign-sub 96.8%

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

      2. *-commutative 96.8%

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

      3. +-commutative 96.8%

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

      4. *-commutative 96.8%

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

   10. Applied egg-rr 96.8%

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

4. Final simplification 86.3%

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

Alternative 7: 98.4% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = x - (((1.0 / y) + -1.0) / y);
	} else {
		tmp = 1.0 - (y * (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 ((y <= (-1.0d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = x - (((1.0d0 / y) + (-1.0d0)) / y)
    else
        tmp = 1.0d0 - (y * (1.0d0 - x))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if (y <= -1.0) or not (y <= 1.0):
		tmp = x - (((1.0 / y) + -1.0) / y)
	else:
		tmp = 1.0 - (y * (1.0 - x))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 34.0%

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

      1. associate-/l* 52.5%

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

      2. remove-double-neg 52.5%

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

      3. remove-double-neg 52.5%

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

      4. +-commutative 52.5%

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

   3. Simplified 52.5%

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

   5. Taylor expanded in y around -inf 99.5%

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

   7. Simplified 99.5%

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

   8. Taylor expanded in x around 0 99.1%

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

   if -1 < y < 1

   1. Initial program 100.0%

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

      1. associate-/l* 100.0%

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

      2. remove-double-neg 100.0%

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

      3. remove-double-neg 100.0%

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

      4. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 98.9%

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

4. Final simplification 99.0%

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

Alternative 8: 74.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -8 \cdot 10^{+55}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq -1:\\ \;\;\;\;\frac{1}{y}\\ \mathbf{elif}\;y \leq 0.92:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -8e+55) x (if (<= y -1.0) (/ 1.0 y) (if (<= y 0.92) (- 1.0 y) x))))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -8e+55) {
		tmp = x;
	} else if (y <= -1.0) {
		tmp = 1.0 / y;
	} else if (y <= 0.92) {
		tmp = 1.0 - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -8e+55:
		tmp = x
	elif y <= -1.0:
		tmp = 1.0 / y
	elif y <= 0.92:
		tmp = 1.0 - y
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -8e+55)
		tmp = x;
	elseif (y <= -1.0)
		tmp = Float64(1.0 / y);
	elseif (y <= 0.92)
		tmp = Float64(1.0 - y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -8e+55)
		tmp = x;
	elseif (y <= -1.0)
		tmp = 1.0 / y;
	elseif (y <= 0.92)
		tmp = 1.0 - y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -8e+55], x, If[LessEqual[y, -1.0], N[(1.0 / y), $MachinePrecision], If[LessEqual[y, 0.92], N[(1.0 - y), $MachinePrecision], x]]]

Derivation

1. Split input into 3 regimes

2. if y < -8.00000000000000008e55 or 0.92000000000000004 < y

   1. Initial program 32.2%

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

      1. associate-/l* 53.6%

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

      2. remove-double-neg 53.6%

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

      3. remove-double-neg 53.6%

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

      4. +-commutative 53.6%

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

   3. Simplified 53.6%

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

   5. Taylor expanded in y around inf 76.3%

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

   if -8.00000000000000008e55 < y < -1

   1. Initial program 45.1%

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

      1. associate-/l* 45.1%

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

      2. remove-double-neg 45.1%

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

      3. remove-double-neg 45.1%

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

      4. +-commutative 45.1%

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

   3. Simplified 45.1%

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

   5. Taylor expanded in y around -inf 86.4%

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

      1. mul-1-neg 86.4%

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

      2. unsub-neg 86.4%

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

      3. sub-neg 86.4%

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

      4. metadata-eval 86.4%

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

   7. Simplified 86.4%

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

   8. Taylor expanded in x around 0 58.7%

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

   if -1 < y < 0.92000000000000004

   1. Initial program 100.0%

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

      1. associate-/l* 100.0%

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

      2. remove-double-neg 100.0%

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

      3. remove-double-neg 100.0%

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

      4. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 98.9%

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

   6. Taylor expanded in x around 0 81.3%

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

Alternative 9: 98.4% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = x + ((1.0 - x) / y);
	} else {
		tmp = 1.0 - (y * (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 ((y <= (-1.0d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = x + ((1.0d0 - x) / y)
    else
        tmp = 1.0d0 - (y * (1.0d0 - x))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if (y <= -1.0) or not (y <= 1.0):
		tmp = x + ((1.0 - x) / y)
	else:
		tmp = 1.0 - (y * (1.0 - x))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 34.0%

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

      1. associate-/l* 52.5%

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

      2. remove-double-neg 52.5%

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

      3. remove-double-neg 52.5%

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

      4. +-commutative 52.5%

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

   3. Simplified 52.5%

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

   5. Taylor expanded in y around -inf 97.8%

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

      1. mul-1-neg 97.8%

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

      2. unsub-neg 97.8%

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

      3. sub-neg 97.8%

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

      4. metadata-eval 97.8%

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

   7. Simplified 97.8%

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

   if -1 < y < 1

   1. Initial program 100.0%

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

      1. associate-/l* 100.0%

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

      2. remove-double-neg 100.0%

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

      3. remove-double-neg 100.0%

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

      4. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 98.9%

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

4. Final simplification 98.4%

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

Alternative 10: 98.2% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 0.82)))
   (+ x (/ 1.0 y))
   (- 1.0 (* y (- 1.0 x)))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 0.82)) {
		tmp = x + (1.0 / y);
	} else {
		tmp = 1.0 - (y * (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 ((y <= (-1.0d0)) .or. (.not. (y <= 0.82d0))) then
        tmp = x + (1.0d0 / y)
    else
        tmp = 1.0d0 - (y * (1.0d0 - x))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 0.82)) {
		tmp = x + (1.0 / y);
	} else {
		tmp = 1.0 - (y * (1.0 - x));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.0) or not (y <= 0.82):
		tmp = x + (1.0 / y)
	else:
		tmp = 1.0 - (y * (1.0 - x))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 0.82))
		tmp = Float64(x + Float64(1.0 / y));
	else
		tmp = Float64(1.0 - Float64(y * Float64(1.0 - x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.0) || ~((y <= 0.82)))
		tmp = x + (1.0 / y);
	else
		tmp = 1.0 - (y * (1.0 - x));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.819999999999999951 < y

   1. Initial program 34.0%

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

      1. associate-/l* 52.5%

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

      2. remove-double-neg 52.5%

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

      3. remove-double-neg 52.5%

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

      4. +-commutative 52.5%

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

   3. Simplified 52.5%

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

   5. Taylor expanded in y around -inf 97.8%

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

      1. mul-1-neg 97.8%

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

      2. unsub-neg 97.8%

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

      3. sub-neg 97.8%

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

      4. metadata-eval 97.8%

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

   7. Simplified 97.8%

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

   8. Taylor expanded in x around 0 97.4%

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

   if -1 < y < 0.819999999999999951

   1. Initial program 100.0%

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

      1. associate-/l* 100.0%

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

      2. remove-double-neg 100.0%

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

      3. remove-double-neg 100.0%

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

      4. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 98.9%

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

4. Final simplification 98.2%

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

Alternative 11: 97.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = x + (1.0 / y);
	} else {
		tmp = 1.0 + (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 ((y <= (-1.0d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = x + (1.0d0 / y)
    else
        tmp = 1.0d0 + (y * x)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if (y <= -1.0) or not (y <= 1.0):
		tmp = x + (1.0 / y)
	else:
		tmp = 1.0 + (y * x)
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 34.0%

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

      1. associate-/l* 52.5%

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

      2. remove-double-neg 52.5%

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

      3. remove-double-neg 52.5%

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

      4. +-commutative 52.5%

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

   3. Simplified 52.5%

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

   5. Taylor expanded in y around -inf 97.8%

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

      1. mul-1-neg 97.8%

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

      2. unsub-neg 97.8%

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

      3. sub-neg 97.8%

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

      4. metadata-eval 97.8%

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

   7. Simplified 97.8%

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

   8. Taylor expanded in x around 0 97.4%

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

   if -1 < y < 1

   1. Initial program 100.0%

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

      1. associate-/l* 100.0%

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

      2. remove-double-neg 100.0%

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

      3. remove-double-neg 100.0%

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

      4. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 98.9%

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

   6. Taylor expanded in x around inf 98.1%

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

      1. neg-mul-1 98.1%

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

   8. Simplified 98.1%

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

      1. cancel-sign-sub 98.1%

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

      2. *-commutative 98.1%

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

      3. +-commutative 98.1%

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

      4. *-commutative 98.1%

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

   10. Applied egg-rr 98.1%

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

4. Final simplification 97.7%

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

Alternative 12: 75.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 0.92:\\ \;\;\;\;1 - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.0) x (if (<= y 0.92) (- 1.0 y) x)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 0.92) {
		tmp = 1.0 - y;
	} else {
		tmp = 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 <= (-1.0d0)) then
        tmp = x
    else if (y <= 0.92d0) then
        tmp = 1.0d0 - y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 0.92) {
		tmp = 1.0 - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.0:
		tmp = x
	elif y <= 0.92:
		tmp = 1.0 - y
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 0.92)
		tmp = Float64(1.0 - y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 0.92)
		tmp = 1.0 - y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.0], x, If[LessEqual[y, 0.92], N[(1.0 - y), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.92000000000000004 < y

   1. Initial program 34.0%

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

      1. associate-/l* 52.5%

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

      2. remove-double-neg 52.5%

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

      3. remove-double-neg 52.5%

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

      4. +-commutative 52.5%

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

   3. Simplified 52.5%

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

   5. Taylor expanded in y around inf 69.9%

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

   if -1 < y < 0.92000000000000004

   1. Initial program 100.0%

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

      1. associate-/l* 100.0%

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

      2. remove-double-neg 100.0%

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

      3. remove-double-neg 100.0%

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

      4. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 98.9%

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

   6. Taylor expanded in x around 0 81.3%

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

Alternative 13: 74.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.16 \cdot 10^{+15}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.0) x (if (<= y 1.16e+15) 1.0 x)))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 1.16e+15) {
		tmp = 1.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.0:
		tmp = x
	elif y <= 1.16e+15:
		tmp = 1.0
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 1.16e+15)
		tmp = 1.0;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 1.16e+15)
		tmp = 1.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.0], x, If[LessEqual[y, 1.16e+15], 1.0, x]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1.16e15 < y

   1. Initial program 33.8%

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

      1. associate-/l* 52.6%

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

      2. remove-double-neg 52.6%

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

      3. remove-double-neg 52.6%

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

      4. +-commutative 52.6%

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

   3. Simplified 52.6%

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

   5. Taylor expanded in y around inf 71.0%

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

   if -1 < y < 1.16e15

   1. Initial program 99.1%

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

      1. associate-/l* 99.1%

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

      2. remove-double-neg 99.1%

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

      3. remove-double-neg 99.1%

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

      4. +-commutative 99.1%

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

   3. Simplified 99.1%

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

   5. Taylor expanded in y around 0 79.4%

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

Alternative 14: 39.7% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 1.0)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 67.5%

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

   1. associate-/l* 76.6%

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

   2. remove-double-neg 76.6%

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

   3. remove-double-neg 76.6%

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

   4. +-commutative 76.6%

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

3. Simplified 76.6%

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

5. Taylor expanded in y around 0 42.8%

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

Developer Target 1: 99.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{y} - \left(\frac{x}{y} - x\right)\\ \mathbf{if}\;y < -3693.8482788297247:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y < 6799310503.41891:\\ \;\;\;\;1 - \frac{\left(1 - x\right) \cdot y}{y + 1}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- (/ 1.0 y) (- (/ x y) x))))
   (if (< y -3693.8482788297247)
     t_0
     (if (< y 6799310503.41891) (- 1.0 (/ (* (- 1.0 x) y) (+ y 1.0))) t_0))))

C

double code(double x, double y) {
	double t_0 = (1.0 / y) - ((x / y) - x);
	double tmp;
	if (y < -3693.8482788297247) {
		tmp = t_0;
	} else if (y < 6799310503.41891) {
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	} 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) :: tmp
    t_0 = (1.0d0 / y) - ((x / y) - x)
    if (y < (-3693.8482788297247d0)) then
        tmp = t_0
    else if (y < 6799310503.41891d0) then
        tmp = 1.0d0 - (((1.0d0 - x) * y) / (y + 1.0d0))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (1.0 / y) - ((x / y) - x);
	double tmp;
	if (y < -3693.8482788297247) {
		tmp = t_0;
	} else if (y < 6799310503.41891) {
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (1.0 / y) - ((x / y) - x)
	tmp = 0
	if y < -3693.8482788297247:
		tmp = t_0
	elif y < 6799310503.41891:
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(1.0 / y) - Float64(Float64(x / y) - x))
	tmp = 0.0
	if (y < -3693.8482788297247)
		tmp = t_0;
	elseif (y < 6799310503.41891)
		tmp = Float64(1.0 - Float64(Float64(Float64(1.0 - x) * y) / Float64(y + 1.0)));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (1.0 / y) - ((x / y) - x);
	tmp = 0.0;
	if (y < -3693.8482788297247)
		tmp = t_0;
	elseif (y < 6799310503.41891)
		tmp = 1.0 - (((1.0 - x) * y) / (y + 1.0));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(1.0 / y), $MachinePrecision] - N[(N[(x / y), $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision]}, If[Less[y, -3693.8482788297247], t$95$0, If[Less[y, 6799310503.41891], N[(1.0 - N[(N[(N[(1.0 - x), $MachinePrecision] * y), $MachinePrecision] / N[(y + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Reproduce

herbie shell --seed 2024131 
(FPCore (x y)
  :name "Diagrams.Trail:splitAtParam  from diagrams-lib-1.3.0.3, D"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< y -36938482788297247/10000000000000) (- (/ 1 y) (- (/ x y) x)) (if (< y 679931050341891/100000) (- 1 (/ (* (- 1 x) y) (+ y 1))) (- (/ 1 y) (- (/ x y) x)))))

  (- 1.0 (/ (* (- 1.0 x) y) (+ y 1.0))))