Linear.Projection:inversePerspective from linear-1.19.1.3, C

Percentage Accurate: 76.9% → 100.0%

Time: 4.1s

Alternatives: 5

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x + y}{\left(x \cdot 2\right) \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (+ x y) (* (* x 2.0) y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x + y) / ((x * 2.0) * y)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 76.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x + y}{\left(x \cdot 2\right) \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (+ x y) (* (* x 2.0) y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x + y) / ((x * 2.0) * y)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- (/ 0.5 y) (/ -0.5 x)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (0.5 / y) - (-0.5 / x)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 73.8%

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

3. Taylor expanded in y around inf

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

   1. +-commutative N/A

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

   2. remove-double-neg N/A

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

   3. associate-*r/ N/A

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

   4. metadata-eval N/A

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

   5. distribute-frac-neg2 N/A

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

   6. mul-1-neg N/A

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

   7. unsub-neg N/A

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

   8. lower--.f64 N/A

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

   9. associate-*r/ N/A

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

   10. metadata-eval N/A

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

   11. lower-/.f64 N/A

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

   12. mul-1-neg N/A

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

   13. distribute-frac-neg2 N/A

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

   14. distribute-neg-frac N/A

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

   15. metadata-eval N/A

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

   16. metadata-eval N/A

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

   17. lower-/.f64 N/A

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

   18. metadata-eval 100.0

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

5. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\frac{0.5}{y} - \frac{-0.5}{x}} \]
6. Add Preprocessing

