Linear.Projection:perspective from linear-1.19.1.3, B

Percentage Accurate: 77.2% → 99.9%

Time: 6.6s

Alternatives: 7

Speedup: 0.7×

Specification

Math

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

FPCore

(FPCore (x y) :precision binary64 (/ (* (* x 2.0) y) (- x y)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 77.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (/ (* (* x 2.0) y) (- x y)))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x \cdot 2}{\frac{x - y}{y}}\\ \mathbf{if}\;y \leq -2 \cdot 10^{+37}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 3.5 \cdot 10^{-18}:\\ \;\;\;\;\frac{x}{x - y} \cdot \left(2 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* x 2.0) (/ (- x y) y))))
   (if (<= y -2e+37) t_0 (if (<= y 3.5e-18) (* (/ x (- x y)) (* 2.0 y)) t_0))))

C

double code(double x, double y) {
	double t_0 = (x * 2.0) / ((x - y) / y);
	double tmp;
	if (y <= -2e+37) {
		tmp = t_0;
	} else if (y <= 3.5e-18) {
		tmp = (x / (x - y)) * (2.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 * 2.0d0) / ((x - y) / y)
    if (y <= (-2d+37)) then
        tmp = t_0
    else if (y <= 3.5d-18) then
        tmp = (x / (x - y)) * (2.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 * 2.0) / ((x - y) / y);
	double tmp;
	if (y <= -2e+37) {
		tmp = t_0;
	} else if (y <= 3.5e-18) {
		tmp = (x / (x - y)) * (2.0 * y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (x * 2.0) / ((x - y) / y)
	tmp = 0
	if y <= -2e+37:
		tmp = t_0
	elif y <= 3.5e-18:
		tmp = (x / (x - y)) * (2.0 * y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(x * 2.0) / Float64(Float64(x - y) / y))
	tmp = 0.0
	if (y <= -2e+37)
		tmp = t_0;
	elseif (y <= 3.5e-18)
		tmp = Float64(Float64(x / Float64(x - y)) * Float64(2.0 * y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (x * 2.0) / ((x - y) / y);
	tmp = 0.0;
	if (y <= -2e+37)
		tmp = t_0;
	elseif (y <= 3.5e-18)
		tmp = (x / (x - y)) * (2.0 * y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(x * 2.0), $MachinePrecision] / N[(N[(x - y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2e+37], t$95$0, If[LessEqual[y, 3.5e-18], N[(N[(x / N[(x - y), $MachinePrecision]), $MachinePrecision] * N[(2.0 * y), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.99999999999999991e37 or 3.4999999999999999e-18 < y

   1. Initial program 75.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 100.0

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

   4. Applied rewrites 100.0%

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

   if -1.99999999999999991e37 < y < 3.4999999999999999e-18

   1. Initial program 73.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

4. Final simplification 100.0%

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

Alternative 2: 74.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\frac{2}{x}, y, 2\right) \cdot y\\ \mathbf{if}\;y \leq -9.2 \cdot 10^{+25}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{elif}\;y \leq -1.1 \cdot 10^{-152}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq -3.1 \cdot 10^{-173}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, x, x\right) \cdot -2\\ \mathbf{elif}\;y \leq 2.2 \cdot 10^{+36}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (fma (/ 2.0 x) y 2.0) y)))
   (if (<= y -9.2e+25)
     (* -2.0 x)
     (if (<= y -1.1e-152)
       t_0
       (if (<= y -3.1e-173)
         (* (fma (/ x y) x x) -2.0)
         (if (<= y 2.2e+36) t_0 (* -2.0 x)))))))

C

double code(double x, double y) {
	double t_0 = fma((2.0 / x), y, 2.0) * y;
	double tmp;
	if (y <= -9.2e+25) {
		tmp = -2.0 * x;
	} else if (y <= -1.1e-152) {
		tmp = t_0;
	} else if (y <= -3.1e-173) {
		tmp = fma((x / y), x, x) * -2.0;
	} else if (y <= 2.2e+36) {
		tmp = t_0;
	} else {
		tmp = -2.0 * x;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(fma(Float64(2.0 / x), y, 2.0) * y)
	tmp = 0.0
	if (y <= -9.2e+25)
		tmp = Float64(-2.0 * x);
	elseif (y <= -1.1e-152)
		tmp = t_0;
	elseif (y <= -3.1e-173)
		tmp = Float64(fma(Float64(x / y), x, x) * -2.0);
	elseif (y <= 2.2e+36)
		tmp = t_0;
	else
		tmp = Float64(-2.0 * x);
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(2.0 / x), $MachinePrecision] * y + 2.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -9.2e+25], N[(-2.0 * x), $MachinePrecision], If[LessEqual[y, -1.1e-152], t$95$0, If[LessEqual[y, -3.1e-173], N[(N[(N[(x / y), $MachinePrecision] * x + x), $MachinePrecision] * -2.0), $MachinePrecision], If[LessEqual[y, 2.2e+36], t$95$0, N[(-2.0 * x), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -9.1999999999999992e25 or 2.2e36 < y

   1. Initial program 73.4%

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

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 81.3

         \[\leadsto \color{blue}{-2 \cdot x} \]

   5. Applied rewrites 81.3%

      \[\leadsto \color{blue}{-2 \cdot x} \]

   if -9.1999999999999992e25 < y < -1.09999999999999992e-152 or -3.10000000000000005e-173 < y < 2.2e36

   1. Initial program 78.4%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. *-lft-identity N/A

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

      4. associate-*l/ N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 81.1

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

   5. Applied rewrites 81.1%

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

   if -1.09999999999999992e-152 < y < -3.10000000000000005e-173

   1. Initial program 6.0%

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

   3. Taylor expanded in y around inf

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

      1. distribute-lft-out N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. +-commutative N/A

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

      5. unpow2 N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 100.0

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

   5. Applied rewrites 100.0%

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

Alternative 3: 74.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\frac{2}{x}, y, 2\right) \cdot y\\ \mathbf{if}\;y \leq -9.2 \cdot 10^{+25}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{elif}\;y \leq -1.1 \cdot 10^{-152}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq -3.1 \cdot 10^{-173}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{elif}\;y \leq 2.2 \cdot 10^{+36}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (fma (/ 2.0 x) y 2.0) y)))
   (if (<= y -9.2e+25)
     (* -2.0 x)
     (if (<= y -1.1e-152)
       t_0
       (if (<= y -3.1e-173) (* -2.0 x) (if (<= y 2.2e+36) t_0 (* -2.0 x)))))))

C

double code(double x, double y) {
	double t_0 = fma((2.0 / x), y, 2.0) * y;
	double tmp;
	if (y <= -9.2e+25) {
		tmp = -2.0 * x;
	} else if (y <= -1.1e-152) {
		tmp = t_0;
	} else if (y <= -3.1e-173) {
		tmp = -2.0 * x;
	} else if (y <= 2.2e+36) {
		tmp = t_0;
	} else {
		tmp = -2.0 * x;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(fma(Float64(2.0 / x), y, 2.0) * y)
	tmp = 0.0
	if (y <= -9.2e+25)
		tmp = Float64(-2.0 * x);
	elseif (y <= -1.1e-152)
		tmp = t_0;
	elseif (y <= -3.1e-173)
		tmp = Float64(-2.0 * x);
	elseif (y <= 2.2e+36)
		tmp = t_0;
	else
		tmp = Float64(-2.0 * x);
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(2.0 / x), $MachinePrecision] * y + 2.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -9.2e+25], N[(-2.0 * x), $MachinePrecision], If[LessEqual[y, -1.1e-152], t$95$0, If[LessEqual[y, -3.1e-173], N[(-2.0 * x), $MachinePrecision], If[LessEqual[y, 2.2e+36], t$95$0, N[(-2.0 * x), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

2. if y < -9.1999999999999992e25 or -1.09999999999999992e-152 < y < -3.10000000000000005e-173 or 2.2e36 < y

   1. Initial program 70.6%

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

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 81.7

         \[\leadsto \color{blue}{-2 \cdot x} \]

   5. Applied rewrites 81.7%

      \[\leadsto \color{blue}{-2 \cdot x} \]

   if -9.1999999999999992e25 < y < -1.09999999999999992e-152 or -3.10000000000000005e-173 < y < 2.2e36

   1. Initial program 78.4%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. *-lft-identity N/A

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

      4. associate-*l/ N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. associate-*r/ N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 81.1

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

   5. Applied rewrites 81.1%

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

Alternative 4: 99.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y}{x - y} \cdot \left(x \cdot 2\right)\\ \mathbf{if}\;y \leq -2 \cdot 10^{+37}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2 \cdot 10^{+47}:\\ \;\;\;\;\frac{x}{x - y} \cdot \left(2 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (/ y (- x y)) (* x 2.0))))
   (if (<= y -2e+37) t_0 (if (<= y 2e+47) (* (/ x (- x y)) (* 2.0 y)) t_0))))

C

double code(double x, double y) {
	double t_0 = (y / (x - y)) * (x * 2.0);
	double tmp;
	if (y <= -2e+37) {
		tmp = t_0;
	} else if (y <= 2e+47) {
		tmp = (x / (x - y)) * (2.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 = (y / (x - y)) * (x * 2.0d0)
    if (y <= (-2d+37)) then
        tmp = t_0
    else if (y <= 2d+47) then
        tmp = (x / (x - y)) * (2.0d0 * y)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (y / (x - y)) * (x * 2.0);
	double tmp;
	if (y <= -2e+37) {
		tmp = t_0;
	} else if (y <= 2e+47) {
		tmp = (x / (x - y)) * (2.0 * y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (y / (x - y)) * (x * 2.0)
	tmp = 0
	if y <= -2e+37:
		tmp = t_0
	elif y <= 2e+47:
		tmp = (x / (x - y)) * (2.0 * y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(y / Float64(x - y)) * Float64(x * 2.0))
	tmp = 0.0
	if (y <= -2e+37)
		tmp = t_0;
	elseif (y <= 2e+47)
		tmp = Float64(Float64(x / Float64(x - y)) * Float64(2.0 * y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (y / (x - y)) * (x * 2.0);
	tmp = 0.0;
	if (y <= -2e+37)
		tmp = t_0;
	elseif (y <= 2e+47)
		tmp = (x / (x - y)) * (2.0 * y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.99999999999999991e37 or 2.0000000000000001e47 < y

   1. Initial program 71.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 100.0

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   if -1.99999999999999991e37 < y < 2.0000000000000001e47

   1. Initial program 76.9%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

4. Final simplification 99.9%

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

Alternative 5: 93.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.25 \cdot 10^{+243}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{elif}\;y \leq 9.5 \cdot 10^{+148}:\\ \;\;\;\;\frac{x}{x - y} \cdot \left(2 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.25e+243)
   (* -2.0 x)
   (if (<= y 9.5e+148) (* (/ x (- x y)) (* 2.0 y)) (* -2.0 x))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.25e+243) {
		tmp = -2.0 * x;
	} else if (y <= 9.5e+148) {
		tmp = (x / (x - y)) * (2.0 * y);
	} else {
		tmp = -2.0 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-1.25d+243)) then
        tmp = (-2.0d0) * x
    else if (y <= 9.5d+148) then
        tmp = (x / (x - y)) * (2.0d0 * y)
    else
        tmp = (-2.0d0) * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.25e+243) {
		tmp = -2.0 * x;
	} else if (y <= 9.5e+148) {
		tmp = (x / (x - y)) * (2.0 * y);
	} else {
		tmp = -2.0 * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.25e+243:
		tmp = -2.0 * x
	elif y <= 9.5e+148:
		tmp = (x / (x - y)) * (2.0 * y)
	else:
		tmp = -2.0 * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.25e+243)
		tmp = Float64(-2.0 * x);
	elseif (y <= 9.5e+148)
		tmp = Float64(Float64(x / Float64(x - y)) * Float64(2.0 * y));
	else
		tmp = Float64(-2.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.25e+243)
		tmp = -2.0 * x;
	elseif (y <= 9.5e+148)
		tmp = (x / (x - y)) * (2.0 * y);
	else
		tmp = -2.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.25e+243], N[(-2.0 * x), $MachinePrecision], If[LessEqual[y, 9.5e+148], N[(N[(x / N[(x - y), $MachinePrecision]), $MachinePrecision] * N[(2.0 * y), $MachinePrecision]), $MachinePrecision], N[(-2.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.25000000000000009e243 or 9.5000000000000002e148 < y

   1. Initial program 62.0%

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

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 96.3

         \[\leadsto \color{blue}{-2 \cdot x} \]

   5. Applied rewrites 96.3%

      \[\leadsto \color{blue}{-2 \cdot x} \]

   if -1.25000000000000009e243 < y < 9.5000000000000002e148

   1. Initial program 77.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-*l* N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lower-/.f64 96.3

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

   4. Applied rewrites 96.3%

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

4. Final simplification 96.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.25 \cdot 10^{+243}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{elif}\;y \leq 9.5 \cdot 10^{+148}:\\ \;\;\;\;\frac{x}{x - y} \cdot \left(2 \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 74.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -9.2 \cdot 10^{+25}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{elif}\;y \leq -1.1 \cdot 10^{-152}:\\ \;\;\;\;2 \cdot y\\ \mathbf{elif}\;y \leq -3.1 \cdot 10^{-173}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{elif}\;y \leq 2.2 \cdot 10^{+36}:\\ \;\;\;\;2 \cdot y\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -9.2e+25)
   (* -2.0 x)
   (if (<= y -1.1e-152)
     (* 2.0 y)
     (if (<= y -3.1e-173)
       (* -2.0 x)
       (if (<= y 2.2e+36) (* 2.0 y) (* -2.0 x))))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -9.2e+25) {
		tmp = -2.0 * x;
	} else if (y <= -1.1e-152) {
		tmp = 2.0 * y;
	} else if (y <= -3.1e-173) {
		tmp = -2.0 * x;
	} else if (y <= 2.2e+36) {
		tmp = 2.0 * y;
	} else {
		tmp = -2.0 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-9.2d+25)) then
        tmp = (-2.0d0) * x
    else if (y <= (-1.1d-152)) then
        tmp = 2.0d0 * y
    else if (y <= (-3.1d-173)) then
        tmp = (-2.0d0) * x
    else if (y <= 2.2d+36) then
        tmp = 2.0d0 * y
    else
        tmp = (-2.0d0) * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -9.2e+25) {
		tmp = -2.0 * x;
	} else if (y <= -1.1e-152) {
		tmp = 2.0 * y;
	} else if (y <= -3.1e-173) {
		tmp = -2.0 * x;
	} else if (y <= 2.2e+36) {
		tmp = 2.0 * y;
	} else {
		tmp = -2.0 * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -9.2e+25:
		tmp = -2.0 * x
	elif y <= -1.1e-152:
		tmp = 2.0 * y
	elif y <= -3.1e-173:
		tmp = -2.0 * x
	elif y <= 2.2e+36:
		tmp = 2.0 * y
	else:
		tmp = -2.0 * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -9.2e+25)
		tmp = Float64(-2.0 * x);
	elseif (y <= -1.1e-152)
		tmp = Float64(2.0 * y);
	elseif (y <= -3.1e-173)
		tmp = Float64(-2.0 * x);
	elseif (y <= 2.2e+36)
		tmp = Float64(2.0 * y);
	else
		tmp = Float64(-2.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -9.2e+25)
		tmp = -2.0 * x;
	elseif (y <= -1.1e-152)
		tmp = 2.0 * y;
	elseif (y <= -3.1e-173)
		tmp = -2.0 * x;
	elseif (y <= 2.2e+36)
		tmp = 2.0 * y;
	else
		tmp = -2.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -9.2e+25], N[(-2.0 * x), $MachinePrecision], If[LessEqual[y, -1.1e-152], N[(2.0 * y), $MachinePrecision], If[LessEqual[y, -3.1e-173], N[(-2.0 * x), $MachinePrecision], If[LessEqual[y, 2.2e+36], N[(2.0 * y), $MachinePrecision], N[(-2.0 * x), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if y < -9.1999999999999992e25 or -1.09999999999999992e-152 < y < -3.10000000000000005e-173 or 2.2e36 < y

   1. Initial program 70.6%

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

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 81.7

         \[\leadsto \color{blue}{-2 \cdot x} \]

   5. Applied rewrites 81.7%

      \[\leadsto \color{blue}{-2 \cdot x} \]

   if -9.1999999999999992e25 < y < -1.09999999999999992e-152 or -3.10000000000000005e-173 < y < 2.2e36

   1. Initial program 78.4%

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

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{2 \cdot y} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{y \cdot 2} \]

      2. lower-*.f64 80.5

         \[\leadsto \color{blue}{y \cdot 2} \]

   5. Applied rewrites 80.5%

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

4. Final simplification 81.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9.2 \cdot 10^{+25}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{elif}\;y \leq -1.1 \cdot 10^{-152}:\\ \;\;\;\;2 \cdot y\\ \mathbf{elif}\;y \leq -3.1 \cdot 10^{-173}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{elif}\;y \leq 2.2 \cdot 10^{+36}:\\ \;\;\;\;2 \cdot y\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 49.6% accurate, 4.2× speedup

Math

\[\begin{array}{l} \\ -2 \cdot x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* -2.0 x))

C

double code(double x, double y) {
	return -2.0 * x;
}

Fortran

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

Java

public static double code(double x, double y) {
	return -2.0 * x;
}

Python

def code(x, y):
	return -2.0 * x

Julia

function code(x, y)
	return Float64(-2.0 * x)
end

MATLAB

function tmp = code(x, y)
	tmp = -2.0 * x;
end

Wolfram

code[x_, y_] := N[(-2.0 * x), $MachinePrecision]

Derivation

1. Initial program 74.7%

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

3. Taylor expanded in y around inf

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

   1. lower-*.f64 49.1

      \[\leadsto \color{blue}{-2 \cdot x} \]

5. Applied rewrites 49.1%

   \[\leadsto \color{blue}{-2 \cdot x} \]
6. Add Preprocessing

Developer Target 1: 99.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{2 \cdot x}{x - y} \cdot y\\ \mathbf{if}\;x < -1.7210442634149447 \cdot 10^{+81}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x < 83645045635564430:\\ \;\;\;\;\frac{x \cdot 2}{\frac{x - y}{y}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (/ (* 2.0 x) (- x y)) y)))
   (if (< x -1.7210442634149447e+81)
     t_0
     (if (< x 83645045635564430.0) (/ (* x 2.0) (/ (- x y) y)) t_0))))

C

double code(double x, double y) {
	double t_0 = ((2.0 * x) / (x - y)) * y;
	double tmp;
	if (x < -1.7210442634149447e+81) {
		tmp = t_0;
	} else if (x < 83645045635564430.0) {
		tmp = (x * 2.0) / ((x - y) / 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 = ((2.0d0 * x) / (x - y)) * y
    if (x < (-1.7210442634149447d+81)) then
        tmp = t_0
    else if (x < 83645045635564430.0d0) then
        tmp = (x * 2.0d0) / ((x - y) / y)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = ((2.0 * x) / (x - y)) * y;
	double tmp;
	if (x < -1.7210442634149447e+81) {
		tmp = t_0;
	} else if (x < 83645045635564430.0) {
		tmp = (x * 2.0) / ((x - y) / y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((2.0 * x) / (x - y)) * y
	tmp = 0
	if x < -1.7210442634149447e+81:
		tmp = t_0
	elif x < 83645045635564430.0:
		tmp = (x * 2.0) / ((x - y) / y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(2.0 * x) / Float64(x - y)) * y)
	tmp = 0.0
	if (x < -1.7210442634149447e+81)
		tmp = t_0;
	elseif (x < 83645045635564430.0)
		tmp = Float64(Float64(x * 2.0) / Float64(Float64(x - y) / y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((2.0 * x) / (x - y)) * y;
	tmp = 0.0;
	if (x < -1.7210442634149447e+81)
		tmp = t_0;
	elseif (x < 83645045635564430.0)
		tmp = (x * 2.0) / ((x - y) / y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(2.0 * x), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]}, If[Less[x, -1.7210442634149447e+81], t$95$0, If[Less[x, 83645045635564430.0], N[(N[(x * 2.0), $MachinePrecision] / N[(N[(x - y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Reproduce

herbie shell --seed 2024259 
(FPCore (x y)
  :name "Linear.Projection:perspective from linear-1.19.1.3, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< x -1721044263414944700000000000000000000000000000000000000000000000000000000000000000) (* (/ (* 2 x) (- x y)) y) (if (< x 83645045635564430) (/ (* x 2) (/ (- x y) y)) (* (/ (* 2 x) (- x y)) y))))

  (/ (* (* x 2.0) y) (- x y)))