Average Error: 0.0 → 0.0
Time: 14.7s
Precision: 64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.9807307601812193 \cdot 10^{+165} \right)}^{2}\right)\right)\]
↓
\[\left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)\]
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.9807307601812193 \cdot 10^{+165} \right)}^{2}\right)\right)
↓
\left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)
double f(double c) {
        double r515705 = c;
        double r515706 = sinh(r515705);
        double r515707 = -2.9807307601812193e+165;
        double r515708 = 2.0;
        double r515709 = pow(r515707, r515708);
        double r515710 = r515705 - r515709;
        double r515711 = fmod(r515706, r515710);
        return r515711;
}
↓
double f(double c) {
        double r515712 = c;
        double r515713 = sinh(r515712);
        double r515714 = -2.9807307601812193e+165;
        double r515715 = r515714 * r515714;
        double r515716 = r515712 - r515715;
        double r515717 = fmod(r515713, r515716);
        return r515717;
}

Error

Bits error versus c

Derivation

  1. Initial program 0.0

    \[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.9807307601812193 \cdot 10^{+165} \right)}^{2}\right)\right)\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)}\]

  3. Final simplification0.0

    \[\leadsto \left(\left(\sinh c\right) \bmod \left(c - -2.9807307601812193 \cdot 10^{+165} \cdot -2.9807307601812193 \cdot 10^{+165}\right)\right)\]

Reproduce

herbie shell --seed 2019152 +o rules:numerics
(FPCore (c)
  :name "Random Jason Timeout Test 002"
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2))))