Linear.Projection:perspective from linear-1.19.1.3, B

Percentage Accurate: 76.3% → 99.5%

Time: 6.2s

Alternatives: 8

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: 76.3% 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.5% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.2e-79) (not (<= x 1e+51)))
   (* (* 2.0 (/ x (- x y))) y)
   (* (* (/ y (- x y)) x) 2.0)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.20000000000000003e-79 or 1e51 < x

   1. Initial program 72.8%

      \[\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. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. associate-/l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

   if -1.20000000000000003e-79 < x < 1e51

   1. Initial program 83.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. associate-/l* N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

4. Final simplification 99.9%

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

Alternative 2: 87.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x \cdot 2\right) \cdot y}{x - y}\\ t_1 := \frac{\left(x + x\right) \cdot y}{x - y}\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;\mathsf{fma}\left(x, \frac{x}{y}, x\right) \cdot -2\\ \mathbf{elif}\;t\_0 \leq -1 \cdot 10^{-306}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;y + y\\ \mathbf{elif}\;t\_0 \leq 10^{+140}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{x}, y, y\right) \cdot 2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* (* x 2.0) y) (- x y))) (t_1 (/ (* (+ x x) y) (- x y))))
   (if (<= t_0 (- INFINITY))
     (* (fma x (/ x y) x) -2.0)
     (if (<= t_0 -1e-306)
       t_1
       (if (<= t_0 0.0)
         (+ y y)
         (if (<= t_0 1e+140) t_1 (* (fma (/ y x) y y) 2.0)))))))

C