Alternative 2: 68.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.75 \cdot 10^{+167}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{elif}\;x \leq -1.25 \cdot 10^{-182}:\\ \;\;\;\;\frac{y + x}{\left(2 \cdot x\right) \cdot y}\\ \mathbf{elif}\;x \leq -4.4 \cdot 10^{-201}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.75e+167)
   (/ 0.5 y)
   (if (<= x -1.25e-182)
     (/ (+ y x) (* (* 2.0 x) y))
     (if (<= x -4.4e-201) (/ 0.5 y) (/ 0.5 x)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.75e+167) {
		tmp = 0.5 / y;
	} else if (x <= -1.25e-182) {
		tmp = (y + x) / ((2.0 * x) * y);
	} else if (x <= -4.4e-201) {
		tmp = 0.5 / y;
	} else {
		tmp = 0.5 / 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.75d+167)) then
        tmp = 0.5d0 / y
    else if (x <= (-1.25d-182)) then
        tmp = (y + x) / ((2.0d0 * x) * y)
    else if (x <= (-4.4d-201)) then
        tmp = 0.5d0 / y
    else
        tmp = 0.5d0 / x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.75e+167) {
		tmp = 0.5 / y;
	} else if (x <= -1.25e-182) {
		tmp = (y + x) / ((2.0 * x) * y);
	} else if (x <= -4.4e-201) {
		tmp = 0.5 / y;
	} else {
		tmp = 0.5 / x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.75e+167:
		tmp = 0.5 / y
	elif x <= -1.25e-182:
		tmp = (y + x) / ((2.0 * x) * y)
	elif x <= -4.4e-201:
		tmp = 0.5 / y
	else:
		tmp = 0.5 / x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.75e+167)
		tmp = Float64(0.5 / y);
	elseif (x <= -1.25e-182)
		tmp = Float64(Float64(y + x) / Float64(Float64(2.0 * x) * y));
	elseif (x <= -4.4e-201)
		tmp = Float64(0.5 / y);
	else
		tmp = Float64(0.5 / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.75e+167)
		tmp = 0.5 / y;
	elseif (x <= -1.25e-182)
		tmp = (y + x) / ((2.0 * x) * y);
	elseif (x <= -4.4e-201)
		tmp = 0.5 / y;
	else
		tmp = 0.5 / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.75e+167], N[(0.5 / y), $MachinePrecision], If[LessEqual[x, -1.25e-182], N[(N[(y + x), $MachinePrecision] / N[(N[(2.0 * x), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -4.4e-201], N[(0.5 / y), $MachinePrecision], N[(0.5 / x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.74999999999999994e167 or -1.25000000000000006e-182 < x < -4.4e-201

   1. Initial program 52.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 78.0

         \[\leadsto \color{blue}{\frac{0.5}{y}} \]

   5. Applied rewrites 78.0%

      \[\leadsto \color{blue}{\frac{0.5}{y}} \]

   if -1.74999999999999994e167 < x < -1.25000000000000006e-182

   1. Initial program 86.4%

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

   if -4.4e-201 < x

   1. Initial program 72.6%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 54.2

         \[\leadsto \color{blue}{\frac{0.5}{x}} \]

   5. Applied rewrites 54.2%

      \[\leadsto \color{blue}{\frac{0.5}{x}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 66.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.75 \cdot 10^{+167}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{elif}\;x \leq -1.25 \cdot 10^{-182}:\\ \;\;\;\;\frac{y + x}{\left(2 \cdot x\right) \cdot y}\\ \mathbf{elif}\;x \leq -4.4 \cdot 10^{-201}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 67.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+163}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{elif}\;x \leq -1.25 \cdot 10^{-182}:\\ \;\;\;\;\left(y + x\right) \cdot \frac{0.5}{y \cdot x}\\ \mathbf{elif}\;x \leq -4.4 \cdot 10^{-201}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.45e+163)
   (/ 0.5 y)
   (if (<= x -1.25e-182)
     (* (+ y x) (/ 0.5 (* y x)))
     (if (<= x -4.4e-201) (/ 0.5 y) (/ 0.5 x)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.45e+163) {
		tmp = 0.5 / y;
	} else if (x <= -1.25e-182) {
		tmp = (y + x) * (0.5 / (y * x));
	} else if (x <= -4.4e-201) {
		tmp = 0.5 / y;
	} else {
		tmp = 0.5 / 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.45d+163)) then
        tmp = 0.5d0 / y
    else if (x <= (-1.25d-182)) then
        tmp = (y + x) * (0.5d0 / (y * x))
    else if (x <= (-4.4d-201)) then
        tmp = 0.5d0 / y
    else
        tmp = 0.5d0 / x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.45e+163) {
		tmp = 0.5 / y;
	} else if (x <= -1.25e-182) {
		tmp = (y + x) * (0.5 / (y * x));
	} else if (x <= -4.4e-201) {
		tmp = 0.5 / y;
	} else {
		tmp = 0.5 / x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.45e+163:
		tmp = 0.5 / y
	elif x <= -1.25e-182:
		tmp = (y + x) * (0.5 / (y * x))
	elif x <= -4.4e-201:
		tmp = 0.5 / y
	else:
		tmp = 0.5 / x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.45e+163)
		tmp = Float64(0.5 / y);
	elseif (x <= -1.25e-182)
		tmp = Float64(Float64(y + x) * Float64(0.5 / Float64(y * x)));
	elseif (x <= -4.4e-201)
		tmp = Float64(0.5 / y);
	else
		tmp = Float64(0.5 / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.45e+163)
		tmp = 0.5 / y;
	elseif (x <= -1.25e-182)
		tmp = (y + x) * (0.5 / (y * x));
	elseif (x <= -4.4e-201)
		tmp = 0.5 / y;
	else
		tmp = 0.5 / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.45e+163], N[(0.5 / y), $MachinePrecision], If[LessEqual[x, -1.25e-182], N[(N[(y + x), $MachinePrecision] * N[(0.5 / N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -4.4e-201], N[(0.5 / y), $MachinePrecision], N[(0.5 / x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.44999999999999999e163 or -1.25000000000000006e-182 < x < -4.4e-201

   1. Initial program 52.8%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 78.0

         \[\leadsto \color{blue}{\frac{0.5}{y}} \]

   5. Applied rewrites 78.0%

      \[\leadsto \color{blue}{\frac{0.5}{y}} \]

   if -1.44999999999999999e163 < x < -1.25000000000000006e-182

   1. Initial program 86.4%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

      9. associate-/r* N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower-/.f64 N/A

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

      13. metadata-eval N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 84.9

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

      16. lift-+.f64 N/A

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

      17. +-commutative N/A

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

      18. lower-+.f64 84.9

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

   4. Applied rewrites 84.9%

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

   if -4.4e-201 < x

   1. Initial program 72.6%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 54.2

         \[\leadsto \color{blue}{\frac{0.5}{x}} \]

   5. Applied rewrites 54.2%

      \[\leadsto \color{blue}{\frac{0.5}{x}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 65.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+163}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{elif}\;x \leq -1.25 \cdot 10^{-182}:\\ \;\;\;\;\left(y + x\right) \cdot \frac{0.5}{y \cdot x}\\ \mathbf{elif}\;x \leq -4.4 \cdot 10^{-201}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 62.3% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.4 \cdot 10^{-27}:\\ \;\;\;\;\frac{0.5}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{0.5}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= x -6.4e-27) (/ 0.5 y) (/ 0.5 x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -6.4e-27) {
		tmp = 0.5 / y;
	} else {
		tmp = 0.5 / 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 <= (-6.4d-27)) then
        tmp = 0.5d0 / y
    else
        tmp = 0.5d0 / x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -6.4e-27) {
		tmp = 0.5 / y;
	} else {
		tmp = 0.5 / x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -6.4e-27:
		tmp = 0.5 / y
	else:
		tmp = 0.5 / x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -6.4e-27)
		tmp = Float64(0.5 / y);
	else
		tmp = Float64(0.5 / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -6.4e-27)
		tmp = 0.5 / y;
	else
		tmp = 0.5 / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -6.4e-27], N[(0.5 / y), $MachinePrecision], N[(0.5 / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -6.39999999999999982e-27

   1. Initial program 70.1%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 76.3

         \[\leadsto \color{blue}{\frac{0.5}{y}} \]

   5. Applied rewrites 76.3%

      \[\leadsto \color{blue}{\frac{0.5}{y}} \]

   if -6.39999999999999982e-27 < x

   1. Initial program 75.0%

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

   3. Taylor expanded in y around inf

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

      1. lower-/.f64 57.4

         \[\leadsto \color{blue}{\frac{0.5}{x}} \]

   5. Applied rewrites 57.4%

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

Alternative 5: 50.8% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \frac{0.5}{x} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ 0.5 x))

C

double code(double x, double y) {
	return 0.5 / x;
}

Fortran

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

Java

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

Python

def code(x, y):
	return 0.5 / x

Julia

function code(x, y)
	return Float64(0.5 / x)
end

MATLAB

function tmp = code(x, y)
	tmp = 0.5 / x;
end

Wolfram

code[x_, y_] := N[(0.5 / x), $MachinePrecision]

Derivation

1. Initial program 73.8%

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

3. Taylor expanded in y around inf

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

   1. lower-/.f64 49.6

      \[\leadsto \color{blue}{\frac{0.5}{x}} \]

5. Applied rewrites 49.6%

   \[\leadsto \color{blue}{\frac{0.5}{x}} \]
6. Add Preprocessing

Developer Target 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024268 
(FPCore (x y)
  :name "Linear.Projection:inversePerspective from linear-1.19.1.3, C"
  :precision binary64

  :alt
  (! :herbie-platform default (+ (/ 1/2 x) (/ 1/2 y)))

  (/ (+ x y) (* (* x 2.0) y)))