Average Error: 0.0 → 0.0
Time: 1.1m
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 r1829019 = c;
        double r1829020 = sinh(r1829019);
        double r1829021 = -2.9807307601812193e+165;
        double r1829022 = 2.0;
        double r1829023 = pow(r1829021, r1829022);
        double r1829024 = r1829019 - r1829023;
        double r1829025 = fmod(r1829020, r1829024);
        return r1829025;
}
↓
double f(double c) {
        double r1829026 = c;
        double r1829027 = sinh(r1829026);
        double r1829028 = -2.9807307601812193e+165;
        double r1829029 = 2.0;
        double r1829030 = pow(r1829028, r1829029);
        double r1829031 = r1829026 - r1829030;
        double r1829032 = fmod(r1829027, r1829031);
        return r1829032;
}

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