Average Error: 34.6 → 34.6
Time: 40.0s
Precision: 64
\[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
↓
\[{e}^{\left(\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}\right)}\]
\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)
↓
{e}^{\left(\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}\right)}
double f(double a, double c) {
        double r12258 = c;
        double r12259 = cosh(r12258);
        double r12260 = a;
        double r12261 = log1p(r12260);
        double r12262 = fmod(r12259, r12261);
        return r12262;
}
↓
double f(double a, double c) {
        double r12263 = exp(1.0);
        double r12264 = c;
        double r12265 = cosh(r12264);
        double r12266 = a;
        double r12267 = log1p(r12266);
        double r12268 = fmod(r12265, r12267);
        double r12269 = log(r12268);
        double r12270 = 3.0;
        double r12271 = pow(r12269, r12270);
        double r12272 = cbrt(r12271);
        double r12273 = pow(r12263, r12272);
        return r12273;
}

Error

Bits error versus a

Bits error versus c

Derivation

  1. Initial program 34.6

    \[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]
  2. Using strategy rm

  3. Applied add-exp-log34.6

    \[\leadsto \color{blue}{e^{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\]
  4. Using strategy rm

  5. Applied pow134.6

    \[\leadsto e^{\log \color{blue}{\left({\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}^{1}\right)}}\]

  6. Applied log-pow34.6

    \[\leadsto e^{\color{blue}{1 \cdot \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\]

  7. Applied exp-prod34.6

    \[\leadsto \color{blue}{{\left(e^{1}\right)}^{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}}\]

  8. Simplified34.6

    \[\leadsto {\color{blue}{e}}^{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}\]
  9. Using strategy rm

  10. Applied add-cbrt-cube34.6

    \[\leadsto {e}^{\color{blue}{\left(\sqrt[3]{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right) \cdot \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right) \cdot \log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}\right)}}\]

  11. Simplified34.6

    \[\leadsto {e}^{\left(\sqrt[3]{\color{blue}{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}}\right)}\]

  12. Final simplification34.6

    \[\leadsto {e}^{\left(\sqrt[3]{{\left(\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\right)}^{3}}\right)}\]

Reproduce

herbie shell --seed 2019326 +o rules:numerics
(FPCore (a c)
  :name "Random Jason Timeout Test 004"
  :precision binary64
  (fmod (cosh c) (log1p a)))