Linear.Quaternion:$ccos from linear-1.19.1.3

Percentage Accurate: 100.0% → 100.0%

Time: 13.4s

Alternatives: 8

Speedup: 1.0×

• 49.2% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\sin x \cdot \frac{\sinh y}{y} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 88.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\sinh y}{y} \leq 1.000000001:\\ \;\;\;\;\sin x\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot \sinh y}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (sinh y) y) 1.000000001) (sin x) (/ (* x (sinh y)) y)))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((Math.sinh(y) / y) <= 1.000000001) {
		tmp = Math.sin(x);
	} else {
		tmp = (x * Math.sinh(y)) / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (math.sinh(y) / y) <= 1.000000001:
		tmp = math.sin(x)
	else:
		tmp = (x * math.sinh(y)) / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(sinh(y) / y) <= 1.000000001)
		tmp = sin(x);
	else
		tmp = Float64(Float64(x * sinh(y)) / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((sinh(y) / y) <= 1.000000001)
		tmp = sin(x);
	else
		tmp = (x * sinh(y)) / y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (sinh.f64 y) y) < 1.0000000010000001

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 99.7%

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

   if 1.0000000010000001 < (/.f64 (sinh.f64 y) y)

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 76.3%

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

      1. associate-*r/ 76.3%

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

   5. Applied egg-rr 76.3%

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

Alternative 3: 88.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\sinh y}{y}\\ \mathbf{if}\;t\_0 \leq 1.000000001:\\ \;\;\;\;\sin x\\ \mathbf{else}:\\ \;\;\;\;x \cdot t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (sinh y) y))) (if (<= t_0 1.000000001) (sin x) (* x t_0))))

C

double code(double x, double y) {
	double t_0 = sinh(y) / y;
	double tmp;
	if (t_0 <= 1.000000001) {
		tmp = sin(x);
	} else {
		tmp = x * 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 = sinh(y) / y
    if (t_0 <= 1.000000001d0) then
        tmp = sin(x)
    else
        tmp = x * t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = Math.sinh(y) / y;
	double tmp;
	if (t_0 <= 1.000000001) {
		tmp = Math.sin(x);
	} else {
		tmp = x * t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = math.sinh(y) / y
	tmp = 0
	if t_0 <= 1.000000001:
		tmp = math.sin(x)
	else:
		tmp = x * t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(sinh(y) / y)
	tmp = 0.0
	if (t_0 <= 1.000000001)
		tmp = sin(x);
	else
		tmp = Float64(x * t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = sinh(y) / y;
	tmp = 0.0;
	if (t_0 <= 1.000000001)
		tmp = sin(x);
	else
		tmp = x * t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[Sinh[y], $MachinePrecision] / y), $MachinePrecision]}, If[LessEqual[t$95$0, 1.000000001], N[Sin[x], $MachinePrecision], N[(x * t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (sinh.f64 y) y) < 1.0000000010000001

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 99.7%

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

   if 1.0000000010000001 < (/.f64 (sinh.f64 y) y)

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 76.3%

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

Alternative 4: 55.6% accurate, 1.9× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= 620000.0) {
		tmp = sin(x);
	} else {
		tmp = x * (1.0 + (((x * (x * y)) / y) * -0.16666666666666666));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 620000.0d0) then
        tmp = sin(x)
    else
        tmp = x * (1.0d0 + (((x * (x * y)) / y) * (-0.16666666666666666d0)))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y):
	tmp = 0
	if y <= 620000.0:
		tmp = math.sin(x)
	else:
		tmp = x * (1.0 + (((x * (x * y)) / y) * -0.16666666666666666))
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.2e5

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 63.8%

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

   if 6.2e5 < y

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 2.7%

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

   4. Taylor expanded in x around 0 16.2%

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

      1. *-commutative 16.2%

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

   6. Simplified 16.2%

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

      1. unpow2 16.2%

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

      2. *-un-lft-identity 16.2%

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

      3. associate-*r* 16.2%

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

      4. *-inverses 16.2%

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

      5. associate-/l* 17.5%

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

      6. associate-*l/ 18.8%

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

      7. *-commutative 18.8%

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

   8. Applied egg-rr 18.8%

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

4. Final simplification 51.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 620000:\\ \;\;\;\;\sin x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 + \frac{x \cdot \left(x \cdot y\right)}{y} \cdot -0.16666666666666666\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 35.5% accurate, 11.4× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x 5.1e+218)
   (* x (+ 1.0 (* (/ (* x (* x y)) y) -0.16666666666666666)))
   (/ (* x y) y)))

