Average Error: 0.0 → 0.0
Time: 4.0s
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 r6536 = c;
        double r6537 = sinh(r6536);
        double r6538 = -2.9807307601812193e+165;
        double r6539 = 2.0;
        double r6540 = pow(r6538, r6539);
        double r6541 = r6536 - r6540;
        double r6542 = fmod(r6537, r6541);
        return r6542;
}
↓
double f(double c) {
        double r6543 = c;
        double r6544 = sinh(r6543);
        double r6545 = -2.9807307601812193e+165;
        double r6546 = 2.0;
        double r6547 = pow(r6545, r6546);
        double r6548 = r6543 - r6547;
        double r6549 = fmod(r6544, r6548);
        return r6549;
}

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