Average Error: 0.0 → 0.0
Time: 4.8s
Precision: 64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
↓
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)
↓
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)
double f(double c) {
        double r467 = c;
        double r468 = sinh(r467);
        double r469 = -2.9807307601812193e+165;
        double r470 = 2.0;
        double r471 = pow(r469, r470);
        double r472 = r467 - r471;
        double r473 = fmod(r468, r472);
        return r473;
}
↓
double f(double c) {
        double r474 = c;
        double r475 = sinh(r474);
        double r476 = -2.9807307601812193e+165;
        double r477 = 2.0;
        double r478 = pow(r476, r477);
        double r479 = r474 - r478;
        double r480 = fmod(r475, r479);
        return r480;
}

Error

Bits error versus c

Derivation

  1. Initial program 0.0

    \[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]

  2. Final simplification0.0

    \[\leadsto \left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (c)
  :name "Random Jason Timeout Test 014"
  :precision binary64
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2))))