Average Error: 0.0 → 0.0
Time: 15.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 r12816 = c;
        double r12817 = sinh(r12816);
        double r12818 = -2.9807307601812193e+165;
        double r12819 = 2.0;
        double r12820 = pow(r12818, r12819);
        double r12821 = r12816 - r12820;
        double r12822 = fmod(r12817, r12821);
        return r12822;
}
↓
double f(double c) {
        double r12823 = c;
        double r12824 = sinh(r12823);
        double r12825 = -2.9807307601812193e+165;
        double r12826 = 2.0;
        double r12827 = pow(r12825, r12826);
        double r12828 = r12823 - r12827;
        double r12829 = fmod(r12824, r12828);
        return r12829;
}

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