Average Error: 0.0 → 0.0
Time: 24.8s
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 r21605 = c;
        double r21606 = sinh(r21605);
        double r21607 = -2.9807307601812193e+165;
        double r21608 = 2.0;
        double r21609 = pow(r21607, r21608);
        double r21610 = r21605 - r21609;
        double r21611 = fmod(r21606, r21610);
        return r21611;
}
↓
double f(double c) {
        double r21612 = c;
        double r21613 = sinh(r21612);
        double r21614 = -2.9807307601812193e+165;
        double r21615 = 2.0;
        double r21616 = pow(r21614, r21615);
        double r21617 = r21612 - r21616;
        double r21618 = fmod(r21613, r21617);
        return r21618;
}

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