Average Error: 0.0 → 0.0
Time: 22.9s
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 r1065395 = c;
        double r1065396 = sinh(r1065395);
        double r1065397 = -2.9807307601812193e+165;
        double r1065398 = 2.0;
        double r1065399 = pow(r1065397, r1065398);
        double r1065400 = r1065395 - r1065399;
        double r1065401 = fmod(r1065396, r1065400);
        return r1065401;
}
↓
double f(double c) {
        double r1065402 = c;
        double r1065403 = sinh(r1065402);
        double r1065404 = -2.9807307601812193e+165;
        double r1065405 = r1065404 * r1065404;
        double r1065406 = r1065402 - r1065405;
        double r1065407 = fmod(r1065403, r1065406);
        return r1065407;
}

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