Linear.Projection:perspective from linear-1.19.1.3, B

Percentage Accurate: 77.8% → 99.8%

Time: 5.6s

Alternatives: 6

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.8% 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.8% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1e-14) (not (<= x 1.12e+55)))
   (* (* y 2.0) (/ x (- x y)))
   (* (/ y (- x y)) (* 2.0 x))))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1e-14) || !(x <= 1.12e+55)) {
		tmp = (y * 2.0) * (x / (x - y));
	} else {
		tmp = (y / (x - y)) * (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 ((x <= (-1d-14)) .or. (.not. (x <= 1.12d+55))) then
        tmp = (y * 2.0d0) * (x / (x - y))
    else
        tmp = (y / (x - y)) * (2.0d0 * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -1e-14) || !(x <= 1.12e+55)) {
		tmp = (y * 2.0) * (x / (x - y));
	} else {
		tmp = (y / (x - y)) * (2.0 * x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1e-14) or not (x <= 1.12e+55):
		tmp = (y * 2.0) * (x / (x - y))
	else:
		tmp = (y / (x - y)) * (2.0 * x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1e-14) || !(x <= 1.12e+55))
		tmp = Float64(Float64(y * 2.0) * Float64(x / Float64(x - y)));
	else
		tmp = Float64(Float64(y / Float64(x - y)) * Float64(2.0 * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1e-14) || ~((x <= 1.12e+55)))
		tmp = (y * 2.0) * (x / (x - y));
	else
		tmp = (y / (x - y)) * (2.0 * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1e-14], N[Not[LessEqual[x, 1.12e+55]], $MachinePrecision]], N[(N[(y * 2.0), $MachinePrecision] * N[(x / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y / N[(x - y), $MachinePrecision]), $MachinePrecision] * N[(2.0 * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -9.99999999999999999e-15 or 1.12000000000000006e55 < x

   1. Initial program 80.4%

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

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

   4. Applied rewrites 100.0%

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

   if -9.99999999999999999e-15 < x < 1.12000000000000006e55

   1. Initial program 86.1%

      \[\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)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{-14} \lor \neg \left(x \leq 1.12 \cdot 10^{+55}\right):\\ \;\;\;\;\left(y \cdot 2\right) \cdot \frac{x}{x - y}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{x - y} \cdot \left(2 \cdot x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 93.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.9 \cdot 10^{-151} \lor \neg \left(x \leq 1.42 \cdot 10^{-179}\right):\\ \;\;\;\;\left(y \cdot 2\right) \cdot \frac{x}{x - y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, -2, -2\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -2.9e-151) (not (<= x 1.42e-179)))
   (* (* y 2.0) (/ x (- x y)))
   (* (fma (/ x y) -2.0 -2.0) x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -2.9e-151) || !(x <= 1.42e-179)) {
		tmp = (y * 2.0) * (x / (x - y));
	} else {
		tmp = fma((x / y), -2.0, -2.0) * x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -2.9e-151) || !(x <= 1.42e-179))
		tmp = Float64(Float64(y * 2.0) * Float64(x / Float64(x - y)));
	else
		tmp = Float64(fma(Float64(x / y), -2.0, -2.0) * x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -2.9e-151], N[Not[LessEqual[x, 1.42e-179]], $MachinePrecision]], N[(N[(y * 2.0), $MachinePrecision] * N[(x / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x / y), $MachinePrecision] * -2.0 + -2.0), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.90000000000000013e-151 or 1.42e-179 < x

   1. Initial program 84.0%

      \[\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 97.9

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

   4. Applied rewrites 97.9%

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

   if -2.90000000000000013e-151 < x < 1.42e-179

   1. Initial program 80.9%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-neg N/A

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

      4. *-commutative N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 98.3

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

   5. Applied rewrites 98.3%

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

4. Final simplification 98.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.9 \cdot 10^{-151} \lor \neg \left(x \leq 1.42 \cdot 10^{-179}\right):\\ \;\;\;\;\left(y \cdot 2\right) \cdot \frac{x}{x - y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, -2, -2\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 74.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{-22}:\\ \;\;\;\;2 \cdot y\\ \mathbf{elif}\;x \leq 6.2 \cdot 10^{+17}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, -2, -2\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{2}{x}, y, 2\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -2.1e-22)
   (* 2.0 y)
   (if (<= x 6.2e+17)
     (* (fma (/ x y) -2.0 -2.0) x)
     (* (fma (/ 2.0 x) y 2.0) y))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -2.1e-22) {
		tmp = 2.0 * y;
	} else if (x <= 6.2e+17) {
		tmp = fma((x / y), -2.0, -2.0) * x;
	} else {
		tmp = fma((2.0 / x), y, 2.0) * y;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -2.1e-22)
		tmp = Float64(2.0 * y);
	elseif (x <= 6.2e+17)
		tmp = Float64(fma(Float64(x / y), -2.0, -2.0) * x);
	else
		tmp = Float64(fma(Float64(2.0 / x), y, 2.0) * y);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -2.1e-22], N[(2.0 * y), $MachinePrecision], If[LessEqual[x, 6.2e+17], N[(N[(N[(x / y), $MachinePrecision] * -2.0 + -2.0), $MachinePrecision] * x), $MachinePrecision], N[(N[(N[(2.0 / x), $MachinePrecision] * y + 2.0), $MachinePrecision] * y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.10000000000000008e-22

   1. Initial program 79.7%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 74.2

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

   5. Applied rewrites 74.2%

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

   if -2.10000000000000008e-22 < x < 6.2e17

   1. Initial program 85.3%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-neg N/A

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

      4. *-commutative N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 84.3

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

   5. Applied rewrites 84.3%

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

   if 6.2e17 < x

   1. Initial program 83.2%

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

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. associate-*l/ N/A

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

      6. *-commutative N/A

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

      7. associate-*r/ N/A

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

      8. metadata-eval N/A

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

      9. associate-*r/ N/A

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

      10. distribute-rgt-in N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. associate-*r/ N/A

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

      16. metadata-eval N/A

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

      17. lower-/.f64 82.2

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

   5. Applied rewrites 82.2%

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

Alternative 4: 74.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{-22}:\\ \;\;\;\;2 \cdot y\\ \mathbf{elif}\;x \leq 6.2 \cdot 10^{+17}:\\ \;\;\;\;-2 \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{2}{x}, y, 2\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -2.1e-22)
   (* 2.0 y)
   (if (<= x 6.2e+17) (* -2.0 x) (* (fma (/ 2.0 x) y 2.0) y))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -2.1e-22) {
		tmp = 2.0 * y;
	} else if (x <= 6.2e+17) {
		tmp = -2.0 * x;
	} else {
		tmp = fma((2.0 / x), y, 2.0) * y;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -2.1e-22)
		tmp = Float64(2.0 * y);
	elseif (x <= 6.2e+17)
		tmp = Float64(-2.0 * x);
	else
		tmp = Float64(fma(Float64(2.0 / x), y, 2.0) * y);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -2.1e-22], N[(2.0 * y), $MachinePrecision], If[LessEqual[x, 6.2e+17], N[(-2.0 * x), $MachinePrecision], N[(N[(N[(2.0 / x), $MachinePrecision] * y + 2.0), $MachinePrecision] * y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.10000000000000008e-22

   1. Initial program 79.7%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 74.2

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

   5. Applied rewrites 74.2%

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

   if -2.10000000000000008e-22 < x < 6.2e17

   1. Initial program 85.3%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 83.7

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

   5. Applied rewrites 83.7%

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

   if 6.2e17 < x

   1. Initial program 83.2%

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

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. unpow2 N/A

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

      4. associate-*r* N/A

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

      5. associate-*l/ N/A

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

      6. *-commutative N/A

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

      7. associate-*r/ N/A

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

      8. metadata-eval N/A

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

      9. associate-*r/ N/A

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

      10. distribute-rgt-in N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. associate-*r/ N/A

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

      16. metadata-eval N/A

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

      17. lower-/.f64 82.2

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

   5. Applied rewrites 82.2%

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

Alternative 5: 74.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{-22} \lor \neg \left(x \leq 2.2 \cdot 10^{+17}\right):\\ \;\;\;\;2 \cdot y\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -2.1e-22) (not (<= x 2.2e+17))) (* 2.0 y) (* -2.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -2.1e-22) || !(x <= 2.2e+17)) {
		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 ((x <= (-2.1d-22)) .or. (.not. (x <= 2.2d+17))) 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 ((x <= -2.1e-22) || !(x <= 2.2e+17)) {
		tmp = 2.0 * y;
	} else {
		tmp = -2.0 * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -2.1e-22) or not (x <= 2.2e+17):
		tmp = 2.0 * y
	else:
		tmp = -2.0 * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -2.1e-22) || !(x <= 2.2e+17))
		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 ((x <= -2.1e-22) || ~((x <= 2.2e+17)))
		tmp = 2.0 * y;
	else
		tmp = -2.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -2.1e-22], N[Not[LessEqual[x, 2.2e+17]], $MachinePrecision]], N[(2.0 * y), $MachinePrecision], N[(-2.0 * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.10000000000000008e-22 or 2.2e17 < x

   1. Initial program 81.6%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 78.3

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

   5. Applied rewrites 78.3%

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

   if -2.10000000000000008e-22 < x < 2.2e17

   1. Initial program 85.3%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 83.7

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

   5. Applied rewrites 83.7%

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

4. Final simplification 80.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{-22} \lor \neg \left(x \leq 2.2 \cdot 10^{+17}\right):\\ \;\;\;\;2 \cdot y\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot x\\ \end{array} \]
5. Add Preprocessing

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

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

3. Taylor expanded in x around 0

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

   1. lower-*.f64 50.2

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

5. Applied rewrites 50.2%

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

Developer Target 1: 99.4% 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 2024313 
(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)))