Average Error: 0.0 → 0.0
Time: 26.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 r957667 = c;
        double r957668 = sinh(r957667);
        double r957669 = -2.9807307601812193e+165;
        double r957670 = 2.0;
        double r957671 = pow(r957669, r957670);
        double r957672 = r957667 - r957671;
        double r957673 = fmod(r957668, r957672);
        return r957673;
}
↓
double f(double c) {
        double r957674 = c;
        double r957675 = sinh(r957674);
        double r957676 = -2.9807307601812193e+165;
        double r957677 = r957676 * r957676;
        double r957678 = r957674 - r957677;
        double r957679 = fmod(r957675, r957678);
        return r957679;
}

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