Average Error: 0.0 → 0.0
Time: 18.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 r509524 = c;
        double r509525 = sinh(r509524);
        double r509526 = -2.9807307601812193e+165;
        double r509527 = 2.0;
        double r509528 = pow(r509526, r509527);
        double r509529 = r509524 - r509528;
        double r509530 = fmod(r509525, r509529);
        return r509530;
}
↓
double f(double c) {
        double r509531 = c;
        double r509532 = sinh(r509531);
        double r509533 = -2.9807307601812193e+165;
        double r509534 = r509533 * r509533;
        double r509535 = r509531 - r509534;
        double r509536 = fmod(r509532, r509535);
        return r509536;
}

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