Average Error: 0.0 → 0.0
Time: 5.5s
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 r28820 = c;
        double r28821 = sinh(r28820);
        double r28822 = -2.9807307601812193e+165;
        double r28823 = 2.0;
        double r28824 = pow(r28822, r28823);
        double r28825 = r28820 - r28824;
        double r28826 = fmod(r28821, r28825);
        return r28826;
}
↓
double f(double c) {
        double r28827 = c;
        double r28828 = sinh(r28827);
        double r28829 = -2.9807307601812193e+165;
        double r28830 = 2.0;
        double r28831 = pow(r28829, r28830);
        double r28832 = r28827 - r28831;
        double r28833 = fmod(r28828, r28832);
        return r28833;
}

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