Average Error: 0.0 → 0.0
Time: 16.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 r531472 = c;
        double r531473 = sinh(r531472);
        double r531474 = -2.9807307601812193e+165;
        double r531475 = 2.0;
        double r531476 = pow(r531474, r531475);
        double r531477 = r531472 - r531476;
        double r531478 = fmod(r531473, r531477);
        return r531478;
}
↓
double f(double c) {
        double r531479 = c;
        double r531480 = sinh(r531479);
        double r531481 = -2.9807307601812193e+165;
        double r531482 = r531481 * r531481;
        double r531483 = r531479 - r531482;
        double r531484 = fmod(r531480, r531483);
        return r531484;
}

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