Average Error: 0.0 → 0.0
Time: 23.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 r21281 = c;
        double r21282 = sinh(r21281);
        double r21283 = -2.9807307601812193e+165;
        double r21284 = 2.0;
        double r21285 = pow(r21283, r21284);
        double r21286 = r21281 - r21285;
        double r21287 = fmod(r21282, r21286);
        return r21287;
}
↓
double f(double c) {
        double r21288 = c;
        double r21289 = sinh(r21288);
        double r21290 = -2.9807307601812193e+165;
        double r21291 = 2.0;
        double r21292 = pow(r21290, r21291);
        double r21293 = r21288 - r21292;
        double r21294 = fmod(r21289, r21293);
        return r21294;
}

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))))