Average Error: 31.5 → 31.5
Time: 5.3s
Precision: 64
\[{\left(\tan^{-1} \left(a \bmod \left(\sin^{-1} a\right)\right)\right)}^{\left(a \cdot a\right)}\]
↓
\[{\left(\tan^{-1} \left(a \bmod \left(\sin^{-1} a\right)\right)\right)}^{\left(a \cdot a\right)}\]
{\left(\tan^{-1} \left(a \bmod \left(\sin^{-1} a\right)\right)\right)}^{\left(a \cdot a\right)}
↓
{\left(\tan^{-1} \left(a \bmod \left(\sin^{-1} a\right)\right)\right)}^{\left(a \cdot a\right)}
double f(double a) {
        double r105785 = a;
        double r105786 = asin(r105785);
        double r105787 = fmod(r105785, r105786);
        double r105788 = atan(r105787);
        double r105789 = r105785 * r105785;
        double r105790 = pow(r105788, r105789);
        return r105790;
}
↓
double f(double a) {
        double r105791 = a;
        double r105792 = asin(r105791);
        double r105793 = fmod(r105791, r105792);
        double r105794 = atan(r105793);
        double r105795 = r105791 * r105791;
        double r105796 = pow(r105794, r105795);
        return r105796;
}

Error

Bits error versus a

Derivation

  1. Initial program 31.5

    \[{\left(\tan^{-1} \left(a \bmod \left(\sin^{-1} a\right)\right)\right)}^{\left(a \cdot a\right)}\]

  2. Final simplification31.5

    \[\leadsto {\left(\tan^{-1} \left(a \bmod \left(\sin^{-1} a\right)\right)\right)}^{\left(a \cdot a\right)}\]

Reproduce

herbie shell --seed 2020056 +o rules:numerics
(FPCore (a)
  :name "Fuzzer 002"
  :precision binary64
  (pow (atan (fmod a (asin a))) (* a a)))