Average Error: 0.0 → 0.0
Time: 22.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 r27914 = c;
        double r27915 = sinh(r27914);
        double r27916 = -2.9807307601812193e+165;
        double r27917 = 2.0;
        double r27918 = pow(r27916, r27917);
        double r27919 = r27914 - r27918;
        double r27920 = fmod(r27915, r27919);
        return r27920;
}
↓
double f(double c) {
        double r27921 = c;
        double r27922 = sinh(r27921);
        double r27923 = -2.9807307601812193e+165;
        double r27924 = 2.0;
        double r27925 = pow(r27923, r27924);
        double r27926 = r27921 - r27925;
        double r27927 = fmod(r27922, r27926);
        return r27927;
}

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