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

Percentage Accurate: 65.9% → 99.4%

Time: 7.6s

Alternatives: 9

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: 65.9% 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.4% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* (- 1.0 x) y) (+ 1.0 y))) (t_1 (/ y (- -1.0 y))))
   (if (<= t_0 0.0002)
     (+ 1.0 (* (- 1.0 x) t_1))
     (if (<= t_0 1.0)
       (+ x (/ (- (/ -1.0 y) -1.0) y))
       (* x (+ (/ y (+ 1.0 y)) (/ (+ 1.0 t_1) x)))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64))) < 2.0000000000000001e-4

   1. Initial program 88.3%

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

   if 2.0000000000000001e-4 < (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64))) < 1

   1. Initial program 5.5%

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

      1. associate-/l* 5.5%

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

      2. remove-double-neg 5.5%

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

      3. remove-double-neg 5.5%

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

      4. +-commutative 5.5%

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

   3. Simplified 5.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.9%

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

      1. mul-1-neg 99.9%

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

      2. unsub-neg 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 99.9%

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

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

   1. Initial program 62.3%

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

      1. sub-neg 62.3%

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

      2. +-commutative 62.3%

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

      3. *-commutative 62.3%

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

      4. associate-/l* 97.3%

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

      5. distribute-rgt-neg-in 97.3%

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

      6. fma-define 97.3%

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

      7. distribute-frac-neg2 97.3%

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

      8. +-commutative 97.3%

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

      9. distribute-neg-in 97.3%

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

      10. metadata-eval 97.3%

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

      11. unsub-neg 97.3%

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

   3. Simplified 97.3%

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

   5. Taylor expanded in x around -inf 100.0%

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

      1. associate-*r* 100.0%

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

      2. neg-mul-1 100.0%

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

      3. distribute-lft-out 100.0%

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

      4. associate-*r* 100.0%

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

      5. distribute-lft-neg-in 100.0%

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

      6. *-commutative 100.0%

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

      7. neg-mul-1 100.0%

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

      8. remove-double-neg 100.0%

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

      9. +-commutative 100.0%

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

      10. mul-1-neg 100.0%

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

      11. sub-neg 100.0%

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

      12. sub-neg 100.0%

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

      13. distribute-frac-neg2 100.0%

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

      14. distribute-neg-in 100.0%

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

      15. metadata-eval 100.0%

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

      16. sub-neg 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 99.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(1 - x\right) \cdot y}{1 + y}\\ \mathbf{if}\;t\_0 \leq 0.0002 \lor \neg \left(t\_0 \leq 2\right):\\ \;\;\;\;1 + \left(1 - x\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 (/ (* (- 1.0 x) y) (+ 1.0 y))))
   (if (or (<= t_0 0.0002) (not (<= t_0 2.0)))
     (+ 1.0 (* (- 1.0 x) (/ y (- -1.0 y))))
     (+ x (/ (- (/ -1.0 y) -1.0) y)))))

C

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

