Average Error: 0.0 → 0.0
Time: 25.2s
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 r820590 = c;
        double r820591 = sinh(r820590);
        double r820592 = -2.9807307601812193e+165;
        double r820593 = 2.0;
        double r820594 = pow(r820592, r820593);
        double r820595 = r820590 - r820594;
        double r820596 = fmod(r820591, r820595);
        return r820596;
}
↓
double f(double c) {
        double r820597 = c;
        double r820598 = sinh(r820597);
        double r820599 = -2.9807307601812193e+165;
        double r820600 = r820599 * r820599;
        double r820601 = r820597 - r820600;
        double r820602 = fmod(r820598, r820601);
        return r820602;
}

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