Linear.Quaternion:$cexp from linear-1.19.1.3

Percentage Accurate: 99.8% → 99.8%

Time: 8.4s

Alternatives: 7

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ x \cdot \frac{\sin y}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (/ (sin y) y)))

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return x * (Math.sin(y) / y);
}

Python

def code(x, y):
	return x * (math.sin(y) / y)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \frac{\sin y}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (/ (sin y) y)))

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return x * (Math.sin(y) / y);
}

Python

def code(x, y):
	return x * (math.sin(y) / y)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \frac{\sin y}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (/ (sin y) y)))

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return x * (Math.sin(y) / y);
}

Python

def code(x, y):
	return x * (math.sin(y) / y)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[x \cdot \frac{\sin y}{y} \]

2. Final simplification 99.8%

   \[\leadsto x \cdot \frac{\sin y}{y} \]

Alternative 2: 57.8% accurate, 9.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 190000000:\\ \;\;\;\;x \cdot \left(1 + y \cdot \left(y \cdot -0.16666666666666666\right)\right)\\ \mathbf{else}:\\ \;\;\;\;6 \cdot \frac{x}{y \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 190000000.0)
   (* x (+ 1.0 (* y (* y -0.16666666666666666))))
   (* 6.0 (/ x (* y y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 190000000.0) {
		tmp = x * (1.0 + (y * (y * -0.16666666666666666)));
	} else {
		tmp = 6.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 (y <= 190000000.0d0) then
        tmp = x * (1.0d0 + (y * (y * (-0.16666666666666666d0))))
    else
        tmp = 6.0d0 * (x / (y * y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 190000000.0) {
		tmp = x * (1.0 + (y * (y * -0.16666666666666666)));
	} else {
		tmp = 6.0 * (x / (y * y));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 190000000.0:
		tmp = x * (1.0 + (y * (y * -0.16666666666666666)))
	else:
		tmp = 6.0 * (x / (y * y))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 190000000.0)
		tmp = Float64(x * Float64(1.0 + Float64(y * Float64(y * -0.16666666666666666))));
	else
		tmp = Float64(6.0 * Float64(x / Float64(y * y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 190000000.0)
		tmp = x * (1.0 + (y * (y * -0.16666666666666666)));
	else
		tmp = 6.0 * (x / (y * y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 190000000.0], N[(x * N[(1.0 + N[(y * N[(y * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(6.0 * N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.9e8

   1. Initial program 99.9%

      \[x \cdot \frac{\sin y}{y} \]
   2. Step-by-step derivation

      1. clear-num 99.8%

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

      2. associate-/r/ 99.7%

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

   3. Applied egg-rr 99.7%

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

   4. Taylor expanded in y around 0 71.4%

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

      1. *-commutative 71.4%

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

      2. unpow2 71.4%

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

      3. associate-*r* 71.4%

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

   6. Simplified 71.4%

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

   if 1.9e8 < y

   1. Initial program 99.6%

      \[x \cdot \frac{\sin y}{y} \]
   2. Step-by-step derivation

      1. clear-num 99.6%

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

      2. un-div-inv 99.5%

         \[\leadsto \color{blue}{\frac{x}{\frac{y}{\sin y}}} \]

   3. Applied egg-rr 99.5%

      \[\leadsto \color{blue}{\frac{x}{\frac{y}{\sin y}}} \]

   4. Taylor expanded in y around 0 34.5%

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

      1. unpow2 34.5%

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

   6. Simplified 34.5%

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

   7. Taylor expanded in y around inf 34.5%

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

      1. unpow2 34.5%

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

   9. Simplified 34.5%

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

4. Final simplification 60.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 190000000:\\ \;\;\;\;x \cdot \left(1 + y \cdot \left(y \cdot -0.16666666666666666\right)\right)\\ \mathbf{else}:\\ \;\;\;\;6 \cdot \frac{x}{y \cdot y}\\ \end{array} \]

Alternative 3: 58.1% accurate, 11.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 2.45:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;6 \cdot \frac{x}{y \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 2.45) x (* 6.0 (/ x (* y y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 2.45) {
		tmp = x;
	} else {
		tmp = 6.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 (y <= 2.45d0) then
        tmp = x
    else
        tmp = 6.0d0 * (x / (y * y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 2.45) {
		tmp = x;
	} else {
		tmp = 6.0 * (x / (y * y));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 2.45:
		tmp = x
	else:
		tmp = 6.0 * (x / (y * y))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 2.45)
		tmp = x;
	else
		tmp = Float64(6.0 * Float64(x / Float64(y * y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 2.45)
		tmp = x;
	else
		tmp = 6.0 * (x / (y * y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 2.45], x, N[(6.0 * N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.4500000000000002

   1. Initial program 99.9%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in y around 0 71.5%

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

   if 2.4500000000000002 < y

   1. Initial program 99.6%

      \[x \cdot \frac{\sin y}{y} \]
   2. Step-by-step derivation

      1. clear-num 99.6%

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

      2. un-div-inv 99.5%

         \[\leadsto \color{blue}{\frac{x}{\frac{y}{\sin y}}} \]

   3. Applied egg-rr 99.5%

      \[\leadsto \color{blue}{\frac{x}{\frac{y}{\sin y}}} \]

   4. Taylor expanded in y around 0 34.5%

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

      1. unpow2 34.5%

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

   6. Simplified 34.5%

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

   7. Taylor expanded in y around inf 34.5%

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

      1. unpow2 34.5%

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

   9. Simplified 34.5%

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

4. Final simplification 60.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 2.45:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;6 \cdot \frac{x}{y \cdot y}\\ \end{array} \]

Alternative 4: 64.2% accurate, 11.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (/ x (+ 1.0 (* 0.16666666666666666 (* y y)))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[x \cdot \frac{\sin y}{y} \]
2. Step-by-step derivation

   1. clear-num 99.8%

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

   2. un-div-inv 99.7%

      \[\leadsto \color{blue}{\frac{x}{\frac{y}{\sin y}}} \]

3. Applied egg-rr 99.7%

   \[\leadsto \color{blue}{\frac{x}{\frac{y}{\sin y}}} \]

4. Taylor expanded in y around 0 64.2%

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

   1. unpow2 64.2%

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

6. Simplified 64.2%

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

7. Final simplification 64.2%

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

Alternative 5: 57.4% accurate, 14.9× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= y 8e-20) x (* y (/ x y))))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 8e-20) {
		tmp = x;
	} else {
		tmp = y * (x / y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 8e-20:
		tmp = x
	else:
		tmp = y * (x / y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 8e-20)
		tmp = x;
	else
		tmp = Float64(y * Float64(x / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 8e-20)
		tmp = x;
	else
		tmp = y * (x / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 8e-20], x, N[(y * N[(x / y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 7.99999999999999956e-20

   1. Initial program 99.9%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in y around 0 71.9%

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

   if 7.99999999999999956e-20 < y

   1. Initial program 99.6%

      \[x \cdot \frac{\sin y}{y} \]
   2. Step-by-step derivation

      1. *-commutative 99.6%

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

      2. associate-*l/ 99.5%

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

      3. clear-num 97.8%

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

   3. Applied egg-rr 97.8%

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

   4. Taylor expanded in y around 0 6.4%

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

      1. clear-num 6.4%

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

      2. *-inverses 6.4%

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

      3. associate-/l* 6.3%

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

      4. *-commutative 6.3%

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

      5. clear-num 6.3%

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

      6. associate-/r/ 6.3%

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

      7. *-commutative 6.3%

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

      8. associate-*r* 32.7%

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

      9. associate-*l/ 32.7%

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

      10. *-un-lft-identity 32.7%

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

   6. Applied egg-rr 32.7%

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

4. Final simplification 59.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 8 \cdot 10^{-20}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{x}{y}\\ \end{array} \]

Alternative 6: 57.8% accurate, 14.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 10^{+17}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{y}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 1e+17) x (/ y (/ y x))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 1e+17) {
		tmp = x;
	} else {
		tmp = y / (y / x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 1d+17) then
        tmp = x
    else
        tmp = y / (y / x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 1e+17) {
		tmp = x;
	} else {
		tmp = y / (y / x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 1e+17:
		tmp = x
	else:
		tmp = y / (y / x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 1e+17)
		tmp = x;
	else
		tmp = Float64(y / Float64(y / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 1e+17)
		tmp = x;
	else
		tmp = y / (y / x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 1e+17], x, N[(y / N[(y / x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1e17

   1. Initial program 99.9%

      \[x \cdot \frac{\sin y}{y} \]

   2. Taylor expanded in y around 0 69.8%

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

   if 1e17 < y

   1. Initial program 99.6%

      \[x \cdot \frac{\sin y}{y} \]
   2. Step-by-step derivation

      1. *-commutative 99.6%

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

      2. associate-*l/ 99.6%

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

      3. clear-num 97.5%

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

   3. Applied egg-rr 97.5%

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

   4. Taylor expanded in y around 0 4.4%

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

      1. clear-num 4.4%

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

      2. *-inverses 4.4%

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

      3. associate-/l* 4.3%

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

      4. *-commutative 4.3%

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

      5. clear-num 4.3%

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

      6. associate-/r/ 4.3%

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

      7. *-commutative 4.3%

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

      8. associate-*r* 33.7%

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

      9. associate-*l/ 33.7%

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

      10. *-un-lft-identity 33.7%

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

   6. Applied egg-rr 33.7%

      \[\leadsto \color{blue}{\frac{x}{y} \cdot y} \]
   7. Step-by-step derivation

      1. *-commutative 33.7%

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

      2. clear-num 35.3%

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

      3. un-div-inv 35.3%

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

   8. Applied egg-rr 35.3%

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

4. Final simplification 60.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 10^{+17}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{y}{x}}\\ \end{array} \]

Alternative 7: 52.3% accurate, 105.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 x)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

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

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 99.8%

   \[x \cdot \frac{\sin y}{y} \]

2. Taylor expanded in y around 0 51.9%

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

3. Final simplification 51.9%

   \[\leadsto x \]

Reproduce

herbie shell --seed 2023287 
(FPCore (x y)
  :name "Linear.Quaternion:$cexp from linear-1.19.1.3"
  :precision binary64
  (* x (/ (sin y) y)))