Python

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

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(1.0 - x) * y) / Float64(1.0 + y))
	tmp = 0.0
	if ((t_0 <= 0.0002) || !(t_0 <= 2.0))
		tmp = Float64(1.0 + Float64(Float64(1.0 - x) * 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 = ((1.0 - x) * y) / (1.0 + y);
	tmp = 0.0;
	if ((t_0 <= 0.0002) || ~((t_0 <= 2.0)))
		tmp = 1.0 + ((1.0 - x) * (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[(N[(1.0 - x), $MachinePrecision] * y), $MachinePrecision] / N[(1.0 + y), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 0.0002], N[Not[LessEqual[t$95$0, 2.0]], $MachinePrecision]], N[(1.0 + N[(N[(1.0 - x), $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))) < 2.0000000000000001e-4 or 2 < (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64)))

   1. Initial program 81.6%

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

   if 2.0000000000000001e-4 < (/.f64 (*.f64 (-.f64 #s(literal 1 binary64) x) y) (+.f64 y #s(literal 1 binary64))) < 2

   1. Initial program 7.9%

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

      1. associate-/l* 7.9%

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

      2. remove-double-neg 7.9%

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

      3. remove-double-neg 7.9%

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

      4. +-commutative 7.9%

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

   3. Simplified 7.9%

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

   5. Taylor expanded in y around -inf 99.9%

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

      1. mul-1-neg 99.9%

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

      2. unsub-neg 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in x around 0 99.9%

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

4. Final simplification 100.0%

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

Alternative 3: 98.2% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -1

   1. Initial program 20.9%

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

      1. associate-/l* 55.4%

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

      2. remove-double-neg 55.4%

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

      3. remove-double-neg 55.4%

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

      4. +-commutative 55.4%

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

   3. Simplified 55.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}{x + -1 \cdot \frac{-1 \cdot \frac{x - 1}{y} - -1 \cdot \left(x - 1\right)}{y}} \]
   6. Step-by-step derivation

      1. mul-1-neg 100.0%

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

      2. unsub-neg 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in y around inf 100.0%

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

   9. Taylor expanded in x around 0 100.0%

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

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

   if 1 < y

   1. Initial program 38.2%

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

      1. associate-/l* 59.2%

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

      2. remove-double-neg 59.2%

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

      3. remove-double-neg 59.2%

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

      4. +-commutative 59.2%

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

   3. Simplified 59.2%

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

   5. Taylor expanded in y around inf 99.2%

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

      1. associate--l+ 99.2%

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

      2. div-sub 99.2%

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

   7. Simplified 99.2%

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

4. Final simplification 98.6%

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

Alternative 4: 98.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -1

   1. Initial program 20.9%

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

      1. associate-/l* 55.4%

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

      2. remove-double-neg 55.4%

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

      3. remove-double-neg 55.4%

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

      4. +-commutative 55.4%

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

   3. Simplified 55.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}{x + -1 \cdot \frac{-1 \cdot \frac{x - 1}{y} - -1 \cdot \left(x - 1\right)}{y}} \]
   6. Step-by-step derivation

      1. mul-1-neg 100.0%

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

      2. unsub-neg 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in y around inf 100.0%

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

   9. Taylor expanded in x around 0 100.0%

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

   if -1 < y < 1.25

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

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

   6. Taylor expanded in x around inf 97.3%

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

      1. neg-mul-1 97.3%

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

   8. Simplified 97.3%

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

      1. cancel-sign-sub 97.3%

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

      2. +-commutative 97.3%

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

   10. Applied egg-rr 97.3%

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

   if 1.25 < y

   1. Initial program 38.2%

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

      1. associate-/l* 59.2%

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

      2. remove-double-neg 59.2%

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

      3. remove-double-neg 59.2%

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

      4. +-commutative 59.2%

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

   3. Simplified 59.2%

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

   5. Taylor expanded in y around inf 99.2%

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

      1. associate--l+ 99.2%

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

      2. div-sub 99.2%

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

   7. Simplified 99.2%

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

4. Final simplification 98.5%

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

Alternative 5: 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 + x \cdot y\\ \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 (* x y))))

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 + (x * y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1.0d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = x + (1.0d0 / y)
    else
        tmp = 1.0d0 + (x * y)
    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 + (x * y);
	}
	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 + (x * y)
	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(x * y));
	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 + (x * y);
	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[(x * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 30.3%

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

      1. associate-/l* 57.4%

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

      2. remove-double-neg 57.4%

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

      3. remove-double-neg 57.4%

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

      4. +-commutative 57.4%

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

   3. Simplified 57.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}{x + -1 \cdot \frac{-1 \cdot \frac{x - 1}{y} - -1 \cdot \left(x - 1\right)}{y}} \]
   6. Step-by-step derivation

      1. mul-1-neg 100.0%

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

      2. unsub-neg 100.0%

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

   7. Simplified 100.0%

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

   8. Taylor expanded in y around inf 99.6%

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

   9. Taylor expanded in x around 0 99.3%

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

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

   6. Taylor expanded in x around inf 97.3%

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

      1. neg-mul-1 97.3%

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

   8. Simplified 97.3%

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

      1. cancel-sign-sub 97.3%

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

      2. +-commutative 97.3%

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

   10. Applied egg-rr 97.3%

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

4. Final simplification 98.3%

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

