Average Error: 0.0 → 0.0
Time: 4.9s
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 r476 = c;
        double r477 = sinh(r476);
        double r478 = -2.9807307601812193e+165;
        double r479 = 2.0;
        double r480 = pow(r478, r479);
        double r481 = r476 - r480;
        double r482 = fmod(r477, r481);
        return r482;
}
↓
double f(double c) {
        double r483 = c;
        double r484 = sinh(r483);
        double r485 = -2.9807307601812193e+165;
        double r486 = 2.0;
        double r487 = pow(r485, r486);
        double r488 = r483 - r487;
        double r489 = fmod(r484, r488);
        return r489;
}

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