Random Jason Timeout Test 004

Average Error: 33.9 → 33.9

Time: 38.6s

Precision: 64

• could not determine a ground truth for program body

  1. a = -1.3952531104493216e-235
  2. c = 1.242935524573972e+38

Math

\[\left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)\]

↓

\[\sqrt{e^{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt{e^{\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right) \cdot \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)}}}\]

C

double f(double a, double c) {
        double r1124756 = c;
        double r1124757 = cosh(r1124756);
        double r1124758 = a;
        double r1124759 = log1p(r1124758);
        double r1124760 = fmod(r1124757, r1124759);
        return r1124760;
}

↓

double f(double a, double c) {
        double r1124761 = c;
        double r1124762 = cosh(r1124761);
        double r1124763 = a;
        double r1124764 = log1p(r1124763);
        double r1124765 = fmod(r1124762, r1124764);
        double r1124766 = log(r1124765);
        double r1124767 = exp(r1124766);
        double r1124768 = sqrt(r1124767);
        double r1124769 = r1124766 * r1124766;
        double r1124770 = r1124766 * r1124769;
        double r1124771 = cbrt(r1124770);
        double r1124772 = exp(r1124771);
        double r1124773 = sqrt(r1124772);
        double r1124774 = r1124768 * r1124773;
        return r1124774;
}

Error

Bits error versus a

Bits error versus c

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-log 33.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 add-sqr-sqrt 33.9

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

7. Applied add-cbrt-cube 33.9

   \[\leadsto \sqrt{e^{\color{blue}{\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)}}}} \cdot \sqrt{e^{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}}\]

8. Final simplification 33.9

   \[\leadsto \sqrt{e^{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right)}} \cdot \sqrt{e^{\sqrt[3]{\log \left(\left(\cosh c\right) \bmod \left(\mathsf{log1p}\left(a\right)\right)\right) \cdot \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)}}}\]

Reproduce

herbie shell --seed 2019165 
(FPCore (a c)
  :name "Random Jason Timeout Test 004"
  (fmod (cosh c) (log1p a)))