Alternative 6: 86.3% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.0) x (if (<= y 112.0) (+ 1.0 (* x y)) x)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 112.0) {
		tmp = 1.0 + (x * 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 <= 112.0d0) then
        tmp = 1.0d0 + (x * 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 <= 112.0) {
		tmp = 1.0 + (x * y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 112.0)
		tmp = Float64(1.0 + Float64(x * 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 <= 112.0)
		tmp = 1.0 + (x * y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 112 < y

   1. Initial program 30.3%

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

      1. associate-/l* 57.4%

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

      2. remove-double-neg 57.4%

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

      3. remove-double-neg 57.4%

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

      4. +-commutative 57.4%

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

   3. Simplified 57.4%

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

   5. Taylor expanded in y around inf 74.8%

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

   if -1 < y < 112

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

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

   6. Taylor expanded in x around inf 97.3%

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

      1. neg-mul-1 97.3%

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

   8. Simplified 97.3%

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

      1. cancel-sign-sub 97.3%

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

      2. +-commutative 97.3%

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

   10. Applied egg-rr 97.3%

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

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 112:\\ \;\;\;\;1 + x \cdot y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 74.4% accurate, 0.8× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 0.00175) {
		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.00175d0) 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.00175) {
		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.00175:
		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.00175)
		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.00175)
		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.00175], N[(1.0 - y), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.00175000000000000004 < y

   1. Initial program 30.8%

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

      1. associate-/l* 57.8%

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

      2. remove-double-neg 57.8%

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

      3. remove-double-neg 57.8%

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

      4. +-commutative 57.8%

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

   3. Simplified 57.8%

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

   5. Taylor expanded in y around inf 74.3%

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

   if -1 < y < 0.00175000000000000004

   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.3%

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

   6. Taylor expanded in x around 0 76.3%

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

Alternative 8: 74.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.0)
		tmp = x;
	elseif (y <= 0.016)
		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 <= 0.016)
		tmp = 1.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.0], x, If[LessEqual[y, 0.016], 1.0, x]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.016 < y

   1. Initial program 30.8%

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

      1. associate-/l* 57.8%

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

      2. remove-double-neg 57.8%

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

      3. remove-double-neg 57.8%

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

      4. +-commutative 57.8%

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

   3. Simplified 57.8%

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

   5. Taylor expanded in y around inf 74.3%

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

   if -1 < y < 0.016

   1. Initial program 100.0%

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

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. *-commutative 100.0%

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

      4. associate-/l* 100.0%

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

      5. distribute-rgt-neg-in 100.0%

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

      6. fma-define 100.0%

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

      7. distribute-frac-neg2 100.0%

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

      8. +-commutative 100.0%

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

      9. distribute-neg-in 100.0%

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

      10. metadata-eval 100.0%

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

      11. unsub-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around -inf 99.8%

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

      1. associate-*r* 99.8%

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

      2. neg-mul-1 99.8%

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

      3. distribute-lft-out 99.8%

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

      4. associate-*r* 99.8%

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

      5. distribute-lft-neg-in 99.8%

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

      6. *-commutative 99.8%

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

      7. neg-mul-1 99.8%

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

      8. remove-double-neg 99.8%

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

      9. +-commutative 99.8%

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

      10. mul-1-neg 99.8%

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

      11. sub-neg 99.8%

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

      12. sub-neg 99.8%

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

      13. distribute-frac-neg2 99.8%

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

      14. distribute-neg-in 99.8%

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

      15. metadata-eval 99.8%

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

      16. sub-neg 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in y around 0 75.9%

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

Alternative 9: 38.9% 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 64.1%

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

   1. sub-neg 64.1%

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

   2. +-commutative 64.1%

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

   3. *-commutative 64.1%

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

   4. associate-/l* 78.1%

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

   5. distribute-rgt-neg-in 78.1%

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

   6. fma-define 78.0%

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

   7. distribute-frac-neg2 78.0%

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

   8. +-commutative 78.0%

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

   9. distribute-neg-in 78.0%

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

   10. metadata-eval 78.0%

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

   11. unsub-neg 78.0%

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

3. Simplified 78.0%

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

5. Taylor expanded in x around -inf 87.3%

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

   1. associate-*r* 87.3%

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

   2. neg-mul-1 87.3%

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

   3. distribute-lft-out 87.3%

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

   4. associate-*r* 87.3%

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

   5. distribute-lft-neg-in 87.3%

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

   6. *-commutative 87.3%

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

   7. neg-mul-1 87.3%

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

   8. remove-double-neg 87.3%

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

   9. +-commutative 87.3%

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

   10. mul-1-neg 87.3%

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

   11. sub-neg 87.3%

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

   12. sub-neg 87.3%

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

   13. distribute-frac-neg2 87.3%

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

   14. distribute-neg-in 87.3%

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

   15. metadata-eval 87.3%

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

   16. sub-neg 87.3%

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

7. Simplified 87.3%

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

8. Taylor expanded in y around 0 38.4%

   \[\leadsto \color{blue}{1} \]
9. 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 2024144 
(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))))