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

Percentage Accurate: 65.6% → 100.0%

Time: 8.9s

Alternatives: 13

Speedup: 1.2×

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.6% 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: 100.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + \frac{1 - \mathsf{fma}\left(\frac{x + -1}{y}, -1 + \frac{1}{y}, x\right)}{y}\\ \mathbf{if}\;y \leq -12500:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 13000:\\ \;\;\;\;1 + \frac{y \cdot \left(1 - x\right)}{-1 - y}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ x (/ (- 1.0 (fma (/ (+ x -1.0) y) (+ -1.0 (/ 1.0 y)) x)) y))))
   (if (<= y -12500.0)
     t_0
     (if (<= y 13000.0) (+ 1.0 (/ (* y (- 1.0 x)) (- -1.0 y))) t_0))))

C

double code(double x, double y) {
	double t_0 = x + ((1.0 - fma(((x + -1.0) / y), (-1.0 + (1.0 / y)), x)) / y);
	double tmp;
	if (y <= -12500.0) {
		tmp = t_0;
	} else if (y <= 13000.0) {
		tmp = 1.0 + ((y * (1.0 - x)) / (-1.0 - y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -12500 or 13000 < y

   1. Initial program 30.3%

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

   3. Taylor expanded in y around -inf

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

   5. Simplified 100.0%

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

   if -12500 < y < 13000

   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 -12500:\\ \;\;\;\;x + \frac{1 - \mathsf{fma}\left(\frac{x + -1}{y}, -1 + \frac{1}{y}, x\right)}{y}\\ \mathbf{elif}\;y \leq 13000:\\ \;\;\;\;1 + \frac{y \cdot \left(1 - x\right)}{-1 - y}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{1 - \mathsf{fma}\left(\frac{x + -1}{y}, -1 + \frac{1}{y}, x\right)}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 73.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y \cdot \left(1 - x\right)}{y + 1}\\ \mathbf{if}\;t\_0 \leq -1000000000:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_0 \leq 0.2:\\ \;\;\;\;\mathsf{fma}\left(y, y, 1\right) - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* y (- 1.0 x)) (+ y 1.0))))
   (if (<= t_0 -1000000000.0) x (if (<= t_0 0.2) (- (fma y y 1.0) y) x))))

C

