Average Error: 0.0 → 0.0
Time: 3.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 r9831 = c;
        double r9832 = sinh(r9831);
        double r9833 = -2.9807307601812193e+165;
        double r9834 = 2.0;
        double r9835 = pow(r9833, r9834);
        double r9836 = r9831 - r9835;
        double r9837 = fmod(r9832, r9836);
        return r9837;
}
↓
double f(double c) {
        double r9838 = c;
        double r9839 = sinh(r9838);
        double r9840 = -2.9807307601812193e+165;
        double r9841 = 2.0;
        double r9842 = pow(r9840, r9841);
        double r9843 = r9838 - r9842;
        double r9844 = fmod(r9839, r9843);
        return r9844;
}

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