Linear.Projection:perspective from linear-1.19.1.3, B

Percentage Accurate: 77.0% → 98.5%

Time: 4.7s

Alternatives: 5

Speedup: 0.5×

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.0% 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: 98.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x \cdot 2\right) \cdot y}{x - y}\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+87}:\\ \;\;\;\;x \cdot \left(2 \cdot \frac{y}{x - y}\right)\\ \mathbf{elif}\;t\_0 \leq -2 \cdot 10^{-288} \lor \neg \left(t\_0 \leq 0\right) \land t\_0 \leq 2 \cdot 10^{-54}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot 2}{\frac{x - y}{y}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* (* x 2.0) y) (- x y))))
   (if (<= t_0 -5e+87)
     (* x (* 2.0 (/ y (- x y))))
     (if (or (<= t_0 -2e-288) (and (not (<= t_0 0.0)) (<= t_0 2e-54)))
       t_0
       (/ (* x 2.0) (/ (- x y) y))))))

C

double code(double x, double y) {
	double t_0 = ((x * 2.0) * y) / (x - y);
	double tmp;
	if (t_0 <= -5e+87) {
		tmp = x * (2.0 * (y / (x - y)));
	} else if ((t_0 <= -2e-288) || (!(t_0 <= 0.0) && (t_0 <= 2e-54))) {
		tmp = t_0;
	} else {
		tmp = (x * 2.0) / ((x - y) / y);
	}
	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 = ((x * 2.0d0) * y) / (x - y)
    if (t_0 <= (-5d+87)) then
        tmp = x * (2.0d0 * (y / (x - y)))
    else if ((t_0 <= (-2d-288)) .or. (.not. (t_0 <= 0.0d0)) .and. (t_0 <= 2d-54)) then
        tmp = t_0
    else
        tmp = (x * 2.0d0) / ((x - y) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = ((x * 2.0) * y) / (x - y);
	double tmp;
	if (t_0 <= -5e+87) {
		tmp = x * (2.0 * (y / (x - y)));
	} else if ((t_0 <= -2e-288) || (!(t_0 <= 0.0) && (t_0 <= 2e-54))) {
		tmp = t_0;
	} else {
		tmp = (x * 2.0) / ((x - y) / y);
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = ((x * 2.0) * y) / (x - y)
	tmp = 0
	if t_0 <= -5e+87:
		tmp = x * (2.0 * (y / (x - y)))
	elif (t_0 <= -2e-288) or (not (t_0 <= 0.0) and (t_0 <= 2e-54)):
		tmp = t_0
	else:
		tmp = (x * 2.0) / ((x - y) / y)
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(Float64(x * 2.0) * y) / Float64(x - y))
	tmp = 0.0
	if (t_0 <= -5e+87)
		tmp = Float64(x * Float64(2.0 * Float64(y / Float64(x - y))));
	elseif ((t_0 <= -2e-288) || (!(t_0 <= 0.0) && (t_0 <= 2e-54)))
		tmp = t_0;
	else
		tmp = Float64(Float64(x * 2.0) / Float64(Float64(x - y) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = ((x * 2.0) * y) / (x - y);
	tmp = 0.0;
	if (t_0 <= -5e+87)
		tmp = x * (2.0 * (y / (x - y)));
	elseif ((t_0 <= -2e-288) || (~((t_0 <= 0.0)) && (t_0 <= 2e-54)))
		tmp = t_0;
	else
		tmp = (x * 2.0) / ((x - y) / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(N[(x * 2.0), $MachinePrecision] * y), $MachinePrecision] / N[(x - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e+87], N[(x * N[(2.0 * N[(y / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, -2e-288], And[N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision], LessEqual[t$95$0, 2e-54]]], t$95$0, N[(N[(x * 2.0), $MachinePrecision] / N[(N[(x - y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 23.6%

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

      1. associate-/l* 99.9%

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

      2. associate-*l* 99.9%

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

   3. Simplified 99.9%

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

   if -4.9999999999999998e87 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < -2.00000000000000012e-288 or 0.0 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < 2.0000000000000001e-54

   1. Initial program 99.3%

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

   if -2.00000000000000012e-288 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y)) < 0.0 or 2.0000000000000001e-54 < (/.f64 (*.f64 (*.f64 x #s(literal 2 binary64)) y) (-.f64 x y))

   1. Initial program 53.4%

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

      1. associate-/l* 99.9%

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

      2. associate-*l* 99.9%

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

   3. Simplified 99.9%

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

      1. associate-*r* 99.9%

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

      2. clear-num 99.9%

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

      3. un-div-inv 100.0%

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

   6. Applied egg-rr 100.0%

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

4. Final simplification 99.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(x \cdot 2\right) \cdot y}{x - y} \leq -5 \cdot 10^{+87}:\\ \;\;\;\;x \cdot \left(2 \cdot \frac{y}{x - y}\right)\\ \mathbf{elif}\;\frac{\left(x \cdot 2\right) \cdot y}{x - y} \leq -2 \cdot 10^{-288} \lor \neg \left(\frac{\left(x \cdot 2\right) \cdot y}{x - y} \leq 0\right) \land \frac{\left(x \cdot 2\right) \cdot y}{x - y} \leq 2 \cdot 10^{-54}:\\ \;\;\;\;\frac{\left(x \cdot 2\right) \cdot y}{x - y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot 2}{\frac{x - y}{y}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 92.9% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -3.2e+223) (not (<= x 2.9e+125)))
   (* 2.0 y)
   (/ (* x 2.0) (/ (- x y) y))))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -3.2e+223) || !(x <= 2.9e+125)) {
		tmp = 2.0 * y;
	} else {
		tmp = (x * 2.0) / ((x - y) / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-3.2d+223)) .or. (.not. (x <= 2.9d+125))) then
        tmp = 2.0d0 * y
    else
        tmp = (x * 2.0d0) / ((x - y) / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -3.2e+223) || !(x <= 2.9e+125)) {
		tmp = 2.0 * y;
	} else {
		tmp = (x * 2.0) / ((x - y) / y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -3.2e+223) or not (x <= 2.9e+125):
		tmp = 2.0 * y
	else:
		tmp = (x * 2.0) / ((x - y) / y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -3.2e+223) || !(x <= 2.9e+125))
		tmp = Float64(2.0 * y);
	else
		tmp = Float64(Float64(x * 2.0) / Float64(Float64(x - y) / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -3.2e+223) || ~((x <= 2.9e+125)))
		tmp = 2.0 * y;
	else
		tmp = (x * 2.0) / ((x - y) / y);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -3.2000000000000001e223 or 2.89999999999999993e125 < x

   1. Initial program 65.6%

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

      1. associate-/l* 65.3%

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

      2. associate-*l* 65.3%

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

   3. Simplified 65.3%

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

   5. Taylor expanded in x around inf 90.4%

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

      1. *-commutative 90.4%

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

   7. Simplified 90.4%

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

   if -3.2000000000000001e223 < x < 2.89999999999999993e125

   1. Initial program 82.9%

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

      1. associate-/l* 97.7%

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

      2. associate-*l* 97.7%

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

   3. Simplified 97.7%

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

      1. associate-*r* 97.7%

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

      2. clear-num 97.6%

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

      3. un-div-inv 97.7%

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

   6. Applied egg-rr 97.7%

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

4. Final simplification 96.3%

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

Alternative 3: 93.3% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -3e+223) (not (<= x 3e+125)))
   (* 2.0 y)
   (* x (* 2.0 (/ y (- x y))))))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -3e+223) || !(x <= 3e+125)) {
		tmp = 2.0 * y;
	} else {
		tmp = x * (2.0 * (y / (x - y)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-3d+223)) .or. (.not. (x <= 3d+125))) then
        tmp = 2.0d0 * y
    else
        tmp = x * (2.0d0 * (y / (x - y)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -3e+223) || !(x <= 3e+125)) {
		tmp = 2.0 * y;
	} else {
		tmp = x * (2.0 * (y / (x - y)));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -3e+223) or not (x <= 3e+125):
		tmp = 2.0 * y
	else:
		tmp = x * (2.0 * (y / (x - y)))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -3e+223) || !(x <= 3e+125))
		tmp = Float64(2.0 * y);
	else
		tmp = Float64(x * Float64(2.0 * Float64(y / Float64(x - y))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -3e+223) || ~((x <= 3e+125)))
		tmp = 2.0 * y;
	else
		tmp = x * (2.0 * (y / (x - y)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -3e+223], N[Not[LessEqual[x, 3e+125]], $MachinePrecision]], N[(2.0 * y), $MachinePrecision], N[(x * N[(2.0 * N[(y / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.00000000000000001e223 or 3.00000000000000015e125 < x

   1. Initial program 65.6%

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

      1. associate-/l* 65.3%

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

      2. associate-*l* 65.3%

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

   3. Simplified 65.3%

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

   5. Taylor expanded in x around inf 90.4%

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

      1. *-commutative 90.4%

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

   7. Simplified 90.4%

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

   if -3.00000000000000001e223 < x < 3.00000000000000015e125

   1. Initial program 82.9%

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

      1. associate-/l* 97.7%

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

      2. associate-*l* 97.7%

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

   3. Simplified 97.7%

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

4. Final simplification 96.3%

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

Alternative 4: 74.3% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -7e-109) (not (<= x 6.4e+44))) (* 2.0 y) (* x -2.0)))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -7e-109) || !(x <= 6.4e+44)) {
		tmp = 2.0 * y;
	} else {
		tmp = x * -2.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -7e-109) or not (x <= 6.4e+44):
		tmp = 2.0 * y
	else:
		tmp = x * -2.0
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -7e-109 or 6.40000000000000009e44 < x

   1. Initial program 76.7%

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

      1. associate-/l* 84.5%

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

      2. associate-*l* 84.5%

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

   3. Simplified 84.5%

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

   5. Taylor expanded in x around inf 73.6%

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

      1. *-commutative 73.6%

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

   7. Simplified 73.6%

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

   if -7e-109 < x < 6.40000000000000009e44

   1. Initial program 83.1%

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

      1. associate-/l* 100.0%

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

      2. associate-*l* 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 83.7%

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

