Average Error: 0.0 → 0.3
Time: 4.8s
Precision: 64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
↓
\[\left(\left(\mathsf{expm1}\left(\mathsf{log1p}\left(\sinh c\right)\right)\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)
↓
\left(\left(\mathsf{expm1}\left(\mathsf{log1p}\left(\sinh c\right)\right)\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)
double code(double c) {
	return fmod(sinh(c), (c - pow(-2.9807307601812193e+165, 2.0)));
}
↓
double code(double c) {
	return fmod(expm1(log1p(sinh(c))), (c - pow(-2.9807307601812193e+165, 2.0)));
}

Error

Bits error versus c

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
  2. Using strategy rm

  3. Applied expm1-log1p-u0.3

    \[\leadsto \left(\color{blue}{\left(\mathsf{expm1}\left(\mathsf{log1p}\left(\sinh c\right)\right)\right)} \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]

  4. Final simplification0.3

    \[\leadsto \left(\left(\mathsf{expm1}\left(\mathsf{log1p}\left(\sinh c\right)\right)\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]

Reproduce

herbie shell --seed 2020060 +o rules:numerics
(FPCore (c)
  :name "Random Jason Timeout Test 002"
  :precision binary64
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2))))