Average Error: 0.0 → 0.0
Time: 12.3s
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 r18957 = c;
        double r18958 = sinh(r18957);
        double r18959 = -2.9807307601812193e+165;
        double r18960 = 2.0;
        double r18961 = pow(r18959, r18960);
        double r18962 = r18957 - r18961;
        double r18963 = fmod(r18958, r18962);
        return r18963;
}
↓
double f(double c) {
        double r18964 = c;
        double r18965 = sinh(r18964);
        double r18966 = -2.9807307601812193e+165;
        double r18967 = 2.0;
        double r18968 = pow(r18966, r18967);
        double r18969 = r18964 - r18968;
        double r18970 = fmod(r18965, r18969);
        return r18970;
}

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