4. Final simplification 78.1%

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

Alternative 5: 50.6% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ x \cdot -2 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x -2.0))

C

double code(double x, double y) {
	return x * -2.0;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * (-2.0d0)
end function

Java

public static double code(double x, double y) {
	return x * -2.0;
}

Python

def code(x, y):
	return x * -2.0

Julia

function code(x, y)
	return Float64(x * -2.0)
end

MATLAB

function tmp = code(x, y)
	tmp = x * -2.0;
end

Wolfram

code[x_, y_] := N[(x * -2.0), $MachinePrecision]

Derivation

1. Initial program 79.6%

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

   1. associate-/l* 91.4%

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

   2. associate-*l* 91.4%

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

3. Simplified 91.4%

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

5. Taylor expanded in y around inf 52.8%

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

Developer target: 99.4% accurate, 0.5× 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 2024097 
(FPCore (x y)
  :name "Linear.Projection:perspective from linear-1.19.1.3, B"
  :precision binary64

  :alt
  (if (< x -1.7210442634149447e+81) (* (/ (* 2.0 x) (- x y)) y) (if (< x 83645045635564430.0) (/ (* x 2.0) (/ (- x y) y)) (* (/ (* 2.0 x) (- x y)) y)))

  (/ (* (* x 2.0) y) (- x y)))