double code(double x, double y) {
	double t_0 = (y * (1.0 - x)) / (y + 1.0);
	double tmp;
	if (t_0 <= -1000000000.0) {
		tmp = x;
	} else if (t_0 <= 0.2) {
		tmp = fma(y, y, 1.0) - y;
	} else {
		tmp = x;
	}
	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 <= -1000000000.0)
		tmp = x;
	elseif (t_0 <= 0.2)
		tmp = Float64(fma(y, y, 1.0) - y);
	else
		tmp = x;
	end
	return 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[LessEqual[t$95$0, -1000000000.0], x, If[LessEqual[t$95$0, 0.2], N[(N[(y * y + 1.0), $MachinePrecision] - y), $MachinePrecision], x]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 44.0%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-lft-identity N/A

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

      6. cancel-sign-sub-inv N/A

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

      7. metadata-eval N/A

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

      8. neg-mul-1 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/l* N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied egg-rr 67.3%

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

   5. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. associate--r- N/A

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

      4. metadata-eval N/A

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

      5. +-lft-identity 59.4

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

   7. Simplified 59.4%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. lower-+.f64 99.7

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

   5. Simplified 99.7%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. *-lft-identity N/A

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

      4. cancel-sign-sub-inv N/A

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

      5. metadata-eval N/A

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

      6. neg-mul-1 N/A

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

      7. +-commutative N/A

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

      8. lift-/.f64 N/A

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

      9. clear-num N/A

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

      10. associate-/r/ N/A

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

      11. distribute-lft-neg-in N/A

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

      12. neg-mul-1 N/A

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

      13. metadata-eval N/A

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

      14. inv-pow N/A

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

      15. unpow-prod-down N/A

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

      16. neg-mul-1 N/A

          \[\leadsto {\color{blue}{\left(\mathsf{neg}\left(\left(1 + y\right)\right)\right)}}^{-1} \cdot y + 1 \]

      17. lift-+.f64 N/A

          \[\leadsto {\left(\mathsf{neg}\left(\color{blue}{\left(1 + y\right)}\right)\right)}^{-1} \cdot y + 1 \]

      18. distribute-neg-in N/A

          \[\leadsto {\color{blue}{\left(\left(\mathsf{neg}\left(1\right)\right) + \left(\mathsf{neg}\left(y\right)\right)\right)}}^{-1} \cdot y + 1 \]

      19. metadata-eval N/A

          \[\leadsto {\left(\color{blue}{-1} + \left(\mathsf{neg}\left(y\right)\right)\right)}^{-1} \cdot y + 1 \]

      20. sub-neg N/A

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

      21. lift--.f64 N/A

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

      22. inv-pow N/A

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

      23. lower-fma.f64 N/A

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

   7. Applied egg-rr 99.7%

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

   8. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. sub-neg N/A

         \[\leadsto y \cdot \color{blue}{\left(y + \left(\mathsf{neg}\left(1\right)\right)\right)} + 1 \]

      3. metadata-eval N/A

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

      4. +-commutative N/A

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

      5. distribute-rgt-in N/A

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

      6. unpow2 N/A

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

      7. associate-+l+ N/A

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

      8. +-commutative N/A

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

      9. mul-1-neg N/A

         \[\leadsto \left({y}^{2} + 1\right) + \color{blue}{\left(\mathsf{neg}\left(y\right)\right)} \]

      10. sub-neg N/A

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

      11. lower--.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-fma.f64 99.0

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

   10. Simplified 99.0%

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

4. Final simplification 75.3%

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

Alternative 3: 73.5% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double t_0 = (y * (1.0 - x)) / (y + 1.0);
	double tmp;
	if (t_0 <= -1000000000.0) {
		tmp = x;
	} else if (t_0 <= 0.2) {
		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) :: t_0
    real(8) :: tmp
    t_0 = (y * (1.0d0 - x)) / (y + 1.0d0)
    if (t_0 <= (-1000000000.0d0)) then
        tmp = x
    else if (t_0 <= 0.2d0) then
        tmp = 1.0d0 - y
    else
        tmp = x
    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 <= -1000000000.0) {
		tmp = x;
	} else if (t_0 <= 0.2) {
		tmp = 1.0 - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (y * (1.0 - x)) / (y + 1.0)
	tmp = 0
	if t_0 <= -1000000000.0:
		tmp = x
	elif t_0 <= 0.2:
		tmp = 1.0 - y
	else:
		tmp = x
	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 <= -1000000000.0)
		tmp = x;
	elseif (t_0 <= 0.2)
		tmp = Float64(1.0 - y);
	else
		tmp = x;
	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 <= -1000000000.0)
		tmp = x;
	elseif (t_0 <= 0.2)
		tmp = 1.0 - y;
	else
		tmp = x;
	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[LessEqual[t$95$0, -1000000000.0], x, If[LessEqual[t$95$0, 0.2], N[(1.0 - y), $MachinePrecision], x]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 44.0%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-lft-identity N/A

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

      6. cancel-sign-sub-inv N/A

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

      7. metadata-eval N/A

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

      8. neg-mul-1 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/l* N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied egg-rr 67.3%

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

   5. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. associate--r- N/A

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

      4. metadata-eval N/A

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

      5. +-lft-identity 59.4

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

   7. Simplified 59.4%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sub-neg N/A

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

      4. metadata-eval N/A

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

      5. lower-+.f64 99.3

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

   5. Simplified 99.3%

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

   6. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

         \[\leadsto 1 + \color{blue}{\left(\mathsf{neg}\left(y\right)\right)} \]

      2. unsub-neg N/A

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

      3. lower--.f64 98.9

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

   8. Simplified 98.9%

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

4. Final simplification 75.3%

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

Alternative 4: 73.3% accurate, 0.5× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double t_0 = (y * (1.0 - x)) / (y + 1.0);
	double tmp;
	if (t_0 <= -1000000000.0) {
		tmp = x;
	} else if (t_0 <= 0.2) {
		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) :: t_0
    real(8) :: tmp
    t_0 = (y * (1.0d0 - x)) / (y + 1.0d0)
    if (t_0 <= (-1000000000.0d0)) then
        tmp = x
    else if (t_0 <= 0.2d0) then
        tmp = 1.0d0
    else
        tmp = x
    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 <= -1000000000.0) {
		tmp = x;
	} else if (t_0 <= 0.2) {
		tmp = 1.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (y * (1.0 - x)) / (y + 1.0)
	tmp = 0
	if t_0 <= -1000000000.0:
		tmp = x
	elif t_0 <= 0.2:
		tmp = 1.0
	else:
		tmp = x
	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 <= -1000000000.0)
		tmp = x;
	elseif (t_0 <= 0.2)
		tmp = 1.0;
	else
		tmp = x;
	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 <= -1000000000.0)
		tmp = x;
	elseif (t_0 <= 0.2)
		tmp = 1.0;
	else
		tmp = x;
	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[LessEqual[t$95$0, -1000000000.0], x, If[LessEqual[t$95$0, 0.2], 1.0, x]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 44.0%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-lft-identity N/A

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

      6. cancel-sign-sub-inv N/A

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

      7. metadata-eval N/A

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

      8. neg-mul-1 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/l* N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied egg-rr 67.3%

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

   5. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. associate--r- N/A

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

      4. metadata-eval N/A

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

      5. +-lft-identity 59.4

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

   7. Simplified 59.4%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{1} \]
   4. Step-by-step derivation

   5. Simplified 98.4%

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

