Average Error: 0.0 → 0.0
Time: 4.4s
Precision: 64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)\]
↓
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)\]
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)
↓
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)
double f(double c) {
        double r25518 = c;
        double r25519 = sinh(r25518);
        double r25520 = -2.9807307601812193e+165;
        double r25521 = 2.0;
        double r25522 = pow(r25520, r25521);
        double r25523 = r25518 - r25522;
        double r25524 = fmod(r25519, r25523);
        return r25524;
}
↓
double f(double c) {
        double r25525 = c;
        double r25526 = sinh(r25525);
        double r25527 = -2.9807307601812193e+165;
        double r25528 = 2.0;
        double r25529 = pow(r25527, r25528);
        double r25530 = r25525 - r25529;
        double r25531 = fmod(r25526, r25530);
        return r25531;
}

Error

Bits error versus c

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

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