Random Jason Timeout Test 012

Average Error: 61.2 → 60.3

Time: 26.2s

Precision: 64

• could not determine a ground truth for program body

  1. a = 9.095231353254208e+232

Math

\[\cos^{-1} \left({\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)\]

↓

\[\left(\sqrt[3]{\cos^{-1} \left({\left(\log \left(e^{\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)} \cdot \sqrt[3]{\cos^{-1} \left({\left(\log \left(e^{\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)}\right) \cdot \sqrt[3]{\cos^{-1} \left({\left(\log \left(e^{\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)}\]

C

double f(double a) {
        double r4990 = a;
        double r4991 = cosh(r4990);
        double r4992 = r4990 * r4990;
        double r4993 = fmod(r4991, r4992);
        double r4994 = log1p(r4990);
        double r4995 = pow(r4993, r4994);
        double r4996 = acos(r4995);
        return r4996;
}

↓

double f(double a) {
        double r4997 = a;
        double r4998 = cosh(r4997);
        double r4999 = r4997 * r4997;
        double r5000 = fmod(r4998, r4999);
        double r5001 = exp(r5000);
        double r5002 = log(r5001);
        double r5003 = log1p(r4997);
        double r5004 = pow(r5002, r5003);
        double r5005 = acos(r5004);
        double r5006 = cbrt(r5005);
        double r5007 = r5006 * r5006;
        double r5008 = r5007 * r5006;
        return r5008;
}

Error

Bits error versus a

Derivation

1. Initial program 61.2

   \[\cos^{-1} \left({\left(\left(\cosh a\right) \bmod \left(a \cdot a\right)\right)}^{\left(\mathsf{log1p}\left(a\right)\right)}\right)\]
2. Using strategy rm

3. Applied add-log-exp 60.3

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

5. Applied add-cube-cbrt 60.3

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

6. Final simplification 60.3

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

Reproduce

herbie shell --seed 2020001 +o rules:numerics
(FPCore (a)
  :name "Random Jason Timeout Test 012"
  :precision binary64
  (acos (pow (fmod (cosh a) (* a a)) (log1p a))))