C

double code(double x, double y) {
	double tmp;
	if (x <= 5.1e+218) {
		tmp = x * (1.0 + (((x * (x * y)) / y) * -0.16666666666666666));
	} else {
		tmp = (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 <= 5.1d+218) then
        tmp = x * (1.0d0 + (((x * (x * y)) / y) * (-0.16666666666666666d0)))
    else
        tmp = (x * y) / y
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 5.0999999999999999e218

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 47.4%

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

   4. Taylor expanded in x around 0 34.4%

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

      1. *-commutative 34.4%

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

   6. Simplified 34.4%

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

      1. unpow2 34.4%

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

      2. *-un-lft-identity 34.4%

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

      3. associate-*r* 34.4%

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

      4. *-inverses 34.4%

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

      5. associate-/l* 34.8%

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

      6. associate-*l/ 35.6%

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

      7. *-commutative 35.6%

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

   8. Applied egg-rr 35.6%

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

   if 5.0999999999999999e218 < x

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 35.7%

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

      1. associate-*r/ 35.7%

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

   5. Applied egg-rr 35.7%

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

   6. Taylor expanded in y around 0 31.1%

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

4. Final simplification 35.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 5.1 \cdot 10^{+218}:\\ \;\;\;\;x \cdot \left(1 + \frac{x \cdot \left(x \cdot y\right)}{y} \cdot -0.16666666666666666\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot y}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 34.2% accurate, 14.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x 5.1e+218)
   (* x (+ 1.0 (* -0.16666666666666666 (* x x))))
   (/ (* x y) y)))

C

double code(double x, double y) {
	double tmp;
	if (x <= 5.1e+218) {
		tmp = x * (1.0 + (-0.16666666666666666 * (x * x)));
	} else {
		tmp = (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 <= 5.1d+218) then
        tmp = x * (1.0d0 + ((-0.16666666666666666d0) * (x * x)))
    else
        tmp = (x * y) / y
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 5.0999999999999999e218

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 47.4%

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

   4. Taylor expanded in x around 0 34.4%

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

      1. *-commutative 34.4%

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

   6. Simplified 34.4%

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

      1. unpow2 34.4%

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

   8. Applied egg-rr 34.4%

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

   if 5.0999999999999999e218 < x

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 35.7%

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

      1. associate-*r/ 35.7%

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

   5. Applied egg-rr 35.7%

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

   6. Taylor expanded in y around 0 31.1%

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

4. Final simplification 34.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 5.1 \cdot 10^{+218}:\\ \;\;\;\;x \cdot \left(1 + -0.16666666666666666 \cdot \left(x \cdot x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot y}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 29.8% accurate, 20.5× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (if (<= x 5e+102) x (/ (* x y) y)))

C

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

Java

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

Python

def code(x, y):
	tmp = 0
	if x <= 5e+102:
		tmp = x
	else:
		tmp = (x * y) / y
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= 5e+102)
		tmp = x;
	else
		tmp = (x * y) / y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 5e102

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 47.1%

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

   4. Taylor expanded in x around 0 31.0%

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

   if 5e102 < x

   1. Initial program 100.0%

      \[\sin x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 28.7%

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

      1. associate-*r/ 28.7%

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

   5. Applied egg-rr 28.7%

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

   6. Taylor expanded in y around 0 18.6%

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

Alternative 8: 27.4% accurate, 205.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 100.0%

   \[\sin x \cdot \frac{\sinh y}{y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0 47.4%

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

4. Taylor expanded in x around 0 25.9%

   \[\leadsto \color{blue}{x} \]
5. Add Preprocessing

Reproduce

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