Average Error: 0.0 → 0.0
Time: 26.9s
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 r26194 = c;
        double r26195 = sinh(r26194);
        double r26196 = -2.9807307601812193e+165;
        double r26197 = 2.0;
        double r26198 = pow(r26196, r26197);
        double r26199 = r26194 - r26198;
        double r26200 = fmod(r26195, r26199);
        return r26200;
}
↓
double f(double c) {
        double r26201 = c;
        double r26202 = sinh(r26201);
        double r26203 = -2.9807307601812193e+165;
        double r26204 = 2.0;
        double r26205 = pow(r26203, r26204);
        double r26206 = r26201 - r26205;
        double r26207 = fmod(r26202, r26206);
        return r26207;
}

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