Average Error: 0.0 → 0.0
Time: 5.2s
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 r29469 = c;
        double r29470 = sinh(r29469);
        double r29471 = -2.9807307601812193e+165;
        double r29472 = 2.0;
        double r29473 = pow(r29471, r29472);
        double r29474 = r29469 - r29473;
        double r29475 = fmod(r29470, r29474);
        return r29475;
}
↓
double f(double c) {
        double r29476 = c;
        double r29477 = sinh(r29476);
        double r29478 = -2.9807307601812193e+165;
        double r29479 = 2.0;
        double r29480 = pow(r29478, r29479);
        double r29481 = r29476 - r29480;
        double r29482 = fmod(r29477, r29481);
        return r29482;
}

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 2019356 +o rules:numerics
(FPCore (c)
  :name "Random Jason Timeout Test 002"
  :precision binary64
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2))))