Average Error: 0.0 → 0.0
Time: 24.8s
Precision: 64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)\]
↓
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)\]
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)
↓
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)
double f(double c) {
        double r21275 = c;
        double r21276 = sinh(r21275);
        double r21277 = -2.9807307601812193e+165;
        double r21278 = 2.0;
        double r21279 = pow(r21277, r21278);
        double r21280 = r21275 - r21279;
        double r21281 = fmod(r21276, r21280);
        return r21281;
}
↓
double f(double c) {
        double r21282 = c;
        double r21283 = sinh(r21282);
        double r21284 = -2.9807307601812193e+165;
        double r21285 = 2.0;
        double r21286 = pow(r21284, r21285);
        double r21287 = r21282 - r21286;
        double r21288 = fmod(r21283, r21287);
        return r21288;
}

Error

Bits error versus c

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

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