Average Error: 0.0 → 0.0
Time: 9.4s
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 r11195 = c;
        double r11196 = sinh(r11195);
        double r11197 = -2.9807307601812193e+165;
        double r11198 = 2.0;
        double r11199 = pow(r11197, r11198);
        double r11200 = r11195 - r11199;
        double r11201 = fmod(r11196, r11200);
        return r11201;
}
↓
double f(double c) {
        double r11202 = c;
        double r11203 = sinh(r11202);
        double r11204 = -2.9807307601812193e+165;
        double r11205 = 2.0;
        double r11206 = pow(r11204, r11205);
        double r11207 = r11202 - r11206;
        double r11208 = fmod(r11203, r11207);
        return r11208;
}

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