Linear.Projection:perspective from linear-1.19.1.3, A

Percentage Accurate: 100.0% → 100.0%

Time: 7.4s

Alternatives: 7

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

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

   1. clear-num 99.9%

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

   2. inv-pow 99.9%

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

4. Applied egg-rr 99.9%

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

   1. unpow-1 99.9%

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

   2. associate-/r/ 99.7%

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

   3. distribute-lft-in 99.7%

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

   4. flip-+ 99.7%

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

   5. associate-*l/ 99.9%

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

   6. *-un-lft-identity 99.9%

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

   7. associate-*l/ 99.7%

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

   8. *-un-lft-identity 99.7%

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

   9. associate-*l/ 99.8%

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

   10. *-un-lft-identity 99.8%

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

   11. associate-*l/ 99.7%

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

   12. *-un-lft-identity 99.7%

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

   13. 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} \]

   14. *-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} \]

   15. 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}}} \]

6. 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}}} \]

7. 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}} \]
8. Add Preprocessing

Alternative 2: 73.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + 2 \cdot \frac{y}{x}\\ \mathbf{if}\;x \leq -3.9 \cdot 10^{+14}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{-91}:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{-57}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.7 \cdot 10^{+74}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ 1.0 (* 2.0 (/ y x)))))
   (if (<= x -3.9e+14)
     t_0
     (if (<= x 2.45e-91)
       -1.0
       (if (<= x 1.65e-57) 1.0 (if (<= x 1.7e+74) -1.0 t_0))))))

C

double code(double x, double y) {
	double t_0 = 1.0 + (2.0 * (y / x));
	double tmp;
	if (x <= -3.9e+14) {
		tmp = t_0;
	} else if (x <= 2.45e-91) {
		tmp = -1.0;
	} else if (x <= 1.65e-57) {
		tmp = 1.0;
	} else if (x <= 1.7e+74) {
		tmp = -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 + (2.0d0 * (y / x))
    if (x <= (-3.9d+14)) then
        tmp = t_0
    else if (x <= 2.45d-91) then
        tmp = -1.0d0
    else if (x <= 1.65d-57) then
        tmp = 1.0d0
    else if (x <= 1.7d+74) then
        tmp = -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 + (2.0 * (y / x));
	double tmp;
	if (x <= -3.9e+14) {
		tmp = t_0;
	} else if (x <= 2.45e-91) {
		tmp = -1.0;
	} else if (x <= 1.65e-57) {
		tmp = 1.0;
	} else if (x <= 1.7e+74) {
		tmp = -1.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = 1.0 + (2.0 * (y / x))
	tmp = 0
	if x <= -3.9e+14:
		tmp = t_0
	elif x <= 2.45e-91:
		tmp = -1.0
	elif x <= 1.65e-57:
		tmp = 1.0
	elif x <= 1.7e+74:
		tmp = -1.0
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(1.0 + Float64(2.0 * Float64(y / x)))
	tmp = 0.0
	if (x <= -3.9e+14)
		tmp = t_0;
	elseif (x <= 2.45e-91)
		tmp = -1.0;
	elseif (x <= 1.65e-57)
		tmp = 1.0;
	elseif (x <= 1.7e+74)
		tmp = -1.0;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = 1.0 + (2.0 * (y / x));
	tmp = 0.0;
	if (x <= -3.9e+14)
		tmp = t_0;
	elseif (x <= 2.45e-91)
		tmp = -1.0;
	elseif (x <= 1.65e-57)
		tmp = 1.0;
	elseif (x <= 1.7e+74)
		tmp = -1.0;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(2.0 * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -3.9e+14], t$95$0, If[LessEqual[x, 2.45e-91], -1.0, If[LessEqual[x, 1.65e-57], 1.0, If[LessEqual[x, 1.7e+74], -1.0, t$95$0]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.9e14 or 1.7e74 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 85.6%

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

   if -3.9e14 < x < 2.4499999999999999e-91 or 1.6499999999999999e-57 < x < 1.7e74

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 82.1%

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

   if 2.4499999999999999e-91 < x < 1.6499999999999999e-57

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 85.9%

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

4. Final simplification 83.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.9 \cdot 10^{+14}:\\ \;\;\;\;1 + 2 \cdot \frac{y}{x}\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{-91}:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{-57}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.7 \cdot 10^{+74}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1 + 2 \cdot \frac{y}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 74.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + 2 \cdot \frac{y}{x}\\ t_1 := -2 \cdot \frac{x}{y} + -1\\ \mathbf{if}\;x \leq -1.6 \cdot 10^{+14}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{-91}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{-57}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.85 \cdot 10^{+74}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ 1.0 (* 2.0 (/ y x)))) (t_1 (+ (* -2.0 (/ x y)) -1.0)))
   (if (<= x -1.6e+14)
     t_0
     (if (<= x 2.45e-91)
       t_1
       (if (<= x 1.65e-57) 1.0 (if (<= x 1.85e+74) t_1 t_0))))))

