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

Percentage Accurate: 66.8% → 99.8%

Time: 10.9s

Alternatives: 9

Speedup: 2.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 66.8% 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.8% accurate, 0.5× 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 -1300000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 260000:\\ \;\;\;\;\mathsf{fma}\left(\frac{-1}{\mathsf{fma}\left(y, y, -1\right)}, \left(1 - x\right) \cdot \left(y \cdot \left(y + -1\right)\right), 1\right)\\ \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 -1300000000.0)
     t_0
     (if (<= y 260000.0)
       (fma (/ -1.0 (fma y y -1.0)) (* (- 1.0 x) (* y (+ y -1.0))) 1.0)
       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 <= -1300000000.0) {
		tmp = t_0;
	} else if (y <= 260000.0) {
		tmp = fma((-1.0 / fma(y, y, -1.0)), ((1.0 - x) * (y * (y + -1.0))), 1.0);
	} 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 <= -1300000000.0)
		tmp = t_0;
	elseif (y <= 260000.0)
		tmp = fma(Float64(-1.0 / fma(y, y, -1.0)), Float64(Float64(1.0 - x) * Float64(y * Float64(y + -1.0))), 1.0);
	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, -1300000000.0], t$95$0, If[LessEqual[y, 260000.0], N[(N[(-1.0 / N[(y * y + -1.0), $MachinePrecision]), $MachinePrecision] * N[(N[(1.0 - x), $MachinePrecision] * N[(y * N[(y + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.3e9 or 2.6e5 < y

   1. Initial program 27.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 + \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 100.0%

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

   if -1.3e9 < y < 2.6e5

   1. Initial program 99.9%

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. clear-num N/A

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

      4. distribute-neg-frac N/A

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

      5. metadata-eval N/A

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

      6. flip-+ N/A

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

      7. associate-/l/ N/A

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

      8. associate-/r/ N/A

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

      9. accelerator-lowering-fma.f64 N/A

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

   4. Applied egg-rr 99.9%

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

4. Final simplification 100.0%

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

Alternative 2: 99.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1300000000:\\ \;\;\;\;\mathsf{fma}\left(\frac{x + -1}{y}, -1 + \frac{1}{y}, x\right)\\ \mathbf{elif}\;y \leq 85000000000:\\ \;\;\;\;\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 -1300000000.0)
   (fma (/ (+ x -1.0) y) (+ -1.0 (/ 1.0 y)) x)
   (if (<= y 85000000000.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 <= -1300000000.0) {
		tmp = fma(((x + -1.0) / y), (-1.0 + (1.0 / y)), x);
	} else if (y <= 85000000000.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 <= -1300000000.0)
		tmp = fma(Float64(Float64(x + -1.0) / y), Float64(-1.0 + Float64(1.0 / y)), x);
	elseif (y <= 85000000000.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, -1300000000.0], N[(N[(N[(x + -1.0), $MachinePrecision] / y), $MachinePrecision] * N[(-1.0 + N[(1.0 / y), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[y, 85000000000.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.3e9

   1. Initial program 32.5%

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

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

   if -1.3e9 < y < 8.5e10

   1. Initial program 99.9%

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. distribute-neg-frac2 N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. --lowering--.f64 N/A

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

      9. +-commutative N/A

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

      10. distribute-neg-in N/A

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

      11. metadata-eval N/A

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

      12. unsub-neg N/A

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

      13. --lowering--.f64 99.9

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

   4. Applied egg-rr 99.9%

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

   if 8.5e10 < y

   1. Initial program 20.7%

      \[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. --lowering--.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. +-lowering-+.f64 100.0

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

   5. Simplified 100.0%

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

   6. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 100.0

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

   8. Simplified 100.0%

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

4. Final simplification 99.9%

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

Alternative 3: 99.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x - \frac{-1}{y}\\ \mathbf{if}\;y \leq -23500000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 42000000000:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{1 - x}{-1 - y}, 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 -23500000000.0)
     t_0
     (if (<= y 42000000000.0) (fma y (/ (- 1.0 x) (- -1.0 y)) 1.0) t_0))))

C

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

Derivation

1. Split input into 2 regimes

2. if y < -2.35e10 or 4.2e10 < y

   1. Initial program 27.1%

      \[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. --lowering--.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. +-lowering-+.f64 99.6

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

   5. Simplified 99.6%

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

   6. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 99.6

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

   8. Simplified 99.6%

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

   if -2.35e10 < y < 4.2e10

   1. Initial program 99.9%

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. distribute-neg-frac2 N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. accelerator-lowering-fma.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. --lowering--.f64 N/A

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

      9. +-commutative N/A

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

      10. distribute-neg-in N/A

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

      11. metadata-eval N/A

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

      12. unsub-neg N/A

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

      13. --lowering--.f64 99.9

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

   4. Applied egg-rr 99.9%

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

Alternative 4: 98.7% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 29.1%

      \[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. --lowering--.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. +-lowering-+.f64 98.4

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

   5. Simplified 98.4%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. 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. accelerator-lowering-fma.f64 N/A

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

   5. Simplified 99.5%

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

      1. +-rgt-identity N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. *-lowering-*.f64 N/A

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

      7. +-lowering-+.f64 99.5

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

   7. Applied egg-rr 99.5%

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

Alternative 5: 98.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x - \frac{x + -1}{y}\\ \mathbf{if}\;y \leq -1:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;\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 (/ (+ x -1.0) y))))
   (if (<= y -1.0) t_0 (if (<= y 1.0) (fma y (+ x -1.0) 1.0) t_0))))

C

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

Julia

function code(x, y)
	t_0 = Float64(x - Float64(Float64(x + -1.0) / y))
	tmp = 0.0
	if (y <= -1.0)
		tmp = t_0;
	elseif (y <= 1.0)
		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[(N[(x + -1.0), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.0], t$95$0, If[LessEqual[y, 1.0], 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 1 < y

   1. Initial program 29.1%

      \[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. --lowering--.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. +-lowering-+.f64 98.4

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

   5. Simplified 98.4%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[1 - \frac{\left(1 - x\right) \cdot y}{y + 1} \]
   2. 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. accelerator-lowering-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. +-lowering-+.f64 99.2

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

   5. Simplified 99.2%

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

Alternative 6: 98.1% 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.8:\\ \;\;\;\;\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.8) (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.8) {
		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.8)
		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.8], 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.80000000000000004 < y

   1. Initial program 29.1%

      \[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. --lowering--.f64 N/A

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

      7. /-lowering-/.f64 N/A

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

      8. sub-neg N/A

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

      9. metadata-eval N/A

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

      10. +-lowering-+.f64 98.4

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

   5. Simplified 98.4%

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

   6. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 97.9

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

   8. Simplified 97.9%

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

   if -1 < y < 0.80000000000000004

   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. accelerator-lowering-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. +-lowering-+.f64 99.2

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

   5. Simplified 99.2%

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

Alternative 7: 86.0% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 120 < y

   1. Initial program 28.6%

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

   3. Taylor expanded in y around inf

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

   5. Simplified 71.8%

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

   if -1 < y < 120

   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. accelerator-lowering-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. +-lowering-+.f64 98.4

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

   5. Simplified 98.4%

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

   6. Taylor expanded in x around inf

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

   8. Simplified 98.5%

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

Alternative 8: 73.9% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1 or 8 < y

   1. Initial program 28.6%

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

   3. Taylor expanded in y around inf

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

   5. Simplified 71.8%

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

   if -1 < y < 8

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

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

Alternative 9: 39.1% 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 61.8%

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

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

Developer Target 1: 99.6% 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 2024195 
(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))))