Average Error: 33.9 → 33.9
Time: 13.7s
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 code(double a, double c) {
	return ((double) fmod(((double) cosh(c)), ((double) log1p(a))));
}
↓
double code(double a, double c) {
	return ((double) pow(((double) M_E), ((double) cbrt(((double) pow(((double) log(((double) fmod(((double) cosh(c)), ((double) log1p(a)))))), 3.0))))));
}

Error

Bits error versus a

Bits error versus c

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 33.9

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

  3. Applied add-exp-log33.9

    \[\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 pow133.9

    \[\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-pow33.9

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

  7. Applied exp-prod33.9

    \[\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. Simplified33.9

    \[\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-cube33.9

    \[\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. Simplified33.9

    \[\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 simplification33.9

    \[\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 2020140 
(FPCore (a c)
  :name "Random Jason Timeout Test 004"
  :precision binary64
  (fmod (cosh c) (log1p a)))