C

double code(double x, double y) {
	double t_0 = 1.0 + (2.0 * (y / x));
	double t_1 = (-2.0 * (x / y)) + -1.0;
	double tmp;
	if (x <= -1.6e+14) {
		tmp = t_0;
	} else if (x <= 2.45e-91) {
		tmp = t_1;
	} else if (x <= 1.65e-57) {
		tmp = 1.0;
	} else if (x <= 1.85e+74) {
		tmp = t_1;
	} 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) :: t_1
    real(8) :: tmp
    t_0 = 1.0d0 + (2.0d0 * (y / x))
    t_1 = ((-2.0d0) * (x / y)) + (-1.0d0)
    if (x <= (-1.6d+14)) then
        tmp = t_0
    else if (x <= 2.45d-91) then
        tmp = t_1
    else if (x <= 1.65d-57) then
        tmp = 1.0d0
    else if (x <= 1.85d+74) then
        tmp = t_1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = 1.0 + (2.0 * (y / x));
	double t_1 = (-2.0 * (x / y)) + -1.0;
	double tmp;
	if (x <= -1.6e+14) {
		tmp = t_0;
	} else if (x <= 2.45e-91) {
		tmp = t_1;
	} else if (x <= 1.65e-57) {
		tmp = 1.0;
	} else if (x <= 1.85e+74) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = 1.0 + (2.0 * (y / x))
	t_1 = (-2.0 * (x / y)) + -1.0
	tmp = 0
	if x <= -1.6e+14:
		tmp = t_0
	elif x <= 2.45e-91:
		tmp = t_1
	elif x <= 1.65e-57:
		tmp = 1.0
	elif x <= 1.85e+74:
		tmp = t_1
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(1.0 + Float64(2.0 * Float64(y / x)))
	t_1 = Float64(Float64(-2.0 * Float64(x / y)) + -1.0)
	tmp = 0.0
	if (x <= -1.6e+14)
		tmp = t_0;
	elseif (x <= 2.45e-91)
		tmp = t_1;
	elseif (x <= 1.65e-57)
		tmp = 1.0;
	elseif (x <= 1.85e+74)
		tmp = t_1;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = 1.0 + (2.0 * (y / x));
	t_1 = (-2.0 * (x / y)) + -1.0;
	tmp = 0.0;
	if (x <= -1.6e+14)
		tmp = t_0;
	elseif (x <= 2.45e-91)
		tmp = t_1;
	elseif (x <= 1.65e-57)
		tmp = 1.0;
	elseif (x <= 1.85e+74)
		tmp = t_1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(1.0 + N[(2.0 * N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(-2.0 * N[(x / y), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]}, If[LessEqual[x, -1.6e+14], t$95$0, If[LessEqual[x, 2.45e-91], t$95$1, If[LessEqual[x, 1.65e-57], 1.0, If[LessEqual[x, 1.85e+74], t$95$1, t$95$0]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.6e14 or 1.8500000000000001e74 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 85.6%

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

   if -1.6e14 < x < 2.4499999999999999e-91 or 1.6499999999999999e-57 < x < 1.8500000000000001e74

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 82.5%

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

   if 2.4499999999999999e-91 < x < 1.6499999999999999e-57

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 85.9%

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

4. Final simplification 84.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.6 \cdot 10^{+14}:\\ \;\;\;\;1 + 2 \cdot \frac{y}{x}\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{-91}:\\ \;\;\;\;-2 \cdot \frac{x}{y} + -1\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{-57}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.85 \cdot 10^{+74}:\\ \;\;\;\;-2 \cdot \frac{x}{y} + -1\\ \mathbf{else}:\\ \;\;\;\;1 + 2 \cdot \frac{y}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+14}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{-91}:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 5.2 \cdot 10^{-57}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 10^{+59}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.45e+14)
   1.0
   (if (<= x 2.45e-91)
     -1.0
     (if (<= x 5.2e-57) 1.0 (if (<= x 1e+59) -1.0 1.0)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.45e+14) {
		tmp = 1.0;
	} else if (x <= 2.45e-91) {
		tmp = -1.0;
	} else if (x <= 5.2e-57) {
		tmp = 1.0;
	} else if (x <= 1e+59) {
		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.45d+14)) then
        tmp = 1.0d0
    else if (x <= 2.45d-91) then
        tmp = -1.0d0
    else if (x <= 5.2d-57) then
        tmp = 1.0d0
    else if (x <= 1d+59) 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.45e+14) {
		tmp = 1.0;
	} else if (x <= 2.45e-91) {
		tmp = -1.0;
	} else if (x <= 5.2e-57) {
		tmp = 1.0;
	} else if (x <= 1e+59) {
		tmp = -1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.45e+14:
		tmp = 1.0
	elif x <= 2.45e-91:
		tmp = -1.0
	elif x <= 5.2e-57:
		tmp = 1.0
	elif x <= 1e+59:
		tmp = -1.0
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.45e+14)
		tmp = 1.0;
	elseif (x <= 2.45e-91)
		tmp = -1.0;
	elseif (x <= 5.2e-57)
		tmp = 1.0;
	elseif (x <= 1e+59)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.45e+14)
		tmp = 1.0;
	elseif (x <= 2.45e-91)
		tmp = -1.0;
	elseif (x <= 5.2e-57)
		tmp = 1.0;
	elseif (x <= 1e+59)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.45e+14], 1.0, If[LessEqual[x, 2.45e-91], -1.0, If[LessEqual[x, 5.2e-57], 1.0, If[LessEqual[x, 1e+59], -1.0, 1.0]]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.45e14 or 2.4499999999999999e-91 < x < 5.19999999999999971e-57 or 9.99999999999999972e58 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 83.7%

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

   if -1.45e14 < x < 2.4499999999999999e-91 or 5.19999999999999971e-57 < x < 9.99999999999999972e58

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 82.5%

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

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+14}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{-91}:\\ \;\;\;\;-1\\ \mathbf{elif}\;x \leq 5.2 \cdot 10^{-57}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 10^{+59}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 100.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. clear-num 99.9%

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

   2. inv-pow 99.9%

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

4. Applied egg-rr 99.9%

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

   1. unpow-1 99.9%

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

6. Applied egg-rr 99.9%

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

7. Final simplification 99.9%

   \[\leadsto \frac{1}{\frac{x - y}{x + y}} \]
8. Add Preprocessing

Alternative 6: 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 99.9%

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

3. Final simplification 99.9%

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

Alternative 7: 49.5% 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 99.9%

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

3. Taylor expanded in x around 0 51.0%

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

4. Final simplification 51.0%

   \[\leadsto -1 \]
5. Add Preprocessing

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 2024026 
(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)))