Average Error: 0.0 → 0.0
Time: 21.5s
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 r1004623 = c;
        double r1004624 = sinh(r1004623);
        double r1004625 = -2.9807307601812193e+165;
        double r1004626 = 2.0;
        double r1004627 = pow(r1004625, r1004626);
        double r1004628 = r1004623 - r1004627;
        double r1004629 = fmod(r1004624, r1004628);
        return r1004629;
}
↓
double f(double c) {
        double r1004630 = c;
        double r1004631 = sinh(r1004630);
        double r1004632 = -2.9807307601812193e+165;
        double r1004633 = r1004632 * r1004632;
        double r1004634 = r1004630 - r1004633;
        double r1004635 = fmod(r1004631, r1004634);
        return r1004635;
}

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