Linear.Projection:perspective from linear-1.19.1.3, B

Percentage Accurate: 76.1% → 94.0%

Time: 7.9s

Alternatives: 4

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: 76.1% 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: 94.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \frac{x}{\frac{x - y}{2}}\\ \mathbf{if}\;x \leq -4.4 \cdot 10^{-112}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-177}:\\ \;\;\;\;x \cdot -2\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (/ x (/ (- x y) 2.0)))))
   (if (<= x -4.4e-112) t_0 (if (<= x 3.8e-177) (* x -2.0) t_0))))

C

double code(double x, double y) {
	double t_0 = y * (x / ((x - y) / 2.0));
	double tmp;
	if (x <= -4.4e-112) {
		tmp = t_0;
	} else if (x <= 3.8e-177) {
		tmp = x * -2.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 = y * (x / ((x - y) / 2.0d0))
    if (x <= (-4.4d-112)) then
        tmp = t_0
    else if (x <= 3.8d-177) then
        tmp = x * (-2.0d0)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = y * (x / ((x - y) / 2.0));
	double tmp;
	if (x <= -4.4e-112) {
		tmp = t_0;
	} else if (x <= 3.8e-177) {
		tmp = x * -2.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = y * (x / ((x - y) / 2.0))
	tmp = 0
	if x <= -4.4e-112:
		tmp = t_0
	elif x <= 3.8e-177:
		tmp = x * -2.0
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(y * Float64(x / Float64(Float64(x - y) / 2.0)))
	tmp = 0.0
	if (x <= -4.4e-112)
		tmp = t_0;
	elseif (x <= 3.8e-177)
		tmp = Float64(x * -2.0);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = y * (x / ((x - y) / 2.0));
	tmp = 0.0;
	if (x <= -4.4e-112)
		tmp = t_0;
	elseif (x <= 3.8e-177)
		tmp = x * -2.0;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(y * N[(x / N[(N[(x - y), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -4.4e-112], t$95$0, If[LessEqual[x, 3.8e-177], N[(x * -2.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -4.40000000000000042e-112 or 3.80000000000000004e-177 < x

   1. Initial program 82.5%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \color{blue}{\left(\frac{2}{x - y}\right)}\right)\right) \]

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \color{blue}{\left(x - y\right)}\right)\right)\right) \]

      7. --lowering--.f64 99.1%

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \mathsf{\_.f64}\left(x, \color{blue}{y}\right)\right)\right)\right) \]

   3. Simplified 99.1%

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 N/A

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

      3. clear-num N/A

         \[\leadsto \mathsf{*.f64}\left(\left(x \cdot \frac{1}{\frac{x - y}{2}}\right), y\right) \]

      4. un-div-inv N/A

         \[\leadsto \mathsf{*.f64}\left(\left(\frac{x}{\frac{x - y}{2}}\right), y\right) \]

      5. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(x, \left(\frac{x - y}{2}\right)\right), y\right) \]

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(x, \mathsf{/.f64}\left(\left(x - y\right), 2\right)\right), y\right) \]

      7. --lowering--.f64 99.4%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(x, y\right), 2\right)\right), y\right) \]

   6. Applied egg-rr 99.4%

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

   if -4.40000000000000042e-112 < x < 3.80000000000000004e-177

   1. Initial program 68.2%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \color{blue}{\left(\frac{2}{x - y}\right)}\right)\right) \]

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \color{blue}{\left(x - y\right)}\right)\right)\right) \]

      7. --lowering--.f64 56.9%

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \mathsf{\_.f64}\left(x, \color{blue}{y}\right)\right)\right)\right) \]

   3. Simplified 56.9%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 87.9%

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{-2}\right) \]

   7. Simplified 87.9%

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

4. Final simplification 96.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{-112}:\\ \;\;\;\;y \cdot \frac{x}{\frac{x - y}{2}}\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-177}:\\ \;\;\;\;x \cdot -2\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{\frac{x - y}{2}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 93.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(x \cdot \frac{2}{x - y}\right)\\ \mathbf{if}\;x \leq -8.5 \cdot 10^{-110}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 9.2 \cdot 10^{-157}:\\ \;\;\;\;x \cdot -2\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* x (/ 2.0 (- x y))))))
   (if (<= x -8.5e-110) t_0 (if (<= x 9.2e-157) (* x -2.0) t_0))))

C