double code(double x, double y) {
	double t_0 = ((x * 2.0) * y) / (x - y);
	double t_1 = ((x + x) * y) / (x - y);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = fma(x, (x / y), x) * -2.0;
	} else if (t_0 <= -1e-306) {
		tmp = t_1;
	} else if (t_0 <= 0.0) {
		tmp = y + y;
	} else if (t_0 <= 1e+140) {
		tmp = t_1;
	} else {
		tmp = fma((y / x), y, y) * 2.0;
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(x * 2.0) * y) / Float64(x - y))
	t_1 = Float64(Float64(Float64(x + x) * y) / Float64(x - y))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(fma(x, Float64(x / y), x) * -2.0);
	elseif (t_0 <= -1e-306)
		tmp = t_1;
	elseif (t_0 <= 0.0)
		tmp = Float64(y + y);
	elseif (t_0 <= 1e+140)
		tmp = t_1;
	else
		tmp = Float64(fma(Float64(y / x), y, y) * 2.0);
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(x * 2.0), $MachinePrecision] * y), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(x + x), $MachinePrecision] * y), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[(x * N[(x / y), $MachinePrecision] + x), $MachinePrecision] * -2.0), $MachinePrecision], If[LessEqual[t$95$0, -1e-306], t$95$1, If[LessEqual[t$95$0, 0.0], N[(y + y), $MachinePrecision], If[LessEqual[t$95$0, 1e+140], t$95$1, N[(N[(N[(y / x), $MachinePrecision] * y + y), $MachinePrecision] * 2.0), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < -inf.0

   1. Initial program 5.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. lower-fma.f64 N/A

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

      8. lower-/.f64 53.0

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

   5. Applied rewrites 53.0%

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

   if -inf.0 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < -1.00000000000000003e-306 or -0.0 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < 1.00000000000000006e140

   1. Initial program 99.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 \frac{\color{blue}{\left(x \cdot 2\right)} \cdot y}{x - y} \]

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 99.4

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

   4. Applied rewrites 99.4%

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

   if -1.00000000000000003e-306 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < -0.0

   1. Initial program 8.0%

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

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

   5. Applied rewrites 58.3%

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

   7. Applied rewrites 58.3%

      \[\leadsto y + \color{blue}{y} \]

   if 1.00000000000000006e140 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y))

   1. Initial program 5.8%

      \[\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. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-*l/ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 62.3

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

   7. Applied rewrites 62.3%

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

Alternative 3: 92.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -3.1e-176) (not (<= x 1.25e-45)))
   (* (* 2.0 (/ x (- x y))) y)
   (* (fma x (/ x y) x) -2.0)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -3.1e-176) || !(x <= 1.25e-45)) {
		tmp = (2.0 * (x / (x - y))) * y;
	} else {
		tmp = fma(x, (x / y), x) * -2.0;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -3.1e-176) || !(x <= 1.25e-45))
		tmp = Float64(Float64(2.0 * Float64(x / Float64(x - y))) * y);
	else
		tmp = Float64(fma(x, Float64(x / y), x) * -2.0);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -3.1e-176], N[Not[LessEqual[x, 1.25e-45]], $MachinePrecision]], N[(N[(2.0 * N[(x / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], N[(N[(x * N[(x / y), $MachinePrecision] + x), $MachinePrecision] * -2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.09999999999999992e-176 or 1.24999999999999994e-45 < x

   1. Initial program 75.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. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. associate-/l* N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 97.9

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

   4. Applied rewrites 97.9%

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

   if -3.09999999999999992e-176 < x < 1.24999999999999994e-45

   1. Initial program 81.3%

      \[\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. lower-fma.f64 N/A

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

      8. lower-/.f64 92.6

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

   5. Applied rewrites 92.6%

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

4. Final simplification 96.4%

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

Alternative 4: 72.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{-79} \lor \neg \left(x \leq 7 \cdot 10^{+50}\right):\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, \frac{x}{y}, x\right) \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.15e-79) (not (<= x 7e+50)))
   (+ y y)
   (* (fma x (/ x y) x) -2.0)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.15e-79) || !(x <= 7e+50)) {
		tmp = y + y;
	} else {
		tmp = fma(x, (x / y), x) * -2.0;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.15e-79) || !(x <= 7e+50))
		tmp = Float64(y + y);
	else
		tmp = Float64(fma(x, Float64(x / y), x) * -2.0);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.15e-79], N[Not[LessEqual[x, 7e+50]], $MachinePrecision]], N[(y + y), $MachinePrecision], N[(N[(x * N[(x / y), $MachinePrecision] + x), $MachinePrecision] * -2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.15000000000000006e-79 or 7.00000000000000012e50 < x

   1. Initial program 72.8%

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

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

   5. Applied rewrites 73.2%

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

   7. Applied rewrites 73.2%

      \[\leadsto y + \color{blue}{y} \]

   if -1.15000000000000006e-79 < x < 7.00000000000000012e50

   1. Initial program 83.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 + -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. lower-fma.f64 N/A

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

      8. lower-/.f64 85.1

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

   5. Applied rewrites 85.1%

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

4. Final simplification 78.2%

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

Alternative 5: 72.9% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.15e-79)
   (+ y y)
   (if (<= x 7e+50) (* (fma x (/ x y) x) -2.0) (* (fma (/ y x) y y) 2.0))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.15e-79) {
		tmp = y + y;
	} else if (x <= 7e+50) {
		tmp = fma(x, (x / y), x) * -2.0;
	} else {
		tmp = fma((y / x), y, y) * 2.0;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.15e-79)
		tmp = Float64(y + y);
	elseif (x <= 7e+50)
		tmp = Float64(fma(x, Float64(x / y), x) * -2.0);
	else
		tmp = Float64(fma(Float64(y / x), y, y) * 2.0);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.15e-79], N[(y + y), $MachinePrecision], If[LessEqual[x, 7e+50], N[(N[(x * N[(x / y), $MachinePrecision] + x), $MachinePrecision] * -2.0), $MachinePrecision], N[(N[(N[(y / x), $MachinePrecision] * y + y), $MachinePrecision] * 2.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.15000000000000006e-79

   1. Initial program 79.3%

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

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

   5. Applied rewrites 72.1%

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

   7. Applied rewrites 72.1%

      \[\leadsto y + \color{blue}{y} \]

   if -1.15000000000000006e-79 < x < 7.00000000000000012e50

   1. Initial program 83.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 + -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. lower-fma.f64 N/A

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

      8. lower-/.f64 85.1

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

   5. Applied rewrites 85.1%

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

   if 7.00000000000000012e50 < x

   1. Initial program 61.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. associate-/l* N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 70.9

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

   4. Applied rewrites 70.9%

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

   5. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-*l/ N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 75.7

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

   7. Applied rewrites 75.7%

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

Alternative 6: 72.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{-79}:\\ \;\;\;\;y + y\\ \mathbf{elif}\;x \leq 7 \cdot 10^{+50}:\\ \;\;\;\;\mathsf{fma}\left(x, \frac{x}{y}, x\right) \cdot -2\\ \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 -1.15e-79)
   (+ y y)
   (if (<= x 7e+50) (* (fma x (/ x y) x) -2.0) (* (fma (/ 2.0 x) y 2.0) y))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.15e-79) {
		tmp = y + y;
	} else if (x <= 7e+50) {
		tmp = fma(x, (x / y), x) * -2.0;
	} else {
		tmp = fma((2.0 / x), y, 2.0) * y;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.15e-79)
		tmp = Float64(y + y);
	elseif (x <= 7e+50)
		tmp = Float64(fma(x, Float64(x / y), x) * -2.0);
	else
		tmp = Float64(fma(Float64(2.0 / x), y, 2.0) * y);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.15e-79], N[(y + y), $MachinePrecision], If[LessEqual[x, 7e+50], N[(N[(x * N[(x / y), $MachinePrecision] + x), $MachinePrecision] * -2.0), $MachinePrecision], N[(N[(N[(2.0 / x), $MachinePrecision] * y + 2.0), $MachinePrecision] * y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.15000000000000006e-79

   1. Initial program 79.3%

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

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

   5. Applied rewrites 72.1%

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

   7. Applied rewrites 72.1%

      \[\leadsto y + \color{blue}{y} \]

   if -1.15000000000000006e-79 < x < 7.00000000000000012e50

   1. Initial program 83.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 + -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. lower-fma.f64 N/A

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

      8. lower-/.f64 85.1

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

   5. Applied rewrites 85.1%

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

   if 7.00000000000000012e50 < x

   1. Initial program 61.4%

      \[\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. distribute-lft-out N/A

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

      2. unpow2 N/A

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

      3. associate-*l/ N/A

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

      4. distribute-lft-out N/A

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

      5. associate-*l* N/A

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

      6. distribute-rgt-in N/A

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

      7. *-commutative N/A

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

      8. *-lft-identity N/A

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

      9. associate-*l/ N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. +-commutative N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 N/A

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

      16. associate-*r/ N/A

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

      17. metadata-eval N/A

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

      18. lower-/.f64 75.7

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

   5. Applied rewrites 75.7%

      \[\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 7: 72.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{-79} \lor \neg \left(x \leq 7 \cdot 10^{+50}\right):\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.15e-79) (not (<= x 7e+50))) (+ y y) (* -2.0 x)))

C

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

Python

def code(x, y):
	tmp = 0
	if (x <= -1.15e-79) or not (x <= 7e+50):
		tmp = y + y
	else:
		tmp = -2.0 * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.15e-79) || !(x <= 7e+50))
		tmp = Float64(y + y);
	else
		tmp = Float64(-2.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.15e-79) || ~((x <= 7e+50)))
		tmp = y + y;
	else
		tmp = -2.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.15e-79], N[Not[LessEqual[x, 7e+50]], $MachinePrecision]], N[(y + y), $MachinePrecision], N[(-2.0 * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.15000000000000006e-79 or 7.00000000000000012e50 < x

   1. Initial program 72.8%

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

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

   5. Applied rewrites 73.2%

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

   7. Applied rewrites 73.2%

      \[\leadsto y + \color{blue}{y} \]

   if -1.15000000000000006e-79 < x < 7.00000000000000012e50

   1. Initial program 83.4%

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

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

   5. Applied rewrites 84.2%

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

4. Final simplification 77.8%

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

Alternative 8: 50.3% accurate, 6.3× speedup

Math

\[\begin{array}{l} \\ y + y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.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} \]
4. Step-by-step derivation

   1. lower-*.f64 49.8

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

5. Applied rewrites 49.8%

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

7. Applied rewrites 49.8%

   \[\leadsto y + \color{blue}{y} \]
8. 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 2024326 
(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)))