Linear.Projection:perspective from linear-1.19.1.3, A

Percentage Accurate: 100.0% → 100.0%

Time: 4.7s

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, 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. Add Preprocessing
3. Add Preprocessing

Alternative 2: 98.5% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (((x + y) / (x - y)) <= (-0.4d0)) then
        tmp = -((x + y) / y)
    else
        tmp = 1.0d0 + ((y + y) / x)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 x y)) < -0.40000000000000002

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 98.1

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

   5. Simplified 98.1%

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

   if -0.40000000000000002 < (/.f64 (+.f64 x y) (-.f64 x y))

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. div-sub N/A

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

      4. *-lft-identity N/A

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

      5. distribute-rgt-out-- N/A

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

      6. metadata-eval N/A

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

      7. associate-*r/ N/A

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

      8. metadata-eval N/A

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

      9. associate-*r/ N/A

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

      10. lower-+.f64 N/A

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

      11. associate-*r/ N/A

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

      12. metadata-eval N/A

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

      13. associate-*r/ N/A

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

      14. metadata-eval N/A

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

      15. distribute-rgt-out-- N/A

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

      16. *-lft-identity N/A

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

      17. lower-/.f64 N/A

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

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

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

      19. metadata-eval N/A

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

      20. *-lft-identity N/A

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

      21. lower-+.f64 99.4

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

   5. Simplified 99.4%

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

4. Final simplification 98.7%

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

Alternative 3: 97.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 x y)) < -0.40000000000000002

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 98.1

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

   5. Simplified 98.1%

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

   if -0.40000000000000002 < (/.f64 (+.f64 x y) (-.f64 x y))

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Simplified 98.8%

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

4. Final simplification 98.4%

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

Alternative 4: 97.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 x y)) < -0.40000000000000002

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 98.1

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

   5. Simplified 98.1%

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

   6. Taylor expanded in x around 0

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

      1. sub-neg N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 98.1

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

   8. Simplified 98.1%

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

   if -0.40000000000000002 < (/.f64 (+.f64 x y) (-.f64 x y))

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Simplified 98.8%

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

Alternative 5: 97.9% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (+ x y) (- x y)) -1e-309) -1.0 1.0))

C

double code(double x, double y) {
	double tmp;
	if (((x + y) / (x - y)) <= -1e-309) {
		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 + y) / (x - y)) <= (-1d-309)) 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 + y) / (x - y)) <= -1e-309) {
		tmp = -1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if ((x + y) / (x - y)) <= -1e-309:
		tmp = -1.0
	else:
		tmp = 1.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x y) (-.f64 x y)) < -1.000000000000002e-309

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Simplified 98.0%

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

   if -1.000000000000002e-309 < (/.f64 (+.f64 x y) (-.f64 x y))

   1. Initial program 100.0%

      \[\frac{x + y}{x - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Simplified 98.8%

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

Alternative 6: 49.3% accurate, 18.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. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Simplified 47.9%

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

Developer Target 1: 100.0% accurate, 0.4× 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 2024207 
(FPCore (x y)
  :name "Linear.Projection:perspective from linear-1.19.1.3, A"
  :precision binary64

  :alt
  (! :herbie-platform default (/ 1 (- (/ x (+ x y)) (/ y (+ x y)))))

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