double code(double x, double y) {
	double t_0 = y * (x * (2.0 / (x - y)));
	double tmp;
	if (x <= -8.5e-110) {
		tmp = t_0;
	} else if (x <= 9.2e-157) {
		tmp = x * -2.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 = y * (x * (2.0d0 / (x - y)))
    if (x <= (-8.5d-110)) then
        tmp = t_0
    else if (x <= 9.2d-157) then
        tmp = x * (-2.0d0)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = y * (x * (2.0 / (x - y)));
	double tmp;
	if (x <= -8.5e-110) {
		tmp = t_0;
	} else if (x <= 9.2e-157) {
		tmp = x * -2.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = y * (x * (2.0 / (x - y)))
	tmp = 0
	if x <= -8.5e-110:
		tmp = t_0
	elif x <= 9.2e-157:
		tmp = x * -2.0
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(y * Float64(x * Float64(2.0 / Float64(x - y))))
	tmp = 0.0
	if (x <= -8.5e-110)
		tmp = t_0;
	elseif (x <= 9.2e-157)
		tmp = Float64(x * -2.0);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = y * (x * (2.0 / (x - y)));
	tmp = 0.0;
	if (x <= -8.5e-110)
		tmp = t_0;
	elseif (x <= 9.2e-157)
		tmp = x * -2.0;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(y * N[(x * N[(2.0 / N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -8.5e-110], t$95$0, If[LessEqual[x, 9.2e-157], N[(x * -2.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -8.50000000000000029e-110 or 9.19999999999999954e-157 < x

   1. Initial program 82.1%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \color{blue}{\left(\frac{2}{x - y}\right)}\right)\right) \]

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \color{blue}{\left(x - y\right)}\right)\right)\right) \]

      7. --lowering--.f64 99.1%

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \mathsf{\_.f64}\left(x, \color{blue}{y}\right)\right)\right)\right) \]

   3. Simplified 99.1%

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

   if -8.50000000000000029e-110 < x < 9.19999999999999954e-157

   1. Initial program 70.6%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \color{blue}{\left(\frac{2}{x - y}\right)}\right)\right) \]

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \color{blue}{\left(x - y\right)}\right)\right)\right) \]

      7. --lowering--.f64 60.1%

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \mathsf{\_.f64}\left(x, \color{blue}{y}\right)\right)\right)\right) \]

   3. Simplified 60.1%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 88.8%

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{-2}\right) \]

   7. Simplified 88.8%

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

Alternative 3: 74.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.35 \cdot 10^{+24}:\\ \;\;\;\;x \cdot -2\\ \mathbf{elif}\;y \leq 5.4 \cdot 10^{+42}:\\ \;\;\;\;y \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -1.35e+24) (* x -2.0) (if (<= y 5.4e+42) (* y 2.0) (* x -2.0))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -1.35e+24) {
		tmp = x * -2.0;
	} else if (y <= 5.4e+42) {
		tmp = y * 2.0;
	} 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 (y <= (-1.35d+24)) then
        tmp = x * (-2.0d0)
    else if (y <= 5.4d+42) then
        tmp = y * 2.0d0
    else
        tmp = x * (-2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -1.35e+24) {
		tmp = x * -2.0;
	} else if (y <= 5.4e+42) {
		tmp = y * 2.0;
	} else {
		tmp = x * -2.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -1.35e+24:
		tmp = x * -2.0
	elif y <= 5.4e+42:
		tmp = y * 2.0
	else:
		tmp = x * -2.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -1.35e+24)
		tmp = Float64(x * -2.0);
	elseif (y <= 5.4e+42)
		tmp = Float64(y * 2.0);
	else
		tmp = Float64(x * -2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -1.35e+24)
		tmp = x * -2.0;
	elseif (y <= 5.4e+42)
		tmp = y * 2.0;
	else
		tmp = x * -2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -1.35e+24], N[(x * -2.0), $MachinePrecision], If[LessEqual[y, 5.4e+42], N[(y * 2.0), $MachinePrecision], N[(x * -2.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.35e24 or 5.4000000000000001e42 < y

   1. Initial program 75.8%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \color{blue}{\left(\frac{2}{x - y}\right)}\right)\right) \]

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \color{blue}{\left(x - y\right)}\right)\right)\right) \]

      7. --lowering--.f64 77.0%

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \mathsf{\_.f64}\left(x, \color{blue}{y}\right)\right)\right)\right) \]

   3. Simplified 77.0%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. *-lowering-*.f64 80.0%

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{-2}\right) \]

   7. Simplified 80.0%

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

   if -1.35e24 < y < 5.4000000000000001e42

   1. Initial program 82.0%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \color{blue}{\left(\frac{2}{x - y}\right)}\right)\right) \]

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \color{blue}{\left(x - y\right)}\right)\right)\right) \]

      7. --lowering--.f64 99.7%

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \mathsf{\_.f64}\left(x, \color{blue}{y}\right)\right)\right)\right) \]

   3. Simplified 99.7%

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

   5. Taylor expanded in x around inf

      \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{2}\right) \]
   6. Step-by-step derivation

   7. Simplified 76.0%

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

Alternative 4: 50.8% 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.1%

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

   1. *-commutative N/A

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

   2. associate-/l* N/A

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

   3. *-lowering-*.f64 N/A

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

   4. associate-/l* N/A

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

   5. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \color{blue}{\left(\frac{2}{x - y}\right)}\right)\right) \]

   6. /-lowering-/.f64 N/A

      \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \color{blue}{\left(x - y\right)}\right)\right)\right) \]

   7. --lowering--.f64 89.2%

      \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(x, \mathsf{/.f64}\left(2, \mathsf{\_.f64}\left(x, \color{blue}{y}\right)\right)\right)\right) \]

3. Simplified 89.2%

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

5. Taylor expanded in y around inf

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

   1. *-commutative N/A

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

   2. *-lowering-*.f64 50.3%

      \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{-2}\right) \]

7. Simplified 50.3%

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

Developer Target 1: 99.5% 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 2024138 
(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)))