Linear.Projection:perspective from linear-1.19.1.3, A

Percentage Accurate: 100.0% → 100.0%

Time: 3.6s

Alternatives: 6

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x + y}{x - y} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x + y}{x - y} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x}{x - y}\\ t_1 := \frac{y}{x - y}\\ \frac{t_0 \cdot t_0 - t_1 \cdot t_1}{t_0 - t_1} \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ x (- x y))) (t_1 (/ y (- x y))))
   (/ (- (* t_0 t_0) (* t_1 t_1)) (- t_0 t_1))))

C

double code(double x, double y) {
	double t_0 = x / (x - y);
	double t_1 = y / (x - y);
	return ((t_0 * t_0) - (t_1 * t_1)) / (t_0 - t_1);
}

Fortran

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

Java

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

Python

def code(x, y):
	t_0 = x / (x - y)
	t_1 = y / (x - y)
	return ((t_0 * t_0) - (t_1 * t_1)) / (t_0 - t_1)

Julia

function code(x, y)
	t_0 = Float64(x / Float64(x - y))
	t_1 = Float64(y / Float64(x - y))
	return Float64(Float64(Float64(t_0 * t_0) - Float64(t_1 * t_1)) / Float64(t_0 - t_1))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x + y}{x - y} \]
2. Step-by-step derivation

   1. clear-num 99.9%

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

   2. associate-/r/ 99.6%

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

3. Applied egg-rr 99.6%

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

   1. distribute-lft-in 99.6%

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

   2. flip-+ 99.6%

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

   3. associate-*l/ 99.8%

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

   4. *-un-lft-identity 99.8%

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

   5. associate-*l/ 99.6%

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

   6. *-un-lft-identity 99.6%

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

   7. associate-*l/ 99.7%

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

   8. *-un-lft-identity 99.7%

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

   9. associate-*l/ 99.6%

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

   10. *-un-lft-identity 99.6%

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

   11. associate-*l/ 99.8%

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

   12. *-un-lft-identity 99.8%

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

   13. associate-*l/ 100.0%

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

   14. *-un-lft-identity 100.0%

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

5. Applied egg-rr 100.0%

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

6. Final simplification 100.0%

   \[\leadsto \frac{\frac{x}{x - y} \cdot \frac{x}{x - y} - \frac{y}{x - y} \cdot \frac{y}{x - y}}{\frac{x}{x - y} - \frac{y}{x - y}} \]

Alternative 2: 71.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.1e-119) (not (<= x 9.2e+92))) (+ 1.0 (* 2.0 (/ y x))) -1.0))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.1e-119) || !(x <= 9.2e+92)) {
		tmp = 1.0 + (2.0 * (y / x));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-1.1d-119)) .or. (.not. (x <= 9.2d+92))) then
        tmp = 1.0d0 + (2.0d0 * (y / x))
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if (x <= -1.1e-119) or not (x <= 9.2e+92):
		tmp = 1.0 + (2.0 * (y / x))
	else:
		tmp = -1.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.1e-119) || ~((x <= 9.2e+92)))
		tmp = 1.0 + (2.0 * (y / x));
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.1e-119 or 9.19999999999999994e92 < x

   1. Initial program 99.9%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in y around 0 82.1%

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

   if -1.1e-119 < x < 9.19999999999999994e92

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in x around 0 77.6%

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

4. Final simplification 80.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.1 \cdot 10^{-119} \lor \neg \left(x \leq 9.2 \cdot 10^{+92}\right):\\ \;\;\;\;1 + 2 \cdot \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]

Alternative 3: 73.0% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.16e-119) (not (<= x 2.7e+59)))
   (+ 1.0 (* 2.0 (/ y x)))
   (+ (* -2.0 (/ x y)) -1.0)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.16e-119) || !(x <= 2.7e+59)) {
		tmp = 1.0 + (2.0 * (y / x));
	} else {
		tmp = (-2.0 * (x / y)) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-1.16d-119)) .or. (.not. (x <= 2.7d+59))) then
        tmp = 1.0d0 + (2.0d0 * (y / x))
    else
        tmp = ((-2.0d0) * (x / y)) + (-1.0d0)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if (x <= -1.16e-119) or not (x <= 2.7e+59):
		tmp = 1.0 + (2.0 * (y / x))
	else:
		tmp = (-2.0 * (x / y)) + -1.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.16e-119) || ~((x <= 2.7e+59)))
		tmp = 1.0 + (2.0 * (y / x));
	else
		tmp = (-2.0 * (x / y)) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.16e-119 or 2.7000000000000001e59 < x

   1. Initial program 99.9%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in y around 0 81.2%

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

   if -1.16e-119 < x < 2.7000000000000001e59

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in x around 0 80.3%

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

4. Final simplification 80.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.16 \cdot 10^{-119} \lor \neg \left(x \leq 2.7 \cdot 10^{+59}\right):\\ \;\;\;\;1 + 2 \cdot \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{x}{y} + -1\\ \end{array} \]

Alternative 4: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x + y}{x - y} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x + y}{x - y} \]

2. Final simplification 100.0%

   \[\leadsto \frac{x + y}{x - y} \]

Alternative 5: 71.9% accurate, 1.4× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.16e-119) {
		tmp = 1.0;
	} else if (x <= 4.9e+58) {
		tmp = -1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-1.16d-119)) then
        tmp = 1.0d0
    else if (x <= 4.9d+58) then
        tmp = -1.0d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := If[LessEqual[x, -1.16e-119], 1.0, If[LessEqual[x, 4.9e+58], -1.0, 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -1.16e-119 or 4.90000000000000018e58 < x

   1. Initial program 99.9%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in x around inf 79.7%

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

   if -1.16e-119 < x < 4.90000000000000018e58

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]

   2. Taylor expanded in x around 0 78.6%

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

4. Final simplification 79.2%

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

Alternative 6: 50.2% accurate, 7.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 100.0%

   \[\frac{x + y}{x - y} \]

2. Taylor expanded in x around 0 45.1%

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

3. Final simplification 45.1%

   \[\leadsto -1 \]

Developer target: 100.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\frac{x}{x + y} - \frac{y}{x + y}} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :herbie-target
  (/ 1.0 (- (/ x (+ x y)) (/ y (+ x y))))

  (/ (+ x y) (- x y)))