Average Error: 0.0 → 0.0
Time: 4.6s
Precision: 64
\[\left(\left(\sinh c\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(\sinh c\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)
double f(double c) {
        double r991 = c;
        double r992 = sinh(r991);
        double r993 = -2.9807307601812193e+165;
        double r994 = 2.0;
        double r995 = pow(r993, r994);
        double r996 = r991 - r995;
        double r997 = fmod(r992, r996);
        return r997;
}
↓
double f(double c) {
        double r998 = c;
        double r999 = sinh(r998);
        double r1000 = -2.9807307601812193e+165;
        double r1001 = 2.0;
        double r1002 = pow(r1000, r1001);
        double r1003 = r998 - r1002;
        double r1004 = fmod(r999, r1003);
        return r1004;
}

Error

Bits error versus c

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. Final simplification0.0

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

Reproduce

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