Average Error: 0.0 → 0.0
Time: 5.3s
Precision: 64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
↓
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)\]
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)
↓
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.98073076018121927 \cdot 10^{165} \right)}^{2}\right)\right)
double f(double c) {
        double r23075 = c;
        double r23076 = sinh(r23075);
        double r23077 = -2.9807307601812193e+165;
        double r23078 = 2.0;
        double r23079 = pow(r23077, r23078);
        double r23080 = r23075 - r23079;
        double r23081 = fmod(r23076, r23080);
        return r23081;
}
↓
double f(double c) {
        double r23082 = c;
        double r23083 = sinh(r23082);
        double r23084 = -2.9807307601812193e+165;
        double r23085 = 2.0;
        double r23086 = pow(r23084, r23085);
        double r23087 = r23082 - r23086;
        double r23088 = fmod(r23083, r23087);
        return r23088;
}

Error

Bits error versus c

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

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