4. Final simplification 75.1%

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

Alternative 5: 99.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\frac{x + -1}{y}, -1 + \frac{1}{y}, x\right)\\ \mathbf{if}\;y \leq -140000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 290000:\\ \;\;\;\;1 + \frac{y \cdot \left(1 - x\right)}{-1 - y}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (fma (/ (+ x -1.0) y) (+ -1.0 (/ 1.0 y)) x)))
   (if (<= y -140000.0)
     t_0
     (if (<= y 290000.0) (+ 1.0 (/ (* y (- 1.0 x)) (- -1.0 y))) t_0))))

C

double code(double x, double y) {
	double t_0 = fma(((x + -1.0) / y), (-1.0 + (1.0 / y)), x);
	double tmp;
	if (y <= -140000.0) {
		tmp = t_0;
	} else if (y <= 290000.0) {
		tmp = 1.0 + ((y * (1.0 - x)) / (-1.0 - y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.4e5 or 2.9e5 < y

   1. Initial program 30.3%

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

   3. Taylor expanded in y around inf

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

      1. associate--l+ N/A

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

      2. +-commutative N/A

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

   5. Simplified 99.9%

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

   if -1.4e5 < y < 2.9e5

   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 -140000:\\ \;\;\;\;\mathsf{fma}\left(\frac{x + -1}{y}, -1 + \frac{1}{y}, x\right)\\ \mathbf{elif}\;y \leq 290000:\\ \;\;\;\;1 + \frac{y \cdot \left(1 - x\right)}{-1 - y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x + -1}{y}, -1 + \frac{1}{y}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 99.7% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -7e9 or 5.8e10 < y

   1. Initial program 28.9%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. unsub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. mul-1-neg N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

      15. +-commutative N/A

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

      16. sub-neg N/A

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

      17. lower--.f64 99.6

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

   5. Simplified 99.6%

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

   6. Taylor expanded in x around 0

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

      1. lower-/.f64 99.6

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

   8. Simplified 99.6%

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

   if -7e9 < y < 5.8e10

   1. Initial program 99.2%

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

4. Final simplification 99.4%

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

Alternative 7: 99.7% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -145000000.0)
   (+ x (/ (- 1.0 x) y))
   (if (<= y 50000000000.0)
     (fma y (/ (- 1.0 x) (- -1.0 y)) 1.0)
     (+ x (/ 1.0 y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -145000000.0) {
		tmp = x + ((1.0 - x) / y);
	} else if (y <= 50000000000.0) {
		tmp = fma(y, ((1.0 - x) / (-1.0 - y)), 1.0);
	} else {
		tmp = x + (1.0 / y);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -1.45e8

   1. Initial program 29.6%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. unsub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. mul-1-neg N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

      15. +-commutative N/A

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

      16. sub-neg N/A

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

      17. lower--.f64 99.5

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

   5. Simplified 99.5%

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

   if -1.45e8 < y < 5e10

   1. Initial program 99.2%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-lft-identity N/A

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

      6. cancel-sign-sub-inv N/A

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

      7. metadata-eval N/A

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

      8. neg-mul-1 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/l* N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied egg-rr 99.2%

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

   if 5e10 < y

   1. Initial program 29.4%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. unsub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. mul-1-neg N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

      15. +-commutative N/A

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

      16. sub-neg N/A

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

      17. lower--.f64 99.7

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

   5. Simplified 99.7%

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

   6. Taylor expanded in x around 0

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

      1. lower-/.f64 99.7

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

   8. Simplified 99.7%

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

Alternative 8: 98.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -1

   1. Initial program 30.6%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. unsub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. mul-1-neg N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

      15. +-commutative N/A

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

      16. sub-neg N/A

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

      17. lower--.f64 98.2

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

   5. Simplified 98.2%

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

   if -1 < y < 0.849999999999999978

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

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

      3. associate--l+ N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. *-rgt-identity N/A

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

      7. metadata-eval N/A

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

      8. distribute-rgt-neg-in N/A

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

      9. distribute-lft-neg-in N/A

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

      10. distribute-rgt-neg-out N/A

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

      11. neg-sub0 N/A

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

      12. associate-+l- N/A

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

      13. neg-sub0 N/A

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

      14. +-commutative N/A

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

      15. sub-neg N/A

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

      16. distribute-lft-out N/A

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

      17. lower-fma.f64 N/A

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

   5. Simplified 98.9%

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

   if 0.849999999999999978 < y

   1. Initial program 31.2%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. unsub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. mul-1-neg N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

      15. +-commutative N/A

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

      16. sub-neg N/A

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

      17. lower--.f64 97.4

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

   5. Simplified 97.4%

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

   6. Taylor expanded in x around 0

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

      1. lower-/.f64 97.7

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

   8. Simplified 97.7%

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

Alternative 9: 98.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -1

   1. Initial program 30.6%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. unsub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. mul-1-neg N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

      15. +-commutative N/A

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

      16. sub-neg N/A

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

      17. lower--.f64 98.2

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

   5. Simplified 98.2%

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

   if -1 < y < 0.900000000000000022

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sub-neg N/A

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

      4. metadata-eval N/A

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

      5. lower-+.f64 98.0

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

   5. Simplified 98.0%

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

   if 0.900000000000000022 < y

   1. Initial program 30.0%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. unsub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. mul-1-neg N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

      15. +-commutative N/A

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

      16. sub-neg N/A

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

      17. lower--.f64 99.0

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

   5. Simplified 99.0%

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

   6. Taylor expanded in x around 0

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

      1. lower-/.f64 99.0

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

   8. Simplified 99.0%

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

Alternative 10: 98.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + \frac{1}{y}\\ \mathbf{if}\;y \leq -1:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 0.9:\\ \;\;\;\;\mathsf{fma}\left(y, x + -1, 1\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

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

C

double code(double x, double y) {
	double t_0 = x + (1.0 / y);
	double tmp;
	if (y <= -1.0) {
		tmp = t_0;
	} else if (y <= 0.9) {
		tmp = fma(y, (x + -1.0), 1.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.900000000000000022 < y

   1. Initial program 30.3%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. +-commutative N/A

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

      4. associate--r- N/A

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

      5. div-sub N/A

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

      6. unsub-neg N/A

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

      7. mul-1-neg N/A

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

      8. lower-+.f64 N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. mul-1-neg N/A

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

      12. neg-sub0 N/A

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

      13. associate-+l- N/A

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

      14. neg-sub0 N/A

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

      15. +-commutative N/A

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

      16. sub-neg N/A

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

      17. lower--.f64 98.6

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

   5. Simplified 98.6%

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

   6. Taylor expanded in x around 0

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

      1. lower-/.f64 98.3

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

   8. Simplified 98.3%

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

   if -1 < y < 0.900000000000000022

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sub-neg N/A

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

      4. metadata-eval N/A

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

      5. lower-+.f64 98.0

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

   5. Simplified 98.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + -1, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 86.1% accurate, 1.2× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.0) {
		tmp = x;
	} else if (y <= 1.0) {
		tmp = fma(y, (x + -1.0), 1.0);
	} else {
		tmp = x;
	}
	return tmp;
}

Julia

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

Wolfram

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

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. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-lft-identity N/A

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

      6. cancel-sign-sub-inv N/A

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

      7. metadata-eval N/A

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

      8. neg-mul-1 N/A

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

      9. +-commutative N/A

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

      10. lift-/.f64 N/A

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

      11. distribute-neg-frac2 N/A

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. associate-/l* N/A

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

      15. lower-fma.f64 N/A

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

   4. Applied egg-rr 59.3%

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

   5. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. associate--r- N/A

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

      4. metadata-eval N/A

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

      5. +-lft-identity 72.8

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

   7. Simplified 72.8%

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

   if -1 < y < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sub-neg N/A

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

      4. metadata-eval N/A

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

      5. lower-+.f64 98.0

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

   5. Simplified 98.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + -1, 1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 38.5% accurate, 26.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 66.5%

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

3. Taylor expanded in y around 0

   \[\leadsto \color{blue}{1} \]
4. Step-by-step derivation

5. Simplified 41.8%

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

Alternative 13: 3.1% accurate, 26.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 0.0)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 0.0

Julia

function code(x, y)
	return 0.0
end

MATLAB

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

Wolfram

code[x_, y_] := 0.0

Derivation

1. Initial program 66.5%

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

3. Taylor expanded in x around 0

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

   1. lower-/.f64 N/A

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

   2. lower-+.f64 43.0

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

5. Simplified 43.0%

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

6. Taylor expanded in y around inf

   \[\leadsto 1 - \color{blue}{1} \]
7. Step-by-step derivation

8. Simplified 3.0%

   \[\leadsto 1 - \color{blue}{1} \]
9. Step-by-step derivation

   1. metadata-eval 3.0

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

10. Applied egg-rr 3.0%

    \[\leadsto \color{blue}{0} \]
11. Add Preprocessing

Developer Target 1: 99.7% accurate, 0.6× 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 2024207 
(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))))